1. ► Greedy algorithm doesn’t guarantee global optimal

2. ► Dynamic programming makes use of previously calculated solution

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

4. ► String matching is quite common in scripting languages

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

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

7. ► Greedy algorithm works in bottom up manner

8. ► Greedy algorithms always select local best possible solution

9. ► Dijkstra’s algorithm makes greedy choice

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

11. ► Greedy choice can never give optimal result

12. ► Heuristics are based on proper mathematical proofs

13. ► Dynamic programming also follows divide and conquer approach

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

15. ► Dynamic programming works in the top down manner