CS3510 Algorithms

CS3510 Algorithms Fall 2025 5-6:15PM TR Howey L1

People

Lecturer: Abrahim Ladha
TAs:
- Michael Zuo (Head TA)
- Ryan Ma
- Ansh Bhatti
- Frank (Yongyu) Qiang
- Juntae Park
- Yiran Luo
- Taiki Aiba
- Shourik Banerjee
- Xiangrui Kong
- Dhruv Sharma
For office hour times, see the schedule on canvas. They are subject to change.
Office hours are located in CCB 331, the third floor of the CoC building, across the Klaus bridge.
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 sections.

Divide and Conquer
Graph Algorithms
Dynamic Programming
NP-completeness

We will follow the book Algorithms by Dasgupta, Papadimitriou, and Vazirani but there are other excellent books. These include the CLRS book, the Klienberg Tardos 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.

The fifth “unit” is a sampler of many other subfields in algorithms.

Evaluation

Five exams, including the final, each worth 20%
Your lowest exam score is dropped effectively making the final optional
Problem sets, worth 20%

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

Lecture Number	Date	Topic	Video	Other
1	Aug 19	Introduction and Divconquer	L01A
2	Aug 21	Master Theorem and Mergesort	L01B
3	Aug 26	Arithmetic	L02A
4	Aug 28	Quicksort	L03A,B
5	Sep 02	Review		traveling
6	Sep 04	Exam 1		traveling
7	Sep 09	DFS, Topsort, SCCs	L04A,B
8	Sep 11	BFS, Dijkstra’s	L05A,B
9	Sep 16	Kruskals	L06A,B
10	Sep 18	Bellman-Ford and Floyd Warshall	L08A,B
11	Sep 23	Kirchoff’s Matrix Tree Theorem	L08C
12	Sep 25	Exam 2
13	Sep 30	Dynamic Programming	L09A
14	Oct 02	Longest Sequences	L09B
15	Oct 09	Chain Matrix Multiplication	L10A
16	Oct 14	Knapsack	L10B
17	Oct 16	Tree DP	L10C
18	Oct 21	Exam 3
19	Oct 23	NP-completeness	L11A
20	Oct 28	Satisfiability, Mario	L11B
21	Oct 30	Hard Graph Problems	L12A
22	Nov 04	Hard Constraint Problems	L12B
23	Nov 06	Coloring	L13A,B,C
24	Nov 11	Exam 4
25	Nov 13	Max-Flow Min-Cut Theorem	L14A,B
26	Nov 18	Linear Programming	L15A
27	Nov 20	LP Duality	L15B
28	Nov 25	Randomized Algorithms	L16A
29	Dec 02	Approximation Algorithms	L17A,B
	Dec 04	FINAL EXAM 6PM

Lecture Resources

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.