We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>
+ Link For Assignments, GDBs & Online Quizzes Solution
+ 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.
.+ 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)
here is doc file......
jasmine's Quiz solved:
The time assumed for each basic operation to execute on RAM model of computation is-----
If the indices passed to merge sort algorithm are not equal, the algorithm may return immediately.
Brute-force algorithm uses no intelligence in pruning out decisions.
In analysis, the Upper Bound means the function grows asymptotically no faster than its largest term.
For small values of n, any algorithm is fast enough. Running time does become an issue when n gets large.
The array to be sorted is not passed as argument to the merge sort algorithm.
In simple brute-force algorithm, we give no thought to efficiency.
Heaps can be stored in arrays without using any pointers; this is due to the ___ nature of the binary tree,
One of the clever aspects of heaps is that they can be stored in arrays without using any______
How much time merge sort takes for an array of numbers?
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
Nabeel bhai its ok ...
Solved MCQS File
CS502 Solved MCQS.pdf, gud keep it up & thanks