Spring 2025 CS231

This is a course about algorithms; their design and analysis

CS231 Syllabus

All course info and logistics can be found in the course syllabus

CS231 Schedule

Please note that this page will be updated frequently, and it will contain all course content and resources
Monday Tuesday Wednesday Thursday Friday
Jan
20
21
22
Introduction and Review
(slides)
Reading: Course syllabus
23
(I) Basics:
Proofs and Analysis
(slides)
24
Complete Quiz 0 on Gradescope before Sunday at 11:59pm
27
Priority queues and heaps
(slides)
Reading: Section 2.5
28
29
Practice and Office hours
30
Analysis and asymptotics
(slides)
Reading: Sections 2.1 and 2.2
31
Feb
3
Stable matching
(slides)
Reading: Section 1.1
4
5
Practice and Office hours
Assignment 1 due at 11:59pm
(pdf file - tex file)
6
GS algorithm Implementation
(slides)
Reading: Section 2.3
7
Complete Quiz 1 on Gradescope before Sunday at 11:59pm
10
(II) Graphs: Definitions and representation
(slides)
Reading: Sections 3.1 and 3.2
11
12
Practice and Office hours
14
BFS and graph coloring
(slides)
Reading: Sections 3.3 and 3.4
15
17
No classes
18
DFS and topological ordering
(slides)
Reading: Sections 3.5 and 3.6
19
Practice and Office hours
Assignment 2 due at 11:59pm (pdf file - tex file - starter code)
20
(III) Greedy algorithms:
Interval Scheduling
(slides)
Reading: Section 4.1
21
Complete Quiz 2 on Gradescope before Sunday at 11:59pm
24
Scheduling (2)
(slides)
Reading: Sections 4.1 and 4.2
25
26
Review session
27
Exam 1 in-class
Focuses on material till end of graphs
28
Mar
3
Exchange argument
Reading: Section 4.2
4
5
Practice and office hours
Assignment 3 due at 11:59pm
6
Shortest path routing
(slides)
Reading: Section 4.4
7
Complete Quiz 3 on Gradescope before Sunday at 11:59pm
10
Minimum spanning trees
(slides)
Reading: Section 4.5
11
12
Practice and office hours
13
(IV) Divide and Conquer:
Merge sort
Reading: Sections 5.1 and 5.2
14
17
Spring break
18
Spring break
19
Spring break
20
Spring break
21
Spring break
24
Counting Inversions
Reading: Section 5.3
25
26
Practice and office hours
Assignment 4 due at 11:59pm
27
Solving Recurrences
Reading: Sections 5.1 and 5.2
28
Complete Quiz 4 on Gradescope before Sunday at 11:59pm
31
(V) Dynamic programming:
Weighted interval scheduling
Reading: Sections 6.1 and 6.2
Apr
1
2
Review session
3
Exam 2 in-class
Focuses on material till end of greedy
4
7
Weighted interval scheduling
(same slides as last week)
Reading: Sections 6.1 and 6.2
8
9
Practice and office hours
Assignment 5 due at 11:59pm
10
Knapsack
Reading: Section 6.4
11
Complete Quiz 5 on Gradescope before Sunday at 11:59pm
14
Shortest path revisited
Reading: Section 6.8
15
16
Practice and office hours
17
(VI) Max Flow:
Max Flow problem
Reading: Section 7.1
18
21
No class
22
23
Practice and office hours
24
Applications of Max Flow
Reading: Section 7.2
25
Assignment 6 due at 11:59pm
Complete Quiz 6 on Gradescope before Sunday at 11:59pm
28
Tractability of algorithms
[Optional] Reading: Chapter 8
29
30
Review session
May
1
Exam 3 in-class
Covers remaining material
2
Reading period starts