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.

Course Instructors

Section Instructor Office Office Hours Email
01 (7312) Mr. Dennis Frey ITE 209 Monday — Thursday 2:30 – 3:30pm frey@cs.umbc.edu
02 (7313) Mr. Ryan Bergeron ITE 215 Tuesday/Thursday 2:30 – 3:30pm rberge1@umbc.edu
03 (7314) Mr. Dan Hood ITE 211 Tuesday/Thursday 7:00 – 8:00pm danielhood@umbc.edu
Honors (10744) Dr. Tim Oates ITE 336 Monday 11:00am — 12:00 noon oates@cs.umbc.edu

Class Meeting Information

Section Days Time Location
01 Tuesday/Thursday 4:00 – 5:15pm SOND 111
02 Monday/Wednesday 1:00pm – 2:15pm SOND 109
03 Tuesday/Thursday 5:30pm – 6:45pm ITE 231
Honors Monday/Wednesday 2:30pm – 3:45pm ITE 239