CS3510 Algorithms

CS3510 Algorithms Summer 2025 12:30-2:40PM MW Klaus 1456

People

Lecturer: Abrahim Ladha
TAs:
- Aditya Patil
- Gryphon Patlin
- James Kermait
- Yiran Luo
- William Eickman
For office hour times, see the schedule on the pinned Edstem post. They are subject to change.
Office hours are located in an open area just outside CCB203, the third floor of the CoC building, across the Klaus bridge.
They will also be held remotely
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.
I will also have remote office hours 12-4 every Tuesday on zoom.

Course Information

Welcome to algorithms! We have four main sections.

Divide and Conquer
Graph Algorithms
Dynamic Programming
NP-completeness

There are also minor units on maxflow, linear programming, greedy algorithms, and randomized and approximation algorithms. It is expected that you read the class notes in parallel with class attendance.

Evaluation

Four exams, including the final, each worth 18%
Weekly worksheets, combined for 8%
Weekly problem sets, worth 20%

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

No.	Date	Lecture
L01A	May 12	Introduction, Big O
L01B	May 12	Master Theorem, MergeSort
L02A	May 14	Arithmetic
L02B	May 14	Fast Fourier Transform
L03A	May 19	QuickSort
L03B	May 19	(lack of) lower bounds
	May 21	Exam 1
	May 26	Memorial Day
L04A	May 28	Graphs and DFS
L04B	May 28	Applications of DFS
L05A	Jun 02	BFS, Dijkstras
L05B	Jun 02	Heaps
L06A	Jun 04	Kruskals, Prims, Union-find
L06B	Jun 04	The Cut Property
L07A	Jun 09	Bellman-Ford, Floyd-Warshall
L07B	Jun 09	Huffman Coding
	Jun 11	Exam 2
L08A	Jun 16	Dynamic Programming
L08B	Jun 16	Longest Sequences
L09A	Jun 18	Chain Matrix Multiplication
L09B	Jun 18	Knapsack
L10A	Jun 23	NP-completeness
L10B	Jun 23	Satisfiability
L11A	Jun 25	Graph problems
L11B	Jun 25	Constraint problems
L12A	Jun 30	Coloring
L12B	Jun 30	Games and Puzzles
	Jul 02	Exam 3
L13A	Jul 07	Max flow Min Cut Theorem
L13B	Jul 07	Applications of Maxflow
L14A	Jul 09	Linear Programming
L14B	Jul 09	Duality Theorem
L15A	Jul 14	Randomized Algorithms
L15B	Jul 14	Randomized Algorithms
L16A	Jul 16	Approximation Algorithms
L16B	Jul 16	Approximation Algorithms
L17A	Jul 21	Open Topic
L17B	Jul 21	Open Topic
	Jul 30	Exam 4

Other Resources

Lecture Notes

Lecture Videos

Erickson’s Free Book

Integrity Statement

Submission of any work not your own will result on a zero on the assignment to a report to OSI, which may incur further sanctions.

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.