Course Outline

Following is a tentative outline of the topics that we will cover during the semester. The detailed schedule should be referred to in the class activity page which will be updated regularly.

• 1. Introduction to C++ (5 lectures) More C++ will be interspersed throughout the course and will be covered in lectures, discussion sessions, reading and assignments.

  2. Performance Analysis, simple sort methods (2 lectures)

  3. Asymptotic Notation (1L)

  4. Lists (5 lectures) Expect more C++ to be covered here.

  5. Arrays and Matrices (1 L)

  6. Stacks and Queues (3L)

  7. Hashing (3L)

  8. Binary trees (4L)

  9. Priority Queues (2L)

  10. Search Trees (2L)

  11. Graphs (3L)

  12. Greedy Algorithms (3L)

  13. Divide and Conquer (3L)

  14. Dynamic Programming (7L)