The course coverage shall include the following topics, basic introduction to data structures and common algorithms. Algorithm analysis: Asymptotic analysis of upper and average complexity bounds; standard complexity classes time and space trade-offs in algorithms analysis recursive algorithms; Algorithm Strategies: Fundamental computing algorithms: numerical algorithms, sequential and binary search algorithms; sorting algorithms, Binary search trees. Hash tables, graphs & its representation.

The course compact is included for reference 

Click to access other course resources including program codes