UGC NET JULY 2018 (Computer Science And Applications Paper-II) (Question 23)
Q 23. A hash function h defined h(key) = key mod 7, with linear probing, is used to inset the keys
(1) 3
(2) 4
(3) 5
(4) 6
Answer : (3) 5
In above question there is a term Linear probing is a scheme in computer programming for resolving collisions in hash tables, data structures for maintaining a collection of key–value pairs and looking up the value associated with a given key.
Q 23. A hash function h defined h(key) = key mod 7, with linear probing, is used to inset the keys
44, 45, 79, 55, 91, 18, 63
into a table indexed
from 0 to 6. What will be the location of key 18 ?(1) 3
(2) 4
(3) 5
(4) 6
Answer : (3) 5
In above question there is a term Linear probing is a scheme in computer programming for resolving collisions in hash tables, data structures for maintaining a collection of key–value pairs and looking up the value associated with a given key.
0 comments:
Post a Comment