Consider a hash table of size 10 in which linear probing is used to avoid collisions. The hash function used is HF(key) . Now consider the following hash table after insertion of these keys: 42,23,34,52,46,33 not necessarily in the same order.Find the number of input sequences possible that results in the same hash table as above.a)24b)30c)20d)32Correct answer is option 'B'. Can you explain this answer?

EduRev

All Courses

Explore Courses UPSC Exam UPSC Test Series Free Notes EduRev Infinity

Open App

GATE Exam > GATE Questions > Consider a hash table of size 10 in which li...

Join the Discussion on the App

Find the number of input sequences possible that results in the same hash table as above.

a)
24
b)
30
c)
20
d)
32

Correct answer is option 'B'. Can you explain this answer?

FREE This question is part of

Practice Test: Computer Science Engineering (CSE) - 13

Attempt Test

Attempt this Test

Verified Answer

Consider a hash table of size 10 in which linear probing is used to a...

Here keys are given in the sequence

42, 23, 34, 52, 46, 33

to get the output as above has a table, 42 must occur before 52 since the hash table is filled using linear probing.

Also, (42, 23, 34) should come before 52, but these 3 values can come in any order.

So, total possibilities = 3! = 6

Now 33 should occur at last of all the values. So, 33 is fixed to appear at 6th place.

Now 46 can appear at any of the remaining 5 positions.

Total possibility = 3! × 5 = 30

Hence, the answer would be 30.

View all questions of this test

View all answers Start learning for free

< Previous Question Next Question >

Explore Courses for GATE exam

Similar GATE Doubts

A hash table of length 10 is taken for insertion of the keys with hash function h(key)= key mod 10. If Collision occurs, it is resolved with quadratic probing. The following sequence of keys are inserted:46, 36, 34, 24, 52, 57, 56Which of the following cannot be inserted to the table due to quadratic probing?

View answer

Load the keys 23, 13, 21, 14, 7, 8, and 15 in this order, in a hash table of size 7 using quadratic probing with c(i)= ±i^2 the hash function h(key) = key % 7.[Note: The required probe sequences are given by: h_i (key)= (h(key)±i^2 )%7,i=0,1,2,3,....]How many collisions can occur in the hash table?

View answer

Consider a double hashing scheme in which the primary hash function is h1(k) = k mod 23 and the secondary hash function is h2(k) = 1 + (k mod 19). Assume that the table size is 23. Then the address returned by probe 1 in the probe sequence (assume that the probe sequence begins at probe 0) for key value k = 90 is ________. Correct answer is '13'. Can you explain this answer?

View answer

Consider a simple communication system where multiple nodes are connected by a shared broadcast medium (like Ethernet or wireless). The nodes in the system use the following carrier-sense based medium access protocol. A node that receives a packet to transmit will carrier-sense the medium for 5 units of time. If the node does not detect any other transmission in this duration, it starts transmitting its packet in the next time unit. If the node detects another transmission, it waits until this other transmission finishes, and then begins to carrier-sense for 5 time units again. Once they start to transmit, nodes do not perform any collision detection and continue transmission even if a collision occurs. All transmissions last for 20 units of time. Assume that the transmission signal travels at the speed of 10 meters per unit time in the medium.Assume that the system has two nodes P and Q, located at a distance d meters from each other. P starts transmitting a packet at time t=0 after successfully completing its carrier-sense phase. Node Q has a packet to transmit at time t=0 and begins to carrier-sense the medium. The maximum distance d (in meters, rounded to the closest integer) that allows Q to successfully avoid a collision between its proposed transmission and P’s ongoing transmission is _____. Correct answer is '50 to 50'. Can you explain this answer?

View answer

Consider the following statements:S1 : When in any application the number of insertion are very large but the number of deletion are very less. Then unordered array data structure give better performance than ordered array data structure.S2 : When in any application number of insertion and number of deletion are same then binary search tree data structure give better performance than max heap data structure.Which of the following is correct?

View answer

