1. ► Fibonacci series can be calculated efficiently with dynamic programming
2. ► String matching is quite common in scripting languages
3. ► Only mobility based heuristic can be applied in list scheduling
4. ► Dynamic programming makes use of previously calculated solution
5. ► Greedy algorithms always select local best possible solution
6. ► Rabin-Karp algorithm relies on hash function to convert strings to numbers
7. ► Dynamic programming also follows divide and conquer approach
8. ► Average case complexity of Rabin-Karp is O(nm)
9. ► Which of the following problem does not have exponential complexity
10. ► Heuristic solutions can provide reasonable solutions quite fast
11. ► Greedy choice can never give optimal result
12. ► Greedy algorithm doesn’t guarantee global optimal
13. ► Dynamic programming works in the top down manner
14. ► Greedy algorithm works in bottom up manner
15. ► Graph coloring can be used to solve processor register allocation in compilers