Participation
Please register for the course to gain access to the Adam workspace.
Lecture Material
| A1 19.2. | Organizational Matters Slides (Print version) |
| A2 19.2. | Python Intro Slides (Print version) Notebook: JupyterHub (VPN), Github |
| A3 20.2. | Sorting I: Selection and Insertion Sort Slides (Print version) Notebook: JupyterHub (VPN), Github |
| A4 20.2. 26.2. | Sorting II: Merge Sort |
| A5 26.2. | Runtime Analysis: Introduction and Selection Sort Slides (Print 4-on-1, 1-on-1) |
| A6 27.2. | Runtime Analysis: Logarithm Slides (Print 4-on-1, 1-on-1) Notebook: JupyterHub (VPN), Github |
A7 | Runtime Analysis: Bottom-Up Merge Sort Slides (Print 4-on-1, 1-on-1) |
| A8 5.3. | Runtime Analysis: Asymptotic Notation Slides (Print 4-on-1, 1-on-1) Notebook: JupyterHub (VPN), Github |
| A9 5.3. | Runtime Analysis: Application Slides (Print 4-on-1, 1-on-1) |
| A10 6.3 | Runtime Analysis: Divide-and-Conquer Algorithms Slides (Print 4-on-1, 1-on-1) |
| A11 6.3 | Runtime Analysis: Solving Recurrences Slides (Print 4-on-1, 1-on-1) |
| A12 19.3 | Sorting: Quicksort (& Heapsort) Slides (Print 4-on-1, 1-on-1) |
| A13 19.3 | Sorting: Lower Bound Slides (Print 4-on-1, 1-on-1) |
| A14 20.3. | Sorting: Counting Sort & Radix Sort Slides (Print 4-on-1, 1-on-1) Notebooks: counting sort on JupyterHub (VPN), counting sort on Github radix sort on JupyterHub (VPN), radix sort on Github |
| A15 20.3. | Sorting: Overview & Outlook Slides (Print 4-on-1, 1-on-1) |
| B1 26.3. 27.3. | Arrays and Linked Lists Slides (Print 4-on-1, 1-on-1) Notebook: JupyterHub (VPN), Github |
| B2 27.3. | Abstract Data Types: Stacks & Queues Slides (Print 4-on-1, 1-on-1) Notebook: JupyterHub (VPN), Github |
| B3 3.4. | Heaps, Heapsort and ADT Priority Queue Slides (Print 4-on-1, 1-on-1) Notebook: JupyterHub (VPN), Github, Github with solutions |
| B4 9.4. 10.4. | Hash Tables Slides (Print 4-on-1, 1-on-1) |
| B5 10.4. | Binary Search Trees Slides (Print 4-on-1, 1-on-1) Notebook: JupyterHub (VPN), Github |
| B6 16.4. 23.4. | Red-Black Trees Slides (Print 4-on-1, 1-on-1) Notebook: JupyterHub (VPN), Github |
| B7 23.4. | ADTs Map and Set Slides (Print 4-on-1, 1-on-1) |
| C1 24.4. | Graph Exploration Slides (Print 4-on-1, 1-on-1) Notebook: JupyterHub (VPN), Github |
| C2 30.4. | Graph Exploration: Applications Slides (Print 4-on-1, 1-on-1) Notebook: JupyterHub (VPN) (Solved Version), Github |
| C3 7.5. | Disjoint-set Data Structure/Union-Find Slides (Print 4-on-1, 1-on-1) Notebook: JupyterHub (VPN), Github |
| C4 14.5. | Minimum Spanning Trees Slides (Print 4-on-1, 1-on-1) Notebook: JupyterHub (VPN), Github |
| C5 15.5. | Shortest Paths: Foundations Slides (Print 4-on-1, 1-on-1) |
| C6 21.5. | Shortest Paths: Algorithms Slides (Print 4-on-1, 1-on-1) Notebook: JupyterHub (VPN), Github |
| C7 22.5. | Graphs: Outlook Slides (Print 4-on-1, 1-on-1) |
| C8 28.5. | Concepts Slides (Print 4-on-1, 1-on-1) |