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

2. ► Heuristics are based on proper mathematical proofs

3. ► Dynamic programming works in the top down manner

4. ► Dijkstra’s algorithm makes greedy choice

5. ► Heuristic solutions can provide reasonable solutions quite fast

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

7. ► Greedy choice can never give optimal result

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

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

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

11. ► Greedy algorithm works in bottom up manner

12. ► Greedy algorithms always select local best possible solution

13. ► Dynamic programming also follows divide and conquer approach

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

15. ► Greedy algorithm doesn’t guarantee global optimal