Consider a hash table of size 10 in which linear probing is used to avoid collisions. The hash function used is HF(key) . Now consider the following hash table after insertion of these keys: 42,23,34,52,46,33 not necessarily in the same order.Find the number of input sequences possible that results in the same hash table as above.a)24b)30c)20d)32Correct answer is option 'B'. Can you explain this answer?

Share with a Friend

Answer this doubt

Question Description
Consider a hash table of size 10 in which linear probing is used to avoid collisions. The hash function used is HF(key) . Now consider the following hash table after insertion of these keys: 42,23,34,52,46,33 not necessarily in the same order.Find the number of input sequences possible that results in the same hash table as above.a)24b)30c)20d)32Correct answer is option 'B'. Can you explain this answer? for GATE 2024 is part of GATE preparation. The Question and answers have been prepared according to the GATE exam syllabus. Information about Consider a hash table of size 10 in which linear probing is used to avoid collisions. The hash function used is HF(key) . Now consider the following hash table after insertion of these keys: 42,23,34,52,46,33 not necessarily in the same order.Find the number of input sequences possible that results in the same hash table as above.a)24b)30c)20d)32Correct answer is option 'B'. Can you explain this answer? covers all topics & solutions for GATE 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Consider a hash table of size 10 in which linear probing is used to avoid collisions. The hash function used is HF(key) . Now consider the following hash table after insertion of these keys: 42,23,34,52,46,33 not necessarily in the same order.Find the number of input sequences possible that results in the same hash table as above.a)24b)30c)20d)32Correct answer is option 'B'. Can you explain this answer?.

Solutions for Consider a hash table of size 10 in which linear probing is used to avoid collisions. The hash function used is HF(key) . Now consider the following hash table after insertion of these keys: 42,23,34,52,46,33 not necessarily in the same order.Find the number of input sequences possible that results in the same hash table as above.a)24b)30c)20d)32Correct answer is option 'B'. Can you explain this answer? in English & in Hindi are available as part of our courses for GATE. Download more important topics, notes, lectures and mock test series for GATE Exam by signing up for free.

Here you can find the meaning of Consider a hash table of size 10 in which linear probing is used to avoid collisions. The hash function used is HF(key) . Now consider the following hash table after insertion of these keys: 42,23,34,52,46,33 not necessarily in the same order.Find the number of input sequences possible that results in the same hash table as above.a)24b)30c)20d)32Correct answer is option 'B'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of Consider a hash table of size 10 in which linear probing is used to avoid collisions. The hash function used is HF(key) . Now consider the following hash table after insertion of these keys: 42,23,34,52,46,33 not necessarily in the same order.Find the number of input sequences possible that results in the same hash table as above.a)24b)30c)20d)32Correct answer is option 'B'. Can you explain this answer?, a detailed solution for Consider a hash table of size 10 in which linear probing is used to avoid collisions. The hash function used is HF(key) . Now consider the following hash table after insertion of these keys: 42,23,34,52,46,33 not necessarily in the same order.Find the number of input sequences possible that results in the same hash table as above.a)24b)30c)20d)32Correct answer is option 'B'. Can you explain this answer? has been provided alongside types of Consider a hash table of size 10 in which linear probing is used to avoid collisions. The hash function used is HF(key) . Now consider the following hash table after insertion of these keys: 42,23,34,52,46,33 not necessarily in the same order.Find the number of input sequences possible that results in the same hash table as above.a)24b)30c)20d)32Correct answer is option 'B'. Can you explain this answer? theory, EduRev gives you an ample number of questions to practice Consider a hash table of size 10 in which linear probing is used to avoid collisions. The hash function used is HF(key) . Now consider the following hash table after insertion of these keys: 42,23,34,52,46,33 not necessarily in the same order.Find the number of input sequences possible that results in the same hash table as above.a)24b)30c)20d)32Correct answer is option 'B'. Can you explain this answer? tests, examples and also practice GATE tests.

Explore Courses for GATE exam