COP 4531 - Algorithms - Fall 2017 - List of Lecture Topics
|08/30||Analysis: Big-Oh notions and examples. |
|09/01||Analysis (continued). ||Chapter 5.1 of textbook|
|Week 2||09/04||No class (Labor Day)|
|09/08||No class (School closure)|
|Week 3||09/11||No class (School closure)|
|09/13||No class (School closure)|
|09/15||No class (School closure)|
|Week 4||09/18||Recursion tree method and exercises|
Homework 1 is out.
|09/20||Divide-and-Conquer: Counting inversions. Starting Closest Points.||Chapter 5.3 of textbook|
|09/22||Divide-and-Conquer: Closest Points.||Chapter 5.4 of textbook|
|Week 5||09/25||Master Theorem.|
Deadline of homework 1.
|09/27||Master Theorem continued. Greedy algorithms: Coin Changing.|
Homework 2 is out.
|Chapter 4.1 of textbook|
|09/29||Greedy algorithms: Interval scheduling and partitioning.|
|Week 6||10/02||Dynamic programming: Fibonacci, Weighted Interval Scheduling||Chapter 6.1, 6.2 of textbook|
|10/04||Dynamic programming: Rod cutting, Coin Changing|
|10/06||Deadline of homework 2.|
Dynamic programming: Optimal Substructure, Knapsack.
|Week 7||10/09||Graphs: definitions, connectivity and traversal. Quiz 1. |
Homework 3 is out.
|Chapter 3.1, 3.2, 3.3 of textbook|
|10/11||Graphs: connectivity, bipartiteness, DAG||Chapter 3.4, 3.5, 3.6 of textbook|
|10/13||Graphs: topological ordering|
|Week 8||10/16||Deadline of homework 3.|
Quiz 2. Graphs: DFS and topological ordering.
Homework 4 is out.
|Chapter 4.4 of textbook|
|10/18||Shortest-path: Dijkstra's algorithm|
|10/20||Dijkstra's algorithm continued. Some analytic methods.|
|Week 9||10/23||Deadline of homework 4.|
Dijkstra's algorithm demos (naive and improved). Analytic methods.
|10/25||Dijkstra's algorithm implementation. |
Homework 5 is out.
|10/27||Minimum Spanning Tree: Basic||Chapter 4.5 of textbook|
|Week 10||10/30||Midter review|
|11/03||Minimum Spanning Tree: Red-Blue pattern. |
Deadline of homework 5.
|Week 11||11/06||Homework 6 is out. Minimum Spanning Tree: Prim's algorithm.|
|11/08||Minimum Spanning Tree: Kruskal's algorithm.|
|11/10||No class (Veteran Day)|
|Week 12||11/13||Deadline of homework 6.|
Homework 7 is out.
|Chapter 4.7 of textbook|
|11/15||Clustering (continued). Bellman-Ford.||Chapter 6.8 of textbook|
|11/17||Homework 8 is out.|
|Week 13||11/20||Deadline of homework 7.|
|11/22||No class (Thanksgiving)|
|11/24||No class (Thansgiving)|
|Week 14||11/27||Bellman-Ford (continued). Distance Vector Protocol.||Chapter 6.9 of textbook|
|11/29||Deadline of homework 8.|
Homework 9 is out.
Bellman-Ford (continued). Detection of negative cycles.
|Chapter 6.10 of textbook|
|12/01||Detection of negative cycles.|
|Week 15||12/04||Application of negative cycles: Arbitrage. Some review exercises.|
|12/06||Deadline of homework 9.|
|12/08||Review for final exam|
|Week 16||12/11||Final exam (10am - 12pm, HCB 315)|