Time left:

[All Quizzes] → [Introduction to Algorithms] → [Sorting and Searching]


1. ► Binary search performs in linear time

A.
B.

2. ► Stable sorting always preserves the order

A.
B.

3. ► Merge sort can be parallelized

A.
B.

4. ► Heap sort cannot be done in-place

A.
B.

5. ► A simple depth-first walk is enough to give topological ordering

A.
B.

6. ► Binary search on AVL trees can be done at most in O(lgn) steps

A.
B.

7. ► Merge sort has linear space requirement

A.
B.

8. ► Merge sort is not a stable sort

A.
B.

9. ► STL doesn’t have an implementation of quick sort

A.
B.

10. ► Quick sort works on the principle of divide and conquer

A.
B.

11. ► Quick sort is one of the most extensively used sorting algorithm

A.
B.

12. ► Merge sort’s O(nlgn) performance is not guaranteed

A.
B.

13. ► Topological ordering in a graph is unique

A.
B.

14. ► Searching is more expensive in sorted sequence

A.
B.

15. ► Topological sort requires O(V) space

A.
B.

16. ► Quick sort guarantees O(nlgn) performance in all the cases

A.
B.

17. ► Merge sort works on the principle of divide-and-conquer

A.
B.

18. ► A ready list can be obtained through topological sort prior to scheduling

A.
B.

19. ► Quick sort can be done in-place

A.
B.

20. ► Topological sort is available in STL

A.
B.


© 2016 VirtuQ™ Education All right reserved. | Terms of Use | Privacy Policy