This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Hash Tables Chaining using Linked Lists”. 1. The case in which a key other than the desired one is kept at the identified location is called? a) Hashing b) Collision c) Chaining d) Open addressing 2. What data organization method … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Hash Tables”. 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. If several … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Suffix Tree – 2”. 1. What is a time complexity for x pattern occurrence of length n? a) O (log n!) b) Ɵ (n!) c) O (n2) d) Ɵ (n + x) 2. What is a time complexity for finding … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Suffix Tree”. 1. What is the other name for Suffix Tree? a) Array b) Stack c) Priority Queue d) PAT Tree 2. Which tree allows fast implementation of string operation? a) Rope Tree b) Suffix Tree c) Tango Tree d) … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Trie”. 1. Trie is also known as _________ a) Digital Tree b) Treap c) Binomial Tree d) 2-3 Tree 2. What traversal over trie gives the lexicographical sorting of the set of the strings? a) postorder b) preorders c) inorder … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Min/Max Heap”. 1. Descending priority queue can be implemented using ______ a) max heap b) min heap c) min-max heap d) trie 2. Min heap can be used to implement selection sort. a) True b) False 3. Which of the … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Skew Heap”. 1. ___________ is a self-adjusting version of a leftist heap. a) Rightist heap b) Skew heap c) d-heap d) Binary heap 2. The worst case running time of all operations in a skew heap is given as? a) … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Leftlist Heap”. 1. Pointer manipulation is generally more time-consuming than multiplication and division. a) true b) false 2. How many properties does a leftist heap support? a) 1 b) 2 c) 3 d) 4 3. In a leftist heap, the … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Pairing Heap”. 1. What is the reason for the efficiency of a pairing heap? a) simplicity b) time-efficient c) space-efficient d) advanced 2. How is a pairing heap represented? a) binary tree b) fibonacci tree c) heap ordered tree d) … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Ternary Heap – 2”. 1. What is the time complexity for inserting a new item in a ternary heap of n elements? a) O (log n/ log 3) b) O (n!) c) O (n) d) O (1) 2. Is decrease … Read more
