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 Mr. Dennis Frey Monday / Wednesday 1:00 — 2:15pm ITE 229
02 Dr. Jesus Caban Monday/Wednesday 5:30 – 6:45pm ITE 231
03 Mr. Ryan Bergeron Tuesday/Thursday 5:30 – 6:45pm Math/Psych 106
04 Dr. Yung Peng Tuesday/Thursday 2:30 – 3:45pm Math/Psych 103

Course Instructors

Section Instructor Office Office Hours Email
01 (1077) Mr. Dennis Frey ITE 209 Mon/Wed 2:30 — 3:30pm
Tues/Thur 11:30am — 12:30pm
02 (1078) Dr. Jesus Caban ITE 201A Mon/Wed 4:30 — 5:30pm caban1@csee.umbc.edu
03 (1079) Mr. Ryan Bergeron ITE 215 MTuWTh 4:00pm—5:15pm rberge1@umbc.edu
04 (7348) Dr. Yung Peng ITE 341 Tues/Thurs 1:00 — 2:00pm ypeng@umbc.edu