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.


Sections

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 Instructor Days Time Location
01 Mr. Morawski Monday & Wednesday 4:00pm — 5:15pm Janet & Walter Sondheim 103
02 Mr. Lupoli Tuesday & Thursday 2:30 – 3:45pm ITE 229
03 Mr. Caban Monday & Wednesday 5:30 – 6:45pm Sherman Hall 015
03 Mr. Morawski Tuesday & Thursday 1:00 – 2:15pm ITE 229