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 |
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) 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) |
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 |
4
|
5
|
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