1
GATE CSE 2009
MCQ (Single Correct Answer)
+2
-0.6
The keys 12, 18, 13, 2, 3, 23, 5 and 15 are inserted into an initially empty hash table of length 10 using open addressing with hash function h(k) = k mod 10 and linear probing. What is the resultant hash table?
A
GATE CSE 2009 Data Structures - Hashing Question 11 English Option 1
B
GATE CSE 2009 Data Structures - Hashing Question 11 English Option 2
C
GATE CSE 2009 Data Structures - Hashing Question 11 English Option 3
D
GATE CSE 2009 Data Structures - Hashing Question 11 English Option 4
2
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
Consider a hash table of size 11 that uses open addressing with linear probing. Let h(k) = k mod 11 be the hash function used. A sequence of records with keys

43 36 92 87 11 4 71 13 14 is inserted into an initially empty hash table, the bins of which are indexed from zero to ten. What is the index of the bin into which the last record is inserted?
A
2
B
4
C
6
D
7
3
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
Consider a hash table of size seven, with starting index zero, and a hash function (3x + 4)mod7. Assuming the hash table is initially empty, which of the following is the contents of the table when the sequence 1, 3, 8, 10 is inserted into the table using closed hashing? Note that ‘_’ denotes an empty location in the table.
A
8, _, _, _, _, _, 10
B
1, 8, 10, _, _, _, 3
C
1, _, _, _, _, _,3
D
1, 10, 8, _, _, _, 3
4
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
Consider a hash function that distributes keys uniformly. The hash table size is 20. After hashing of how many keys will the probability that any new key hashed collides with an existing one exceed 0.5.
A
5
B
6
C
7
D
10
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
CBSE
Class 12