CSE2209 (Design and Analysis of Algorithms)
Objectives:
This core course covers good principles of algorithm design, elementary analysis of algorithms, and fundamental data structures. The emphasis is on choosing appropriate data structures and designing correct and efficient algorithms to operate on these data structures. In this course students will:
learn good principles of algorithm design;
learn how to analyse algorithms and estimate their worst-case and average-case behaviour (in easy cases);
become familiar with fundamental data structures and with the manner in which these data structures can best be implemented; become accustomed to the description of algorithms in both functional and procedural styles;
learn how to apply their theoretical knowledge in practice (via the practical component of the course).
Class Lectures
Recommended Books:
1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein : Introduction to Algorithm, The MIT Press
2. D.E. Kunth : The Art of Computer Programming.
CSE2210 (Design and Analysis of Algorithms Lab)
Lab Classes