Advance Data Structure MCQs
40 MCQs of Advance Data Structure 1) What is the load factor for an open addressing technique? 1 0 5 0.5 Answer: c) 0.5 Explanation: 2) For the given hash table, in what location will the element 58 be hashed using quadratic probing? 0 49 1 2 3 4 5 6 7 8 18 9 89 1 2 7 6 Answer: b) 2 3) Which one of the following data structures are preferred in database-system implementation? AVL tree B-tree B+ - tree Splay tree Answer: c) B+ - tree 4) 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. 8, _, _, _, _, _, 10 1, 8, 10, _, _, _, 3 1, _, _, _, _, _,3 1, 10, 8, _, _, _, 3 Answer: b) 1, 8, 10, _, _, _, 3 5) What maximum difference in heights between the leafs of a AVL tree is possible? log(n) where n...