1. ► In unsorted sequence, key and data cannot stay together

2. ► Good data structure make programs more efficient

3. ► Dynamic programming makes use of previously calculated solution

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

5. ► log(x) terms quite frequently appear during analysis

6. ► For faster and frequent searches, sorted sequences are better to work on

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

8. ► Connected component algorithm is there in boost library

9. ► Topological sort is available in STL

10. ► Smaller order terms cannot be ignored in analysis for small data set

11. ► Searching is more expensive in sorted sequence

12. ► Heap sort guarantees O(nlgn) performance

13. ► Greedy algorithms always select local best possible solution

14. ► Topological ordering in a graph is unique

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