Course Description
Description, properties, and storage allocation functions of data structures including heaps, balanced binary trees, B-Trees, hash tables, skiplists, tries, kd-trees, quadtrees and many more. Algorithms for manipulating structures. Applications from areas such as information retrieval, machine learning, string processing, computer graphics, computer networks, and operating systems.
Course Format
Lectures will be in person (see class time below). A number of changes have been implemented due to COVID-19. Please feel free to talk with me if you have any questions or concerns with the following.
- Students must comply with University COVID-19 policies. In particular, students are required to comply with campus mask mandates while attending class and during in-person office hours.
- Attendance in lectures is optional (but strongly encouraged). All lectures will be recorded and posted within 24 hours.
- Attendance is required for the two midterm exams and the final exam. (See the Syllabus for dates.)
- Other than exams, all class work will be submitted electronically.
- Some office hours will be conducted either through Zoom or in-person. (The format will be given in the table below.)
Class Time
Tue, Thu 9:30am-10:45pm, CSI 1115.
Course Staff
| Name | Role | Contact |
|---|---|---|
| Dave Mount | Instructor | mount@umd.edu |
| Adi Acharya | Grad TA | adach@umd.edu |
| Joseph Hong | Undergrad TA | jhong7@umd.edu |
| Yianni Karabatis | Grad TA | yianni@umd.edu |
| Shuhao Tan | Grad TA | shuhao@umd.edu |