January 2026
| M | T | Wednesday | R | Friday |
|---|---|---|---|---|
|
12
|
13
|
14
 Syllabus Algorithm Analysis: Introduction (6:41) Algorithm Analysis: Growth Rates (16:46) Algorithm Analysis: Case Study (9:26) Insertion Sort (6:46) Algorithm Analysis: Introduction Slides Algorithms: Design and Correctness Slides Analyzing Algorithms Slides Algorithm Efficiency Slides Chapters 1, 2, 3 (if needed)Introduction, Syllabus and Algorithm Analysis Algorithm Analysis (exercises) Recursion (GCD.java, BinarySearch.java) Class Notes |
15
|
Deadline for full refund
16
 Syllabus Quiz (in CougarVIEW, 3 attempts allowed) Computational Complexity and Recursion Quiz (in CougarVIEW) Divide and Conquer (2:37) Divide and Conquer: Closest Points (4:43) Recursion and Recurrence Slides Sections 4.0 Divide-and-Conquer introduction - 4.5 The master method for solving recurrences (if needed) Priority Queues (2:42) Heaps (10:52) Heaps: BuildHeap (6:42) Heaps: Efficiency (6:57) Chapter 6 (if needed)Divide and Conquer (exercises) Heaps (exercises) |
|
Martin Luther King Jr. Day
19
|
20
|
21
Sorting Introduction (3:12) Heapsort (6:12) Heapsort Slides Mergesort (16:17) Quicksort (16:52) Quicksort Slides Section 6.4 and Chapter 7 (if needed)Sorting Algorithms (exercises) |
22
|
23
Linear Sorts (11:33) Linear Sorting Slides Radix Slides External Sorting (11:54) Chapters 8, 9 (if needed)Sorting Algorithms (exercises) Tracing Sorting Algorithms (exercises) |
|
26
|
27
|
28
Heaps & Sorting Quiz Chapter 10 - Elementary Data Structures Linked Lists (12:56) (see also PowerPoint animations)Stacks and Queues (exercises) Linked Lists (exercises) Class Notes |
29
|
30
Stacks and Queues Quiz Chapter 11 - Hashing Hashing: Introduction (11:54) Hashing: Handling Collisions (14:53) Hashing (Basics) QuizHashing (exercises)# Due  Project 1 - Big-Oh Exploration
|
February 2026
| M | T | Wednesday | R | Friday |
|---|---|---|---|---|
|
2
|
3
|
4
|
5
|
6
Hashing (Application) Quiz Chapter 12 - Binary Search Trees Trees: Terminology A (12:07) Trees: Terminology B (4:33) Trees: Binary Trees (12:04) Trees: Binary Search Trees A (14:39) Trees: Binary Search Trees B (5:00) Trees: Efficiency (9:12)Binary Search Trees (exercises)# Due Advanced Hashing Project (See Tiny Pointers Paper)
|
|
9
|
10
|
11
Sections 14.0 Dynamic Programming introduction - 14.3 Elements of dynamic programming (31 pages) Dynamic Programming (Basics) QuizDynamic Programming
|
12
|
13
Section 14.4 Longest common subsequence (8 pages) (Optional) Section 14.5 Optimal binary search trees (6 pages)Dynamic Programming
|
|
16
|
17
College Career Fair (Rec Center 11 AM - 2 PM)
|
18
Dynamic Programming (Application) Quiz Sections 15.0 Greedy Algorithms introduction - 15.2 Elements of the greedy strategy Algorithm Design: Greedy Algorithms (4:35) Greedy Algorithms (Basics) QuizGreedy Algorithms (exercises) |
19
|
20
Section 15.3 Huffman codes - 15.4 Offline caching Greedy Algorithms: Huffman Codes (10:34)Greedy Algorithms (exercises) |
|
23
|
24
|
25
Greedy Algorithms (Application) Quiz Sections 20.0 Elementary Graph Algorithms introduction - 20.1 Representations of graphs Elementary Graph Algorithms (Basics) QuizElementary Graph Algorithms (exercises) |
26
|
27
Sections 20.2 Breadth-first search - 20.3 Depth-first search Graph Traversals (16:20)Elementary Graph Algorithms (exercises) |
March 2026
| M | T | Wednesday | R | Friday |
|---|---|---|---|---|
|
2
|
3
|
4
Elementary Graph Algorithms (Application 1) Quiz Section 20.4 Topological sort Graphs: Topological Sorting (3:58) Graphs: Topological Sorting Example (4:25)Elementary Graph Algorithms (exercises) |
5
|
6
|
|
9
|
10
|
11
Elementary Graph Algorithms (Application 2) Quiz Chapter 21 - Minimum Spanning Trees (19 pages) Graphs: Spanning Trees (11:25) Spanning Trees (Basics)Spanning Trees (exercises) Minimum Spanning Trees (exercises) |
12
|
13
 Midterm Exam - Proctored (starts) (topics) Spanning Trees (Application) QuizMidterm Preparation Game (on Teams) (LINK: topics) |
