Time left:

[All Quizzes] → [Introduction to Algorithms] → [Special Topics]


1. ► Greedy algorithm doesn’t guarantee global optimal

A.
B.

2. ► Dynamic programming makes use of previously calculated solution

A.
B.

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

A.
B.

4. ► String matching is quite common in scripting languages

A.
B.

5. ► Rabin-Karp algorithm relies on hash function to convert strings to numbers

A.
B.

6. ► Fibonacci series can be calculated efficiently with dynamic programming

A.
B.

7. ► Greedy algorithm works in bottom up manner

A.
B.

8. ► Greedy algorithms always select local best possible solution

A.
B.

9. ► Dijkstra’s algorithm makes greedy choice

A.
B.

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

A.
B.

11. ► Greedy choice can never give optimal result

A.
B.

12. ► Heuristics are based on proper mathematical proofs

A.
B.

13. ► Dynamic programming also follows divide and conquer approach

A.
B.

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

A.
B.

15. ► Dynamic programming works in the top down manner

A.
B.


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