August 2025
| Monday | T | Wednesday | R | F |
|---|---|---|---|---|
|
Module 0: Orientation & Overview
11
Before Class:
 Syllabus Preface (10 pages) (Skim / read) (PDF available in CougarVIEW Announcements) Chapter 1: Introduction: Some Representative Problems (18 pages) (PDF available in CougarVIEW Announcements)Class: Introductions Syllabus Stable Matching (Gale–Shapley) (Demo) |
12
|
Module 1: Algorithm Analysis
13
Before Class:
2.1 Computational Tractability (PDF available in CougarVIEW Announcements)Class: Stable Matching (Gale–Shapley) Five Representative Problems Computational Tractability Class notes |
14
|
15
Deadline for full refund
Due:  Get to Know Each Other Discussion (in CougarVIEW, Assessment menu, then Discussions) |
|
18
Before Class:
2.2 Asymptotic Order of Growth 0.6 Analyzing Algorithms (3 pages) (optional) 2.3 Implementing the Stable Matching Algorithm Using Lists and Arrays 2.4 A Survey of Common Running TimesClass: Asymptotic Order of Growth Implementing Gale–Shapley Survey of Common Running Times (Binary Search Demo) |
19
|
20
Internship Workshop 1-1:30 pm, Schuster Student Success Center, Rm. 208 (Virtual Option available) Register here, Flyer
Before Class: 2.5 A More Complex Data Structure: Priority Queues Priority Queues (2:42) Heaps (10:52) Heaps: BuildHeap (6:42) Heaps: Efficiency (6:57)Class: Binary Search Algorithm Analysis Survey of Common Running Times Priority Queues (exercises) Class notes Due: Get to Know Each Other Discussion (in CougarVIEW, Assessment menu, then Discussions)
|
21
|
22
|
|
Module 2: Graphs
25
Before Class:
3.1 Basic Definitions and Applications 3.2 Graph Connectivity and Graph Traversal 3.3 Implementing Graph Traversal Using Queues and StacksClass: Priority Queues (exercises) Basic Definitions and Applications Graph Connectivity and Graph Traversal Graph Traversals (exercises) Class notes |
26
|
27
Turner College Welcome Back Event Noon - 2:00 PM (SCCT 2nd Floor Lobby)
Before Class: 3.4 Testing Bipartiteness: An Application of Breadth-First Search 3.5 Connectivity in Directed GraphsClass: Testing Bipartiteness Connectivity in Directed Graphs |
28
|
29
|
September 2025
| Monday | T | Wednesday | R | F |
|---|---|---|---|---|
|
1
Labor Day (no class)
|
2
|
3
Internship Workshop 1-1:30 pm, Schuster Student Success Center, Rm. 208 (Virtual Option available) Register here
Before Class: 3.6 Directed Acyclic Graphs and Topological OrderingClass: DAGs and Topological Ordering (exercises) Topological Sorting Algorithm: Running Time Class notes Advanced Algorithm Research Project
|
4
|
5
|
|
Module 3: Greedy Algorithms
8
Before Class:
4.1 Interval Scheduling: The Greedy Algorithm Stays Ahead 4.2 Scheduling to Minimize Lateness: An Exchange ArgumentClass: Interval Scheduling (Earliest Finish Time First Demo, Earliest Start Time First Demo) Interval Partitioning (Intuition) Scheduling to Minimize Lateness |
9
|
10
Before Class:
4.3 Optimal Caching: A More Complex Exchange Argument 4.4 Shortest Paths in a GraphClass: Optimal Caching Dijkstra's Algorithm (Demos) |
11
|
12
|
|
15
Before Class:
4.5 The Minimum Spanning Tree Problem 4.6 Implementing Kruskal's Algorithm: The Union-Find Data Structure (optional)Class: Certificates Survey Dijkstra's Algorithm Minimum Spanning Trees (Prim's and Kruskal's Demo) Union-Find Data Structure (Class Notes) |
16
|
17
Before Class:
4.7 Clustering 4.8 Huffman Codes and Data Compression (optional)Class: Clustering Exam 1 Preparation Game (Modules 0 - 3) (on Teams) (topics) |
18
|
19
|
|
Module 4: Divide and Conquer
22
Before Class:
Mergesort (16:17) (if needed for review) 5.1 A First Recurrence: The Mergesort Algorithm A First Recurrence: The Mergesort Algorithm Pre Quiz 5.2 Further Recurrence Relations Quicksort (16:52) (if needed for review)Class: Recurrence of Mergesort (Merge Demo) Master Theorem Randomized Quickselect |
23
Turner College Career Fair 12-2 PM Student Recreation Center (Extra Credit)
|
24
Before Class:
5.3 Counting Inversions Counting Inversions Quiz 5.4 Finding the Closest Pair of Points Closest Pair of Points Pre QuizClass: Counting Inversions Finding the Closest Pair of Points (exercise) Due: Exam 1 Preparation Game Questions Greedy Algorithm Homework (a quiz with unlimited attempts)
|
25
|
26
|
Legend
Read
Read sections in Algorithm Design Read sections in Algorithms (optional) Watch video Assignment (submit through CougarVIEW) 
Project (submit through CougarVIEW) CougarVIEW Quiz
Exam / Test