Algorithm Presentation Assignment
Each student is assigned one algorithmic topic from the textbook. Please prepare a short 5-minute presentation on the assigned topic, including a brief explanation of its purpose, how it works, and a simple example if applicable.
Presentations will begin on Week 11-1 (5/13) and continue across several weeks. Three students will present in each session, except for the final session, which will have four students.
| No. | Topic | Chapter | Student ID | Presentation Date |
|---|---|---|---|---|
| 1 | Min-Cost Max-Flow Algorithms: Successive Shortest Path | Chapter 25 | 2024350203 | Week 11-1 (05/13) |
| 2 | Red–Black Trees: Balancing & Rotations | Chapter 13 | 2024350215 | Week 11-1 (05/13) |
| 3 | Amortized Analysis: Accounting & Potential Methods | Chapter 16 | 2022350217 | Week 11-1 (05/13) |
| 4 | Augmenting Data Structures | Chapter 17 | 2024350209 | Week 11-2 (05/15) |
| 5 | B‑Trees: Definitions & Operations | Chapter 18 | 2024350201 | Week 11-2 (05/15) |
| 6 | Disjoint Set Forests & Union by Rank | Chapter 19 | 2024350225 | Week 11-2 (05/15) |
| 7 | Floyd–Warshall Algorithm (All‑Pairs Shortest Paths) | Chapter 23 | 2024350217 | Week 12-1 (05/20) |
| 8 | Johnson’s Algorithm for All‑Pairs Shortest Paths | Chapter 23 | 2022350218 | Week 12-1 (05/20) |
| 9 | Maximum Flow: Ford–Fulkerson Method | Chapter 24 | 2024350222 | Week 12-1 (05/20) |
| 10 | Maximum Flow: Applications in Network Routing | Chapter 24 | 2024350220 | Week 12-2 (05/22) |
| 11 | Bipartite Matching & the Hungarian Algorithm | Chapter 25 | 2024350213 | Week 12-2 (05/22) |
| 12 | Stable Marriage Problem: Algorithm & Analysis | Chapter 25 | 2024350218 | Week 12-2 (05/22) |
| 13 | Parallel Algorithms: The Fork–Join Model | Chapter 26 | 2022350208 | Week 13-1 (05/27) |
| 14 | Parallel Matrix Multiplication | Chapter 26 | 2024350221 | Week 13-1 (05/27) |
| 15 | Online Algorithms: Competitive Analysis | Chapter 27 | 2024350224 | Week 13-1 (05/27) |
| 16 | Online Algorithms: Move‑to‑Front Heuristic | Chapter 27 | 2024350212 | Week 13-2 (05/29) |
| 17 | Solving Linear Systems (Matrix Operations) | Chapter 28 | 2024350214 | Week 13-2 (05/29) |
| 18 | Matrix Inversion & Least‑Squares Approximation | Chapter 28 | 2024350219 | Week 13-2 (05/29) |
| 19 | Linear Programming: Formulations & Duality | Chapter 29 | 2024350226 | Week 14-1 (06/03) |
| 20 | Fast Fourier Transform (FFT): Core Ideas | Chapter 30 | 2024350228 | Week 14-1 (06/03) |
| 21 | FFT: Applications in Signal Processing | Chapter 30 | 2024350206 | Week 14-1 (06/03) |
| 22 | Modular Arithmetic & the Chinese Remainder Theorem | Chapter 31 | 2024350205 | Week 14-2 (06/05) |
| 23 | Primality Testing and RSA | Chapter 31 | 2025350214 | Week 14-2 (06/05) |
| 24 | Naive String Matching Algorithm | Chapter 32 | 2024350216 | Week 14-2 (06/05) |
| 25 | Rabin–Karp Algorithm for String Matching | Chapter 32 | 2024350208 | Week 15-1 (06/10) |
| 26 | Knuth–Morris–Pratt (KMP) Algorithm | Chapter 32 | 2024350227 | Week 15-1 (06/10) |
| 27 | Suffix Arrays & Their Applications | Chapter 32 | 2024350207 | Week 15-1 (06/10) |
| 28 | Clustering Algorithms in Machine Learning | Chapter 33 | 2024350204 | Week 15-2 (06/12) |
| 29 | Multiplicative‑Weights Algorithms | Chapter 33 | 2024350223 | Week 15-2 (06/12) |
| 30 | Gradient Descent: Principles & Analysis | Chapter 33 | 2024350202 | Week 15-2 (06/12) |
| 31 | Approximation Algorithms: Vertex‑Cover Problem | Chapter 35 | 2024350230 | Week 15-2 (06/12) |