CMSC 420 - 0201
Data Structures
Fall 2019
Dave Mount
CMSC 420 - 0201
Data Structures
Fall 2019
Dave Mount
In addition to the individual lecture notes below, I have compiled all lectures in a single documents.
Panopto recording of lectures (starting with Lecture 3) are available through the ELMS class page (under the tab "Panopto Recordings") or if you are affiliated with the University of Maryland community, just click here.
| Date | Lecture | Title | Slides |
|---|---|---|---|
| Tue 08/27 | 01 | Course Introduction | Slides |
| Thu 08/29 | 02 | Basic Data Structures | Slides |
| Tue 09/03 | 03 | Rooted and Binary Trees | Slides |
| Thu 09/05 Tue 9/10 |
04 | Binary Search Trees | Slides |
| Thu 09/12 | 05 | AVL Trees | Slides |
| Tue 09/17 Thu 09/19 |
06 | 2-3, Red-Black, and AA Trees | Slides |
| Thu 09/26 | 07 | Treaps and Skip Lists | Slides |
| Tue 10/01 Thu 10/03 |
08 | Splay Trees | Slides |
| Tue 10/08 | 09 | B Trees | Slides |
| Thu 10/10 | Review for Midterm Exam 1 | ||
| Tue 10/15 | Midterm Exam 1 | ||
| Thu 10/17 | 10 | Hashing - Basics and Hash Functions | Slides |
| Tue 10/22 Thu 10/24 |
11 | Hashing - Handling Collisions | Slides |
| Tue 10/29 Thu 10/31 |
12 | Extended and Scapegoat Trees (Does not include SG-Trees) |
Slides (Including SG-trees) |
| Tue 11/05 Thu 11/07 |
13 | Point Quadtrees and kd-Trees | Slides |
| Tue 11/12 Thu 11/14 |
14 | Queries with kd-Trees | Slides |
| Tue 11/19 | Review for Midterm Exam 2 | ||
| Thu 11/21 | Midterm Exam 2 | ||
| Tue 11/26 Tue 12/03 |
15 | Memory Management | Slides |