We have been working very hard since 2009 to facilitate in your learning Read More. We can't keep up without your support. Donate Now.
+ Link For Assignments, GDBs & Online Quizzes Solution |
+ Link For Past Papers, Solved MCQs, Short Notes & More |
Please share your quiz to help each other...
Tags:
+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)
+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)
+ Click Here to Search (Looking For something at vustudents.ning.com?) + Click Here To Join (Our facebook study Group)My Quiz Absolutely same as above by gurria
CS502 - Fundamentals of Algorithms
Quiz No.5 Dated FEB 15^{TH} 2013
Syed M. Umair Saulat thanks
ITS MY TODAY QUIZ
mera quiz same ayesha ali (MIT 3) jesa hai
cs502 5th quizzzzzz
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
© 2020 Created by +M.Tariq Malik. Powered by
Promote Us | Report an Issue | Privacy Policy | Terms of Service
We are user-generated contents site. All product, videos, pictures & others contents on vustudents.ning.com don't seem to be beneath our Copyrights & belong to their respected owners & freely available on public domains. We believe in Our Policy & do according to them. If Any content is offensive in your Copyrights then please email at m.tariqmalik@gmail.com or Contact us at contact Page with copyright detail & We will happy to remove it immediately.
Management: Admins ::: Moderators
Awards Badges List | Moderators Group
All Members | Featured Members | Top Reputation Members | Angels Members | Intellectual Members | Criteria for Selection
Become a Team Member | Safety Guidelines for New | Site FAQ & Rules | Safety Matters | Online Safety | Rules For Blog Post