- 6 Suppose We Had A Hash Table Whose Hash Function Is N 12 If The Number 35 Is Already In The Hash Table Which Of 1 (74.24 KiB) Viewed 50 times
6. Suppose we had a hash table whose hash function is "n % 12", if the number 35 is already in the hash table, which of
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
6. Suppose we had a hash table whose hash function is "n % 12", if the number 35 is already in the hash table, which of
6. Suppose we had a hash table whose hash function is "n % 12", if the number 35 is already in the hash table, which of the following numbers would cause a collision? B. 145 C. 143 D. 148 7. Here is an array of ten integers: 5389170264 The array after the FIRST iteration of the large loop in a selection sort (sorting from smallest to largest). A. 03 8 9 1 75 264 B. 2 6 4 0 3 891 75 C. 2 6 4 9 170 385 D. 0 3 8 2 6 491 7 5 8. Which of the following is false about the red black tree where n is the size of the tree. a. A red-black tree is a balanced binary search tree in which the root element is colored black. b. The height of any red-black tree is logarithmic in n. c. The height of any red-black tree depends on the values inserted to it. d. None of the above. 9. Suppose we had a hash table whose hash function is "n % 12", if the number 35 is already in the hash table, which of the following numbers would cause a collision? B. 144 B. 145 C. 143 D. 148 10. What kind of initialization needs to be done for a chained hash table? A. None. B. The key at each array location must be initialized. C. The head pointer of each chain must be set to null. D. Both B and C must be carried out. 11. A Priority-Queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal of the heap is given below: 10, 8, 5, 3, 2 Two new elements "1' and "7' are inserted in the heap in that order. The level-order traversal of the heap after the insertion of the elements is: (a) 10, 8, 7, 5, 3, 2, 1 (b) 10, 8, 7, 2, 3, 1, 5 (c) 10, 8, 7, 1, 2, 3, 5 (d) 10, 8, 7, 3, 2, 1, 5 12. Consider a min heap, represented by the following array: 3,4,6,7,5 After calling the function deleteMin(). Which of the following is the updated min heap? E. 4,6,7,5 F. 6,7,5,4 G. 4,5,6,7 H. 4,6,5,7 2