7.1) General concepts : Abstract data Type, Time and space analysis of algorithms,
Big oh and theta notations, Average, best and worst case analysis 

7.2) Linear data structures 

7.3) Trees: General and binary trees, Representations and traversals, Binary search
trees, balancing trees, AVL trees, 2-3 trees, red-black trees, self-adjusting
trees, Splay Trees7.4) Algorithm design techniques: Greedy methods, Priority queue search,
7.5) Exhaustive search, Divide and conquer, Dynamic programming, Recursion
7.6) Hashing
7.7) Graphs and digraphs
7.8) Sorting