Time left:

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


1. ► In unsorted sequence, key and data cannot stay together

A.
B.

2. ► Good data structure make programs more efficient

A.
B.

3. ► Dynamic programming makes use of previously calculated solution

A.
B.

4. ► Graph coloring can be used to solve processor register allocation in compilers

A.
B.

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

A.
B.

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

A.
B.

7. ► Counting method is an effective technique for data structure analysis

A.
B.

8. ► Connected component algorithm is there in boost library

A.
B.

9. ► Topological sort is available in STL

A.
B.

10. ► Smaller order terms cannot be ignored in analysis for small data set

A.
B.

11. ► Searching is more expensive in sorted sequence

A.
B.

12. ► Heap sort guarantees O(nlgn) performance

A.
B.

13. ► Greedy algorithms always select local best possible solution

A.
B.

14. ► Topological ordering in a graph is unique

A.
B.

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

A.
B.


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