COURSE OBJECTIVES
- To understand and analyze fundamental data structures, such as binary search trees, disjoint sets, and selfadjusting lists.
- Understand the implementation and complexity analysis of fundamental algorithms such as RSA, primarily testing, max flow, discrete Fourier transform.
- Will be exposed to algorithmic issues in a variety of areas, including linear programming and game-theory.
- Teacher: Mathivanan G
- Teacher: Aishwarya R
- Teacher: RAJASHREE S