CS502- Design and Analysis of Algorithms Quiz

0
148

                  CS502- Design and Analysis of Algorithms Quiz

1. For the sieve technique we solve the problem,




Answer is A
(Handsouts Page 35 Line 4)

2. We do sorting to,




Answer is D
(Handsouts Page 39 Line 6)

3. The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,




Answer is A
(handsouts page 34 )

 

4. In Sieve Technique we don’t know which item is of interest


…Answer is A)
handsouts page 34

CS502- Design and Analysis of Algorithms Quiz

5. In the analysis of Selection algorithm, we make a number of passes, in fact it could be as many as,




Answer is C
(handsouts page 37) )

6. Divide-and-conquer as breaking the problem into a small number of pivot Sieve




…Answer is A)
handouts page 27

7. A heap is a left-complete binary tree that conforms to the




Answer is C
(handouts page 40)

Next Quiz

LEAVE A REPLY

Please enter your comment!
Please enter your name here