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:
|01||Dr. Richard Chang||Tuesday & Thursday||11:30am — 12:45pm||ITE 229|
|02||Mr. Shawn Lupoli||Monday & Wednesday||1:00 – 2:15pm||ITE 231|
|03||Dr. Jian Chen||Tuesday & Thursday||4:00 – 5:15pm||Math/Psych 103|
|04||Dr. Nilanjan Banerjee||Monday & Wednesday||5:30 – 6:45pm||Sondheim 409|