1. ► Greedy choice can never give optimal result

2. ► Dijkstra’s algorithm makes greedy choice

3. ► Greedy algorithms always select local best possible solution

4. ► Heuristics are based on proper mathematical proofs

5. ► Greedy algorithm doesn’t guarantee global optimal

6. ► Only mobility based heuristic can be applied in list scheduling

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

8. ► Dynamic programming makes use of previously calculated solution

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

10. ► Dynamic programming works in the top down manner

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

12. ► Heuristic solutions can provide reasonable solutions quite fast

13. ► String matching is quite common in scripting languages

14. ► Greedy algorithm works in bottom up manner

15. ► Dynamic programming also follows divide and conquer approach