Tutorials
PPTs
Lecture Notes
Objective Questions
Lab ProgramsObjective Type Questions & Answers
Data Structures Objective Type Question Bank-Unit-2
1. What is a hash table?
A . A structure that maps values to keys
B . A structure that maps keys to values
C . A structure used for storage
D . A structure used to implement stack and queue
2. What is direct addressing?
A . Distinct array position for every possible key
B . Fewer array positions than keys
C . Fewer keys than array positions
D . Same array position for all keys
3. What is a hash function?
A . A function has allocated memory to keys
B . A function that computes the location of the key in the array
C . A function that creates an array
D . A function that computes the location of the values in the array
4. Which of the following is not a technique to avoid a collision?
A . Make the hash function appear random
B . Use the chaining method
C . Use uniform hashing
D . Increasing hash table size
5. What is the advantage of the hash table over a linked list?
A . faster access of data
B . easy to implement
C . very efficient for less number of entries
D . exhibit good locality of reference
6. Which of the following trait of a hash function is most desirable?
A . it should cause less collisions
B . it should cause more collisions
C . it should occupy less space
D . it should be easy to implement
7. What is the hash function used in the division method?
A . h(k) = k/m
B . h(k) = k mod m
C . h(k) = m/k
D . h(k) = m mod k
8. Which of the following schemes does quadratic probing come under?
A . rehashing
B . extended hashing
C . separate chaining
D . open addressing
9. Which among the following is the best technique to handle collision?
A . Quadratic probing
B . Linear probing
C . Double hashing
D . Separate chaining
10. What is the formula used in quadratic probing?
A . Hash key = key mod table size
B . Hash key=(hash(x)+F(i)) mod table size
C . Hash key=(hash(x)+F(i2)) mod table size
D . H(x) = x mod 17
11. What is the hash function used in Double Hashing?
A . (h1(k) – i*h2(k))mod m
B . h1(k) + h2(k)
C . (h1(k) + i*h2(k))mod m
D . (h1(k) + h2(k))mod m
12. Which of the following is not a collision resolution technique?
A . Separate chaining
B . Linear probing
C . Quadratic probing
D . Extendible hashing
13. Which of the following operations are done in a hash table?
A . Insert only
B . Search only
C . Insert and search
D . Replace
14. Which of the following is identical to that of a separate chaining hash node?
A . Linked list
B . Array
C . Stack
D . Queue
15. Which of the following is a disadvantage of using separate chaining using linked lists?
A . It requires many pointers
B . It requires linked lists
C . It uses array
D . It does not resolve collision
16. What is a skip list?
A . a linkedlist with size value in nodes
B . a linkedlist that allows faster search within an ordered sequence
C . a linkedlist that allows slower search within an ordered sequence
D . a tree which is in the form of linked list
17. The nodes in a skip list may have many forward references. their number is determined
A . probabilistically
B . randomly
C . sequentially
D . orthogonally
18. Which of the following is an advantage of open addressing over separate chaining?
A . it is simpler to implement
B . table never gets full
C . it is less sensitive to hash function
D . it has better cache performance
Fill in the Blanks
19. If several elements are competing for the same bucket in the hash table, what is it called?
20. A good hash approach is to derive the hash value that is expected to be dependent of any patterns that might exist in the data(T/F).
21. Collisions can be reduced by choosing a hash function randomly in a way that is independent of the keys that are actually to be stored(T/F).
22. Hashing is the problem of finding an appropriate mapping of keys into addresses(T/F).
Relevant Materials :
☞ Data Structures Objective Type Question Bank-Unit-1 - [ DS ]
☞ Data Structures Objective Type Question Bank-Unit-2 - [ DS ]
☞ Data Structures Objective Type Question Bank-Unit-3 - [ DS ]
☞ Data Structures Objective Type Question Bank-Unit-4 - [ DS ]
☞ Data Structures Objective Type Question Bank-Unit-5 - [ DS ]
Similar Materials :
☞ R - Programming MCQs - Unit-1 - [ R-Programming ]
☞ R - Programming MCQs - Unit-2 - [ R-Programming ]
☞ R - Programming MCQs - Unit-3 - [ R-Programming ]
☞ R - Programming MCQs - Unit-4 - [ R-Programming ]
☞ R - Programming MCQs - Unit-5 - [ R-Programming ]
☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-1 - [ FLAT ]
☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-2 - [ FLAT ]
☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-3 - [ FLAT ]
☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-4 - [ FLAT ]
☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-5 - [ FLAT ]
☞ PPS MCQs - Unit-1 - [ PPS ]
☞ PPS MCQs - Unit-2 - [ PPS ]
☞ PPS MCQs - Unit-3 - [ PPS ]
☞ PPS MCQs - Unit-4 - [ PPS ]
☞ PPS MCQs - Unit-5 - [ PPS ]
☞ Object Oriented Programming through Java MCQs - Unit-1 - [ OOP_JAVA ]
☞ Object Oriented Programming through Java MCQs - Unit-2 - [ OOP_JAVA ]
☞ Object Oriented Programming through Java MCQs - Unit-3 - [ OOP_JAVA ]
☞ Object Oriented Programming through Java MCQs - Unit-4 - [ OOP_JAVA ]
☞ Object Oriented Programming through Java MCQs - Unit-5 - [ OOP_JAVA ]
☞ Design and Analysis of Algorithms MCQs - Unit-1 - [ DAA ]
☞ Design and Analysis of Algorithms MCQs - Unit-2 - [ DAA ]
☞ Design and Analysis of Algorithms MCQs - Unit-3 - [ DAA ]
☞ Design and Analysis of Algorithms MCQs - Unit-4 - [ DAA ]
☞ Design and Analysis of Algorithms MCQs - Unit-5 - [ DAA ]
☞ Software Engineering MCQs - Unit-1 - [ SE ]
☞ Software Engineering MCQs - Unit-2 - [ SE ]
☞ Software Engineering MCQs - Unit-3 - [ SE ]
☞ Software Engineering MCQs - Unit-4 - [ SE ]
☞ Software Engineering MCQs - Unit-5 - [ SE ]
☞ Data Mining MCQs - Unit-1 - [ DM ]
☞ Data Mining MCQs - Unit-2 - [ DM ]
☞ Data Mining MCQs - Unit-3 - [ DM ]
☞ Data Mining MCQs - Unit-4 - [ DM ]
☞ Data Mining MCQs - Unit-5 - [ DM ]
☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-1 - [ COA ]
☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-2 - [ COA ]
☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-3 - [ COA ]
☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-4 - [ COA ]
☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-5 - [ COA ]
☞ Database Management System Objective Type Question Bank-Unit-1 - [ DBMS ]
☞ Database Management System Objective Type Question Bank-Unit-2 - [ DBMS ]
☞ Database Management System Objective Type Question Bank-Unit-3 - [ DBMS ]
☞ Database Management System Objective Type Question Bank-Unit-4 - [ DBMS ]
☞ Database Management System Objective Type Question Bank-Unit-5 - [ DBMS ]
☞ Cyber Forensics Objective Type Question Bank-Part-2 - [ Cyber Forensics ]
☞ Cyber Forensics Objective Type Question Bank-Part-1 - [ Cyber Forensics ]
☞ Java Programming Objective Type Question Bank - [ Java Programming ]
☞ Java Programming Objective Type Questions-Part-1 - [ Java Programming ]
☞ Java Programming Objective Type Questions-Part-2 - [ Java Programming ]