# www.vustudents.ning.com

We non-commercial site working hard since 2009 to facilitate learning Read More. We can't keep up without your support. Donate.

Please share your quiz to help each other... Views: 1177

Attachments:

### Replies to This Discussion

My Quiz Absolutely  same as above by gurria

CS502 - Fundamentals of Algorithms

Quiz No.5 Dated FEB 15TH 2013

Attachments:

Syed M. Umair Saulat thanks 1. Divide-and-conquer as breaking the problem into a small number of
2. The reason for introducing Sieve Technique algorithm is that it illustrates a very important special case of,
3. Sieve Technique applies to problems where we are interested in finding a single item from a larger set of _____________
4. Dijkstra’s algorithm :
5. In Sieve Technique we do not know which item is of interest
6. The sieve technique works in ___________ as follows
7. Consider the following Algorithm: Fun(n){ if (n=1) return 1 else return (n * Fun(n-1)) } Recurrence for the above algorithm is:
8. Theta asymptotic notation for T (n) :
9. For the Sieve Technique we take time
10. For the sieve technique we solve the problem,

ITS MY TODAY QUIZ

mera quiz same ayesha ali (MIT 3) jesa hai

cs502 5th quizzzzzz Attachments:

Quiz No.5...............CS502

Sieve Technique can be applied to selection problem?
Select correct option:

True
False

Question # 7 of 10 ( Start time: 06:22:40 PM ) Total Marks: 1
In Sieve Technique we do not know which item is of interest
Select correct option:

True
False

The recurrence relation of Tower of Hanoi is given below T(n)={1 if n=1 and 2T(n-1) if n >1 In order to move a tower of 5 rings from one peg to another, how many ring moves are required?
Select correct option:

16
10
32
31

For the sieve technique we solve the problem,
Select correct option:
recursively
mathematically
precisely
accurately

The sieve technique works in ___________ as follows
Select correct option:
phases
numbers
integers
routines
Slow sorting algorithms run in,

The sieve technique is a special case, where the number of sub problems is just
Select correct option:
5
many
1
few

The recurrence relation of Tower of Hanoi is given below T(n)={1 if n=1 and 2T(n-1) if n >1 In order to move a tower of 5 rings from one peg to another, how many ring moves are required?
Select correct option:
16
10
32
31

Consider the following Algorithm: Fun(n){ if (n=1)

return 1 else return (n * Fun(n-1)) } Recurrence

for the above algorithm is:

Select correct option:

nT(n-1)+1

2T(n-1)+1

T(n-1)+cn

T(n-1)+1

For the Sieve Technique we take time

Select correct option:

T(nk)

T(n / 3)

n^2

n/3

thanks u all for sharing................it is very very helpful     