Time left:

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


1. ► Heuristics are based on proper mathematical proofs

A.
B.

2. ► Searching is more expensive in sorted sequence

A.
B.

3. ► Program and data structures are two separate entities

A.
B.

4. ► Merge sort can be parallelized

A.
B.

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

A.
B.

6. ► Heap sort can be parallelized

A.
B.

7. ► O(1) is linear time complexity

A.
B.

8. ► Which of the following problem does not have exponential complexity

A.
B.

9. ► Stable sorting always preserves the order

A.
B.

10. ► Initial distance on unconnected nodes from the source node is infinite in Dijkstra’s algorithm

A.
B.

11. ► Merge sort is not a stable sort

A.
B.

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

A.
B.

13. ► For overlapping optimal substructure, dynamic programming gives optimal solution

A.
B.

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

A.
B.

15. ► Amortized analysis is applicable when there is certain relationship between cheap and expensive operations

A.
B.


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