12. In a leftist heap of size n, the worst case time complexity of onc insert opera tion is (A)O(1) (B)O(log*n) (C)O(logn) (D)O(n) (E)O(n log n)

1. Consider a hash table with 13 slots. Suppose we use linear probing as the collision resolution strategy, where the i'th probe position (wherc i = 0, 1, 2, ..) for a key k is given by the function h(k,i) = (k+i) (mod 13) Suppose we insert the following 9 keys into the hash table in the exact sequence: 66, 4, 84, 91, 100, 72, 70, 37, 61. What is the index of the slot storing the key 61? (A)2 (B)8 (C)9 (D)10 (E) None of above

12. In a leftist heap of size n, the worst case time complexity of onc insert opera tion is
(A)O(1)
(B)O(log*n)
(C)O(logn)
(D)O(n)
(E)O(n log n)

相關試題

相關試卷