CS3510 Algorithms

Fall 2026

11:00AM-12:15PM TR Howey L3

12:30PM-1:45PM TR Howey L1

People

Lecturer: Abrahim Ladha
TAs:
- Jennifer Jiang (Head TA)
- Michael Zuo
- Yiran Luo
- Kasey Lowe
- Xiangrui Kong
- Yuanda Liu
- Yolanda Li
- Riya Bhadani
- Shourik Banerjee
For office hour times, see the schedule on canvas. They are subject to change.
Office hours are located in CCB 333, the third floor of the CoC building, across the Klaus bridge, 8AM-5PM
My Office is in CCB 207B, third floor. I have an open door policy. If my door is open, I am available to ask questions.

Course Information

Welcome to introductory algorithms. We have four main units, and a fifth unit of breadth.

Divide and Conquer
Graph Algorithms
Dynamic Programming
NP-completeness

There is no formal book for this class, but there are excellent books. These include the CLRS book, the Klienberg Tardos book, the DPV book, and Algorithms by Erickson. I will mostly post reading from DPV and from CLRS. It is expected you read these sections along with the posted notes. The Erickson book is also a really great resource.

While the first four units are general algorithms knowledge, the fifth unit involves many other specializations in algorithms.

Evaluation

todo - Five exams each worth 19% - The fifth exam is not cumulative, and only consists of material after the fourth exam. No exam is dropped. - Problem sets, worth 5% - Random pop quizzes, 2% bonus total

This is subject to change as I realize what takes more or less time.

Class	Subject
08/25/26	DivConquer
08/27/26	Mergesort, Master Theorem
09/01/26	Arithmetic
09/03/26	Quicksort
09/08/26	Exam 1
09/10/26	DFS, Topsort, SCCs
09/15/26	BFS, Dijkstra’s
09/17/26	Kruskals
09/22/26	Floyd-Warshall, Bellman-Ford
09/24/26	Kirchoff’s Matrix Tree Theorem
09/29/26	Exam 2
10/01/26	Dynamic Programming
10/08/26	Longest Sequences
10/13/26	Chain Matrix Multiplication
10/15/26	Knapsack
10/20/26	Tree DP
10/22/26	Exam 3
10/27/26	NP-completeness
10/29/26	Hard Graph Problems
11/03/26	Hard Constraint Problems
11/05/26	Coloring
11/10/26	Exam 4
11/12/26	Zero Knowledge Proofs
11/17/26	Max Flow Min Cut Theorem
11/19/26	Linear Programming
11/24/26	Duality
12/01/26	Randomized Algorithms
12/03/26	Approximation Algorithms
12/08/26	TBD
12/15/26	Final exam section A 11:20-12:50
12/17/26	Final exam section C 11:20-12:50

Lecture Notes and Recordings

https://faculty.cc.gatech.edu/~ladha/algo/

Statement of Intent for Classroom Inclusivity

As a member of the Georgia Tech community, I am committed to creating a learning environment in which all of my students feel safe and included. Because we are individuals with varying needs, I am reliant on your feedback to achieve this goal. To that end, I invite you to enter into dialogue with me about the things I can stop, start, and continue doing to make my classroom an environment in which every student feels valued and can engage actively in our learning community.

Integrity policy

Submission of any work not your own can result in anything from a zero on the assignment to a report to OSI.