We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Looking For Something at vustudents.ning.com? Click Here to Search

www.bit.ly/vucodes

+ Link For Assignments, GDBs & Online Quizzes Solution

www.bit.ly/papersvu

+ Link For Past Papers, Solved MCQs, Short Notes & More


Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion

How to Add New Discussion in Study Group ? Step By Step Guide Click Here.

CS502 - """QUIZ No.1"""Fundamentals of Algorithms, Start Date May 03, 2013 12:00 AM, End Date May 04,

+ How to Follow the New Added Discussions at Your Mail Address?

+ How to Join Subject Study Groups & Get Helping Material?

+ How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?

+ VU Students Reserves The Right to Delete Your Profile, If?


See Your Saved Posts Timeline

Views: 1956

.

+ 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)

Replies to This Discussion

Awais (MCS) thanks for sharing ur quiz 

This is my quiz

Consider the following Algorithm: Fun(n){ if (n=1) return 1 else return (n * Fun(n-1)) } Recurrence for the above algorithm is:

nT(n-1)+1

2T(n-1)+1

T(n-1)+cn

T(n-1)+1

Heaps can be stored in arrays without using any pointers; this is due to the ____________ nature of the binary tree,

left-complete

right-complete

tree nodes

tree leaves

Brute-force algorithm uses no intelligence in pruning out decisions.

True

False

f(n) and g(n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.

Results

Variables

Size

Growth rates

In analysis, the Lower Bound means the function grows asymptotically at least as fast as its largest term.

True

False

Efficient algorithm requires less computational…….

Memory

Running Time

Memory and Running Time

Energy

The O-notation is used to state only the asymptotic ________bounds.

Two

Lower

Upper

Both lower & upper

For the worst-case running time analysis, the nested loop structure containing one “for” and one “while” loop, might be expressed as a pair of _________nested summations.

1 (not confirm )

2

3

4

Bint-E-Adam thanks for sharing ur quiz 

thanks

 jasmine thanks for sharing 

RSS

Latest Activity

Volunteer and + ! ! ! ! ! ! ! ! ђคlєє๓ค ! are now friends
6 minutes ago
+ ! ! ! ! ! ! ! ! ђคlєє๓ค ! posted discussions
15 minutes ago
Volunteer replied to + ! ! ❥ρsүcнσ༄ ! ! +'s discussion !!!Thanks to all for wishing me and also making my birthday so special!!!
20 minutes ago
Volunteer liked + ! ! ❥ρsүcнσ༄ ! ! +'s discussion !!!Thanks to all for wishing me and also making my birthday so special!!!
20 minutes ago
+ ! ! ❥ρsүcнσ༄ ! ! + replied to + ! ! ❥ρsүcнσ༄ ! ! +'s discussion !!!Thanks to all for wishing me and also making my birthday so special!!!
23 minutes ago
+ ! ! ❥ρsүcнσ༄ ! ! + replied to + ! ! ❥ρsүcнσ༄ ! ! +'s discussion !!!Thanks to all for wishing me and also making my birthday so special!!!
23 minutes ago
+ ! ! ! ❣ Sanam ❣ !+ replied to + ! Eugene Fitzherbert !'s discussion THE WAY OF TEARS
1 hour ago
BS MATH replied to _♣ ♠ Ω HαααŇǃ ™ Ф ♠ ♣ _'s discussion REAL Life Story of a VU Female Student ..... (MUST READ) -- Thought Provoking
1 hour ago
+ıllıllı $µǥąя ǥ€ɲɨµ$ ıllıllı+ replied to +! ! ! Mano ! ! !+'s discussion Hmari police buri ni h
1 hour ago
+ıllıllı $µǥąя ǥ€ɲɨµ$ ıllıllı+ liked +! ! ! Mano ! ! !+'s discussion Hmari police buri ni h
1 hour ago
+ıllıllı $µǥąя ǥ€ɲɨµ$ ıllıllı+ replied to Legend's discussion Coronavirus
1 hour ago
+Аүмаи+ replied to + ! ! ❥ρsүcнσ༄ ! ! +'s discussion !!!Thanks to all for wishing me and also making my birthday so special!!!
1 hour ago

© 2020   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service

.