Q1 :Load the keys 20, 13, 30, 40 and 10, in this order, in a hash table of size 5 using quadratic probing with c(i) = i^2 and the hash function: h(key) = key % 5. Multi Line Text.

Q2 : The Time complexity of Prims Algorithm is......................?. Single choice.

O(E lg V)

O(E lg E)

O(V lg V)

None of the answers is correct

Q3: If we have the following Hash Function: h(k) = k mod 156 This will map all the keys into numbers within the interval ............?. Single choice.

[1, 156]

[k, 156]

[0, 156]

[0, 155]

Q 4: Using the Multiplication Method : Find the hash key for k=18 , m = 500, A = 0.618. Single choice.

None of the answers is correct

0.124

11.124

62

Q5 :n the Hashing with Chaining: The Worst-case time to search is .............. Single choice.

Big theta of (lg n), plus time to compute the hash function.

Big theta of (n^2), plus time to compute the hash function.

Big theta of (n), plus time to compute the hash function.

Big theta of (1), plus time to compute the hash function.