Time left:

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


1. ► Heap sort can be parallelized

A.
B.

2. ► Stable sorting always preserves the order

A.
B.

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

A.
B.

4. ► For faster and frequent searches, sorted sequences are better to work on

A.
B.

5. ► Sorting algorithm with logarithmic component in complexity works faster

A.
B.

6. ► Merge sort can be parallelized

A.
B.

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

A.
B.

8. ► Topological sort is available in STL

A.
B.

9. ► Binary search is there in algorithm package

A.
B.

10. ► Searching is more expensive in sorted sequence

A.
B.

11. ► Binary is not a divide and conquer algorithm

A.
B.

12. ► Merge sort has linear space requirement

A.
B.

13. ► Binary search performs in linear time

A.
B.

14. ► Heap sort doesn’t have an implementation in STL

A.
B.

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

A.
B.

16. ► Heap sort makes use of heap data structure

A.
B.

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

A.
B.

18. ► Hidden constants are higher in merge sort

A.
B.

19. ► Heap sort cannot be done in-place

A.
B.

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

A.
B.


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