Latest Activity In Study Groups

Join Your Study Groups

VU Past Papers, MCQs and More

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

Counting sort has time complexity:
Select correct option:
O(n)
O(n+k)
O(k)
O(nlogn)

Which sorting algorithn is faster :
Select correct option:
O(n^2)
O(nlogn)
O(n+k)
O(n^3)

In in-place sorting algorithm is one that uses arrays for storage :
Select correct option:
An additional array
No additioanal array
Both of above may be true according to algorithm
More than 3 arrays of one dimension.

Which may be stable sort:
Select correct option:
Bubble sort
Insertion sort
Both of above

The running time of quick sort depends heavily on the selection of
Select correct option:
No of inputs
Arrangement of elements in array
Size o elements
Pivot elements

Quick sort is
Select correct option:
Stable and In place
Not stable but in place
Stable and not in place
Some time in place and send some time stable

In Quick sort algorithm,constants hidden in T(n lg n) are

Large          Medium       Not known        small

Sorting is one of the few problems where provable ________ bonds exits on how fast we can sort,

upper        lower     average       log n

what is memorization 

(? )     

i forget the answer of it sorry .

(? )

(? )

(? )

 

A (an) _________ is a left-complete binary tree that conforms to the heap order 
Select correct option: 

heap

binary tree
binary search tree
array

just remember me in ur prayers..... 

 Thanks . 

Regards... 

                      Umair sid 

Views: 2167

Replies to This Discussion

CS502  Quiz No.2 DEC 03, 2012

Attachments:

CS502_Solved_Online_Quiz#02

Attachments:

CS502 Two more online quiz files 

checked it 

Attachments:

RSS

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

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