Recent Announcements

View all announcements

Course 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.

Class Meeting Information

Section Instructor Days Time Location
01 Dr. Yun Peng Tuesday / Thursdaysday 11:30am — 12:45pm ITE 227
02 Dr. Jian Chen Monday/Wednesday 1:00 – 2:15pm ITE 231
03 Mr. Daniel Hood Tuesday/Thursday 5:30 – 6:45pm Math/Psych 104
04 Dr. Yun Peng Tuesday
5:30 – 6:45pm ITE 231
ACIV 014

Course Instructors

Section Instructor Office Office Hours Email
01 Dr. Yun Peng ITE 341 Tue/Thur 1:00 — 2:00pm ypeng@umbc.edu
02 Dr. Jian Chen ITE 357 Mon/Wed 2:30 — 3:30pm jichen@umbc.edu
03 Mr. Daniel Hood ITE 211 Tues/Thurs 7:00pm — 8:00pm danielhood@umbc.edu
04 Dr. Yun Peng ITE 341 Tues/Thurs 4:00 — 5:00pm ypeng@umbc.edu