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: 1946

.

+ 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

here is doc file......

Attachments:

 jasmine's Quiz solved:

The time assumed for each basic operation to execute on RAM model of computation is-----

Infinite

Continuous

Constant          (p10)

Variable

 

If the indices passed to merge sort algorithm are not equal, the algorithm may return immediately.

True

False    (p28)

 

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

True     (p18)

False

 

In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.

True     (p24)

False

 

For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.

True     (p14)

Fast

 

The array to be sorted is not passed as argument to the merge sort algorithm.

True

False    (p28)

 

In simple brute-force algorithm, we give no thought to efficiency.

True     (p11)

False

Heaps can be stored in arrays without using any pointers; this is due to the ___ nature of the binary tree,
Left-complete   (p40)        

right-complete               

tree nodes

tree leaves  

One of the clever aspects of heaps is that they can be stored in arrays without using any______
Pointers (p40)

constants      

variables        

functions

How much time merge sort takes for an array of numbers?

T(n^2)          

T(n)       

T( log n)            

T(n log n)      (p40)

 

 Awais (MCS bhai gud..........

Thanks jasmine, saray tou nae but 4, 5 quizzes es main sy thay, kafi helping sabit hoyi aap k

quizzes.

 

Attachments:

thanks

 Nabeel bhai its ok ...

Thx jasmin 

Solved MCQS File

Attachments:

Thx awais 

CS502 Solved MCQS.pdf, gud keep it up & thanks 

thanks 

RSS

Latest Activity

+ ! ! ! ❣ maho ❣ ! + liked +++A++R+++'s discussion اے بنت حوا
15 minutes ago
+ ! ! ! ❣ maho ❣ ! + liked +++A++R+++'s discussion اے بنت حوا
15 minutes ago
Maan updated their profile
15 minutes ago
+ Տehɑr Ƙհɑղ + replied to +++A++R+++'s discussion اے بنت حوا
15 minutes ago
+ ! ! ! ❣ maho ❣ ! + liked Rumz zahra's discussion بزم_ادب
15 minutes ago
+ ! ! ! ❣ maho ❣ ! + liked +ıllıllı $µǥąя ǥ€ɲɨµ$ ıllıllı+'s discussion Aye Allah
15 minutes ago
+ Տehɑr Ƙհɑղ + replied to +++A++R+++'s discussion اے بنت حوا
15 minutes ago
+ ! ! ! ❣ maho ❣ ! + liked Kinza Mubasher's discussion Khoobsoort aur bakamaal aurt
15 minutes ago
+ Տehɑr Ƙհɑղ + replied to +++A++R+++'s discussion اے بنت حوا
16 minutes ago
BS MATH replied to Kinza Mubasher's discussion Khoobsoort aur bakamaal aurt
20 minutes ago
+++A++R+++ posted discussions
38 minutes ago
Profile Iconkhan! and Shahid Ali joined Virtual University of Pakistan
41 minutes ago

Today Top Members 

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

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

.