CS502 Midterm Solved Quizzes Combined

CS502 - Fundamentals of Algorithms

Quiz No.1 12-11-2012

Q1. of 10 ( Start time: 06:18:58 PM ) Total Marks: 1

Q2. of 10 ( Start time: 06:19:38 PM ) Total Marks: 1

Q3. of 10 ( Start time: 06:20:18 PM ) Total Marks: 1

Sieve Technique can be applied to selection problem?

True

False

Q4. of 10 ( Start time: 06:21:10 PM ) Total Marks: 1

Q5. of 10 ( Start time: 06:21:39 PM ) Total Marks: 1

heap

array

Q6. of 10 ( Start time: 06:22:04 PM ) Total Marks: 1

pivot Sieve

Selection

Q7. of 10 ( Start time: 06:22:40 PM ) Total Marks: 1

True

False

Q8. of 10 ( Start time: 06:23:26 PM ) Total Marks: 1

order to move a tower of 5 rings from one peg to another, how many ring moves are required?

Q9. of 10 ( Start time: 06:24:44 PM ) Total Marks: 1

linear

geometric

exponent

Q10. of 10 ( Start time: 06:25:43 PM ) Total Marks: 1

For the heap sort, access to nodes involves simple _______________ operations.

binary algebraic logarithmic

precisely

The sieve technique works in ___________ as follows

phases

numbers integers routines Slow sorting algorithms run in,

T(n^2)

T(n) T( log n)

heap

array

linear

geometric

exponent

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