Analysis and Design of Algorithms

Course Information

What this course is about

This course will provide an introduction to the fascinating field of algorithms. Participants will learn various techniques for designing algorithms and formally reasoning about their correctness and resource requirements.

Who is this course aimed at

The course is designed for third-year undergraduate students. This offering of COL351 is for CS students; non-CS students should sign up for the Spring semester offering.

Prerequisites

This is a theoretical course that will require familiarity with Data Structures (COL106) and Discrete Mathematical Structures (COL202).

References

• [DPV] Sanjoy Dasgupta, Christos Papadimitriou, and Umesh Vazirani. Algorithms. First Edition.
• [GM] Bernd Gärtner and Jiří Matoušek. Understanding and Using Linear Programming. First Edition
• [KT] Jon Kleinberg and Éva Tardos. Algorithm Design. First Edition
• [R] Tim Roughgarden. Algorithms Illuminated, Parts 1-4.
• A Second Course in Algorithms at Stanford

Other resources

• Dance your way to sorting with AlgoRhythmics
• Visualizing algorithms with VisuAlgo
• Nice explanations of CS Theory concepts

Admin

Lecture and tutorial timings

Lectures: TWF 10-11 AM. Venue: LH 410.

Tutorials: M/T/Th/F 1-2 PM. Venue: LH 313.5. (Tutorial Groups).

Sign up on the Microsoft Teams channel of the course for announcements.

Office hours

With TAs: Tuesday 6-7 PM. Venue: Bharti 408.

With Instructor: Via Email. Venue: Bharti 428.

Evaluation policy

Tutorial quizzes: 30% (best ten x 3%)
In-class quizzes: 45% (best three x 15%)
Assignments: 25% (best one x 25%)

• There are no minor or major exams in this course; therefore, there will be no opportunity for a repeat minor or repeat major exam, except possibly for an E-grade remajor in January 2027. Additionally, there will be no make-up tutorial quiz, in-class quiz, or assignment.


• All evaluations will take place under invigilation.


• The use of any electronic devices during lectures, tutorials, or course evaluations is prohibited.


• The submissions from tutorial quizzes will count towards the attendance.


• Audits are not allowed.