Q1:Using Direct Addressing Hashing: Suppose that the keys are 5 digit numbers, then the size of the array need to store 1000 records is...............?. Single choice.

100

1000000

1000

100000

Q2:Kruskal MST Algorithm is......................?. Single choice.

None of the answers is correct

Edge based algorithm.

Arc based algorithm.

Vertex based algorithm.

Q3:Through The recursion-tree method solve the following Recurrence: T(n)=2T(n/2)+1 Remark (The sum of geometric series ((1 + 2 + 4 +8+ ..+n)), is equal to ((2n-1)). Multi Line Text.

Q4:If we have Division Method with m=2^5 then h(k) is just the least significant ............bits of k?. Single choice.

5

None of the answers

2

32

Q5:Due to the Amdahl's Law: If 50% of the program must be performed sequentially, no matter how many processors you use, you can only get a. Single choice.

3x speedup.

2x speedup.

6x speedup.

4x speedup.