1. ► Heuristics are based on proper mathematical proofs

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

3. ► Greedy algorithm doesn’t guarantee global optimal

4. ► Dijkstra’s algorithm makes greedy choice

5. ► Greedy choice can never give optimal result

6. ► Greedy algorithm works in bottom up manner

7. ► Greedy algorithms always select local best possible solution

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

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

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

11. ► Dynamic programming also follows divide and conquer approach

12. ► Heuristic solutions can provide reasonable solutions quite fast

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

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

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