This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Direct Addressing Tables”. 1. 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) Distinct array positions for keys based on priority 2. When is it appropriate … Read more

This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Min Hash”. 1. Which technique is used for finding similarity between two sets? a) MinHash b) Stack c) Priority Queue d) PAT Tree 2. Who invented the MinHash technique? a) Weiner b) Samuel F. B. Morse c) Friedrich Clemens Gerke … Read more

This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Hash Tree”. 1. Hash tree is generalization of ______ a) Heap b) Hash list c) BST d) B – tree 2. Hash tree is used in effective data verification in distributed systems. a) True b) False 3. Which of the … Read more

This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Double Hashing”. 1. Double hashing is one of the best methods available for open addressing. a) True b) False 2. 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) … Read more

This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Hashing Functions”. 1. Which scheme uses a randomization approach? a) hashing by division b) hashing by multiplication c) universal hashing d) open addressing 2. Which hash function satisfies the condition of simple uniform hashing? a) h(k) = lowerbound(km) b) h(k)= … Read more

This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Hash Tables with Quadratic Probing”. 1. Which of the following schemes does quadratic probing come under? a) rehashing b) extended hashing c) separate chaining d) open addressing 2. Quadratic probing overcomes primary collision. a) True b) False 3. What kind … Read more

This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Hash Tables with Linear Probing”. 1. Which of the following problems occur due to linear probing? a) Primary collision b) Secondary collision c) Separate chaining d) Extendible hashing 2. How many probes are required on average for insertion and successful … Read more

This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Hash Tables Chaining with List Heads”. 1. Which of the following helps keys to be mapped into addresses? a) hash function b) separate chaining c) open addressing d) chaining using a linked list 2. What is the advantage of the … Read more

This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Hash Tables Chaining with Binary Trees”. 1. Which of the following variant of a hash table has the best cache performance? a) hash table using a linked list for separate chaining b) hash table using binary search tree for separate … Read more

This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Hash Tables Chaining using Doubly Linked Lists”. 1. Which of the following is used in hash tables to determine the index of any input record? a) hash function b) hash linked list c) hash tree d) hash chaining 2. What … Read more

advertisement

Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He is Linux Kernel Developer & SAN Architect and is passionate about competency developments in these areas. He lives in Bangalore and delivers focused training sessions to IT professionals in Linux Kernel, Linux Debugging, Linux Device Drivers, Linux Networking, Linux Storage, Advanced C Programming, SAN Storage Technologies, SCSI Internals & Storage Protocols such as iSCSI & Fiber Channel. Stay connected with him @
LinkedIn | Youtube | Instagram | Facebook | Twitter