1. ► Strongly connected component term is used in the context of directed graphs

2. ► Relaxation step is called O(E) times

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

4. ► Binary search is there in algorithm package

5. ► Master method can solve all kinds of recurrences

6. ► Page ranking system has tree structure

7. ► Connected component algorithm is there in boost library

8. ► Breadth first walk on undirected graph cannot give connected components

9. ► A graph can have multiple connected components

10. ► Analysis of data structure is typically done on per operation basis

11. ► String matching is quite common in scripting languages

12. ► Harmonic series results in polynomial bounds

13. ► Connected component denotes close relationship among nodes

14. ► Implementation of Dijkstra’s algorithm can make use of heap

15. ► Once you start coding, data structure will come automatically