1. ► Dynamic programming makes use of previously calculated solution

2. ► Binary search on AVL trees can be done at most in O(lgn) steps

3. ► Heuristics are based on proper mathematical proofs

4. ► Recurrences typically appear as the result of divide and conquer algorithms

5. ► Heap sort makes use of heap data structure

6. ► Binary search is there in algorithm package

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

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

9. ► A ready list can be obtained through topological sort prior to scheduling

10. ► Binary is not a divide and conquer algorithm

11. ► Greedy algorithm works in bottom up manner

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

13. ► Counting method is an effective technique for data structure analysis

14. ► Heap sort cannot be done in-place

15. ► Quick sort is one of the most extensively used sorting algorithm