Fall 2019
Instructor: Dr. Vangelis Metsis
Time and Place of Class Meetings:
Tu 6:30pm - 9:20pm, DERR 114 & AVRY 355
Syllabus: PDF
The lecture slides and materials can be found at the TRACS e-learning platform.
As the instructor for this course, I reserve the right to adjust this schedule in any way that serves the educational needs of the students enrolled in this course. -Vangelis Metsis.| Class | Date | Topic | Textbook Readings | Notes |
|---|---|---|---|---|
| 1 | 08/27 | Introduction, Analysis of Algorithms, Insertion Sort, Merge-sort | Chapters 1-2 | - |
| 2 | 09/03 | Growth of Functions, Asymptotic Analysis | Chapter 3 | - |
| 3 | 09/10 | Divide-and-Conquer, Recurrences | Chapter 4: sections 4.1, 4.3-4.5 | Homework 1 due. |
| 4 | 09/17 | Heapsort, Quicksort | Chapter 6: sections 6.1-6.4; Chapter 7: sections 7.1-7.3 | - |
| 5 | 09/24 | Hash Tables | Chapter 11: sections 11.1-11.4 (excluding 11.3.3) | - |
| 6 | 10/01 | Binary Search Trees | Chapter 12: sections 12.1-12.3 | - |
| 7 | 10/08 | 2-3 Trees, Red-Black Trees, B-Trees | Chapter 13: sections 13.1-13.3, Chapter 18: sections 18.1-18.2 | Homework 2 due. |
| 8 | 10/15 | Review | - | - |
| 9 | 10/22 | MIDTERM EXAM | ||
| 10 | 10/29 | Dynamic Programming I: Fibonacci Numbers, Longest Common Subsequence |
Chapter 15: sections 15.1, 15.3, 15.4 | - |
| 11 | 11/05 | Part1: Dynamic Programming II: Matrix-Chain Multiplication Part2: Greedy Algorithms |
Chapter 15: sections 15.2 Chapter 16: sections 16.1-16-3 | - |
| 12 | 11/12 | Elementary Graph Algorithms, Minimum Spanning Trees | Chapter 22: sections 22.1-22.5, Chapter 23: sections 23.1-23.2 | Homework 3 due. |
| 13 | 11/19 | Single-Source Shortest Paths | Chapter 24: sections 23.1-23.3 | - |
| 14 | 11/26 | Maximum Flow | Chapter 26: sections 26.1, 26.2 | Programming Project due (on 11/29) |
| 15 | 12/03 | NP-Completeness | Chapter 34: sections 34.1, 34.2, 34.3-34-5 | Homework 4 due. |
| -- | 12/10 | FINAL EXAM | ||