21-Aug | Thu |
Introduction, Logistics,
Brief tutorial of Piazza, Socrative and Anki
|
N/A |
26-Aug | Tue |
Rate of growth of functions,
Introduction to complexity analysis,
Recurrence basics,
Elementary sorting algorithms |
[PDF] |
28-Aug | Thu |
Divide and Conquer Paradigm - Merge sort and Quicksort |
[PDF] |
2-Sep | Tue |
No class due to Instructor's Conference travel |
|
4-Sep | Thu |
No class due to Instructor's Conference travel |
|
9-Sep | Tue |
Lower bounds for Sorting, Linear time sorting algorithms |
[PDF] |
11-Sep | Thu |
Order statistics - min, max, median, mode and k-th smallest/largest |
[PDF] |
12-Sep | Fri |
Makeup Class: Binary search, Introduction to Data Structures |
[PDF] |
16-Sep | Tue |
Quiz 1, Discussion of Quiz 1 |
|
18-Sep | Thu |
Binary Search Trees, Red-Black Trees |
[PDF] |
23-Sep | Tue |
Heap, HeapSort, Union-Find |
[PDF] |
25-Sep | Thu |
Hash tables, Peek into DHTs and Bloom Filters |
[PDF] |
30-Sep | Tue |
Data Structures: Selection and Augmentation |
[PDF] |
2-Oct | Thu |
Graphs - representation and modelling, Sparse graphs, Quiz 2 |
|
7-Oct | Tue |
Graph traversal and applications |
|
9-Oct | Thu |
Topological sorting |
|
10-Oct | Fri |
Makeup Class (2 hours): Catchup |
|
14-Oct | Tue |
Intro to Greedy Algorithms, MST: Kruskal, Prim |
|
16-Oct | Thu |
Shortest Path: Dijkstra, Mid-Term Review |
|
21-Oct | Tue |
Mid-Term |
|
23-Oct | Thu |
Basics of Bellman-Ford, Floyd-Warshall |
|
28-Oct | Tue |
Network flow: Ford-Fulkerson, Edmonds-Karp |
|
30-Oct | Thu |
Bipartite Matching, Stable Marriage |
|
4-Nov | Tue |
NP-Completeness, Popular NP-Complete problems, Quiz 3 |
|
6-Nov | Thu |
Reductions, Techniques to tackle NP-Completeness |
|
11-Nov | Tue |
Divide and Conquer - I |
|
13-Nov | Thu |
Dynamic Programming - I |
|
18-Nov | Tue |
Dynamic Programming - II |
|
20-Nov | Thu |
Greedy Algorithms - I, Quiz 4 |
|
25-Nov | Tue |
Greedy Algorithms - II |
27-Nov | Thu |
Thanksgiving holidays |
|
2-Dec | Tue |
5311 and beyond, Final Exam Review |
|
9-Dec | Tue |
Final Exam, 2-4:30 PM |
|