CMSC 420 (Section 0101) - Data Structures
Instructor : V.S. Subrahmanian
Office: A.V. Williams 2113 Contact: firstname.lastname@example.org, 301-405-6724
Office Hours: Tuesday - Thursday : 10:45 to 11:30 a.m., or by appointment
For appointments, please contact -
Teaching Assistant: Manish Purohit
Office Hours: Monday: 2:00 to 3:00 pm, Wednesday: 11:00 to 12:00 noon
Office hours will be held in the TA room - A.V Williams 1112
The goal of this course is to ensure that students can design/select the "right" data structures to store data for a problem or application in such a way that the performance goals that an end user or application developer has for certain operations are met. In short, there is no "good" or "bad" data structure in which to store data. Data structures are "good" or "bad", depending on the intended operations that must be performed on the data, and the performance expectations that an end user or application has.
The list of topics to be covered includes single dimensional data structures such as binary search trees, multidimensional data structures and associated queries, data structures to support searching over text, and algorithms and data structures to search over social networks.
Discussions and Announcements: Class discussions and all announcements (including homework assignments, projects, and examinations) will be posted on the Piazza page. Students are highly encouraged to use Piazza to ask questions/doubts, etc.
Syllabus: The tentative course syllabus can be found here.
Notes and Resources: All class notes will be posted on Piazza. Links to resources on the web are provided in the syllabus sheet.