Time left:

[All Quizzes] → [Introduction to Algorithms] → [Random - All Topics]


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

A.
B.

2. ► Harmonic series results in polynomial bounds

A.
B.

3. ► Implementation of Dijkstra’s algorithm can make use of heap

A.
B.

4. ► Binary is not a divide and conquer algorithm

A.
B.

5. ► Rabin-Karp algorithm reuses previously calculated hash values

A.
B.

6. ► Binary search performs in linear time

A.
B.

7. ► log(x) terms quite frequently appear during analysis

A.
B.

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

A.
B.

9. ► Brute force string matching relies on char by char comparison

A.
B.

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

A.
B.

11. ► Approximation algorithms provide bounds on the quality of the solution mathematically

A.
B.

12. ► Quick sort can be done in-place

A.
B.

13. ► Data structure needing large contiguous memory might fail to work even if that much memory is available

A.
B.

14. ► Average case complexity of Rabin-Karp is O(nm)

A.
B.

15. ► Dynamic programming also follows divide and conquer approach

A.
B.


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