CS502 Grand Quiz 2020

WMIg3Q

CS502 GRAND QUIZ SOLVED

Q1. The sequence of merge sort algorithm is:

1. Divide Combine-Conquer
2. Conquer-Divide-Combine
3. Divide-Conquer-Combine
4. Combine-Divide-Conquer

Correct answer: Divide-Conquer-Combine

2. In Knapsack Problem, limitation is that an item can either be put in the bag or not. Fractional items are not allowed.

1. 0
2. 1
3. Fractional
4. In Selection algorithm, we assume pivot selection takes theta runnin g time.

1. n2
2. n3
3. log (n)

Q4. In Heap Sort algorithm (using max heap), when every time maximum

1. n

Page - 36 · c. 0/1 · WMIg3Q

elements removed from top a. We call merge Sort Algorithm b. it becomes Order n2 Algorithm c. Divide and Conquer strategy helps us

d. We are left with a hole

Page – 41

5. If matrix A of dimension p x q is multiply with matrix B of dimension q x r, then each entry in resultant matrix takes time.

b. O (1) c. O (p x q) d. O (q x r)

a. O (q) · Page - 84 · WMIg3Q

6. _ is a method of solving a problem in which we check all possible solutions to the problem to find the solution we need. a. Plane-Sweep Algorithm b. Sorting Algorithm

d. Greedy approach

Q7. The worst case running time of Quick sort algorithm _.

1. Cannot be quadratic
2. Is quadratic google QuickSort and its Analysis ( ) &

Correct answer: Is quadratic google QuickSort and its Analysis ( ) &

tm

c. ls always Exponential d. Is linear

Q8. In max heap (for Heap Sort algorithm), when every time maximum element is removed from top we replace it with leaf in the tree.

1. second last
2. First
3. Any

Q9. Quick sort algorithm was developed by -

1. AlferdAho
2. Sedgewick
3. John Vincent Atanasoff

Q10. If Matrix-A has dimensions "3x2" and Matrix-B has dimensions "2x3", then multiplication of Matrix-A and Matrix-B will result a new Matrix-C having dimensions.

1. Brute-Force Algorithm

google · b. Last · Page -41 · d. Tony Hoare · – Google wikipedia