|
Spring Break
16
Midterm Exam - Proctored (ends) (topics)
|
Spring Break
17
|
Spring Break
18
|
Spring Break
19
|
Spring Break
20
|
|
23
Registration Opens for Graduate Students
|
24
|
25
|
26
|
27
Sections 22.0 Single-Source Shortest Paths Introduction - 22.2 Single-source shortest paths in directed acyclic graphs (17 pages) Single-Source Shortest Paths Background (10:02) Graphs: Shortest Paths (9:01) Single-Source Shortest Paths (Basics) QuizSingle-Source Shortest Paths (exercises) |
|
30
|
31
|
April 2026
| M | T | Wednesday | R | Friday |
|---|---|---|---|---|
|
1
Section 22.3 Dijkstra's algorithm - 22.4 Difference constraints and shortest paths Single-Source Shortest Paths (exercises |
2
|
3
Single-Source Shortest Paths (Application) Quiz Sections 26.0 Parallel Algorithms introduction - 26.1 The basics of fork-join parallelism (23 pages) Parallel Algorithms (Basics) Quiz Parallel Algorithms (slides)# Due  Single-Source Shortest Paths Assignment
|
||
|
6
|
7
|
8
Section 26.2 Parallel matrix multiplication - 26.3 Parallel merge sort (13 pages)Parallel Algorithms (slides)# Due Project 3 - Shortest Paths
|
9
|
10
Parallel Algorithms (Applications) Quiz Sections 29.0 Linear Programming introduction - 29.2 Formulating problems as linear programs (17 pages)Linear Programming (slides) |
|
13
|
14
|
15
|
16
|
17
Linear Programming - Application Quiz Sections NP-Completeness introduction - 34.3 NP-completeness and reducibility (31 pages)NP-Completeness (slides) |
|
20
|
21
|
22
Sections 34.4 NP-completeness proofs - 34.5 NP-complete problems (27 pages)NP-Completeness (slides) # Due Optional Project 5 - Autograder Feedback
|
23
|
24
Sections 35.0 Approximation Algorithms introduction - 35.3 The set-covering problem (17 pages)Approximation Algorithms (slides) |
|
27
|
28
|
29
Sections 35.4 Randomization and linear programming - 35.5 The subset-sum program (12 pages)Approximation Algorithms (slides)# Due Optional Project 4 - Linear Program Converter (see also Section 29.1 and 29.3 of the 3rd Edition of the textbook, available in the CougarVIEW Assignment)
|
30
|
|
May 2026
| M | T | Wednesday | R | Friday |
|---|---|---|---|---|
|
1
|
||||
|
4
Course Evaluation Survey Closes
|
Study Day
5
|
6
|
7
|
8
Final Exam - Proctored (start) (topics)
|
|
11
Final Exam - Proctored (ends) (topics)
|
12
|
13
|
14
|
15
|
Legend
Read
Read Chapter / Section(s) in Introduction to Algorithms, 4th Edition Watch video Assignment (submit through CougarVIEW) Project (submit through CougarVIEW) CougarVIEW Quiz Exam / Test