This course deals with the study of algorithms for solving practical problems as well as the data structures used in their implementation. A large variety of algorithms are candidates for study including greedy algorithms, dynamic programming, divide and conquer, exhaustive search, graph algorithms, heaps, network flow algorithms, string matching and so on. Analysis of the resource requirements of algorithms will be an important issue of study.

On completion of this course the student will:

• have a thorough understanding of a variety of algorithms with real-life applications and the resource requirements.
• be able to apply the algroithmic techniques including dynamic programming, greedy policy, and divide-and-conquer, to solve some practical problems.
• be able to analyze time and space complexities of algorithms.
• have some experience in the design and implemenation of algorithms for practical problems, using languages like C, C++.

Assignments (40%); Final Exam (60%)

Thirty one-hour lectures and four two-hour tutorial/laboratory sessions.

The following text book will be used for this course:

• Cormen, T., Leiserson, C.E. Rivest. R.L. & Stein, C. Introduction to Algorithms, MIT Press, 2nd Edition, 2002.

The following reference books are recommended for this course:

• Baase, S. & Van Gelder, Allen Computer Algorithms – Introduction to Design and Analysis by Addison-Wesley, 3rd Edition, 2000.
• Sedgewick, Robert Algorithms in C, 3rd Edition, 2002.
• Aho, Alfred V., Hopcroft, John E., & Ullman, Jeffrey D. The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
• Kleinberg, John & Tardos, Eva Algorithms Design, Addison-Wesley, 2005.