Course Homepage

Recent Announcements

All Announcements will be on your BlackBoard Page!!

Course Catalog Description

CMSC 341 — Data Structures

An examination of a range of advanced data structures, with an emphasis on an object-oriented approach. Topics include asymptotic analysis; various binary search trees, including red-black and splay trees; skip lists as alternatives to binary search trees; data structures for multidimensional data such as K-D trees; heaps and priority queues, including binary heaps, binomial heaps, leftist heaps (and/or other mergeable heaps); B-trees for external storage; other commonly used data structures, such as hash tables and disjoint sets. Programming projects in this course will focus on implementation issues for data structures and on empirical analysis of their asymptotic performance.

Be sure to read through the syllabus for more information.


All sections of CMSC 341 will have the same programming projects. However, lectures, exams and grading will vary by section. You must attend the lecture for your own section. Be sure to consult the section homepages for more information:

Section Days and Time Location Instructor Email
01 TuTh 10:00AM - 11:15AM Math & Psychology 106 Dr. Chang chang at
02 TuTh 1:00PM - 2:15PM Performing Arts & Humani 234 Mr. Budhraja karanb1 at
03 MoWe 1:00PM - 2:15PM Sherman Hall 150 Mr. Lupoli slupoli at
04 MoWe 2:30PM - 3:45PM Information Technology 227 Mr. Lupoli slupoli at
05 MoWe 5:30PM - 6:45PM Engineering 027 Scott Almes almes1 at
06 MoWe 7:10PM - 8:25PM Information Technology 239 Katherine Hirsch khirsh1 at