Time left:

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


1. ► Greedy algorithms always select local best possible solution

A.
B.

2. ► Dijkstra’s algorithm makes greedy choice

A.
B.

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

A.
B.

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

A.
B.

5. ► String matching is quite common in scripting languages

A.
B.

6. ► Heuristic solutions can provide reasonable solutions quite fast

A.
B.

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

A.
B.

8. ► Greedy algorithm doesn’t guarantee global optimal

A.
B.

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

A.
B.

10. ► Greedy algorithm works in bottom up manner

A.
B.

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

A.
B.

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

A.
B.

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

A.
B.

14. ► Dynamic programming also follows divide and conquer approach

A.
B.

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

A.
B.


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