An actual tree
CMSC 420 - 0201
Data Structures
Fall 2020
Dave Mount

Course Description

Description, properties, and storage allocation functions of data structures including balanced binary trees, B-Trees, hash tables, skiplists, tries, kd-Trees and quadtrees. Algorithms for manipulating structures. Applications from areas such as string processing, computer graphics, information retrieval, computer networks, computer vision, and operating systems.

Online Structure

This semester, the course will be offered in an online format. The course will be mostly asynchronous, with the following exceptions:

All other aspects of the course should be accessible to enrolled students operating anywhere on Earth, assuming you have Internet access. In particular, exam and quiz times and submission due dates will span at least a 24-hour window.

This is a relatively new format for all of us, and mistakes will likely occur. Please be patient with us. If you experience difficulties, please contact the course instructor.

Class Time

Tue, Thu 11:00am-12:15pm EDT/EST. (Lectures will be given online via Zoom and recordings made available.)

Course Staff

Name Role Contact
Dave Mount Instructor, IRB 4162
Hong-Min Chu Graduate TA
Abhishek Kumar Graduate TA
Shuhao Tan Graduate TA
Niall Williams Graduate TA

Office Hours

Office hours will be held through Zoom meetings. If you cannot make the scheduled office hours, please feel free to contact any of us by email to set up an alternative time. We all allocate one hour per week for unscheduled office hours.

Monday 12 - 1 pm Dave
  2 - 3 pm Abhishek
  4 - 5 pm Shuhao
Tuesday 12:15 - ... Dave (Just after lecture)
  2 - 3 pm Hong-Min
  5 - 6 pm Niall
Wednesday 11 - 12 n Niall
  1 - 2 pm Dave
  3 - 4 pm Shuhao
Thursday 12:15 - ... Dave (Just after lecture)
  1 - 2 pm Hong-Min
  5 - 6 pm Abhishek

Web Accessibility