- Dec 14 — The date and time of your final exam can be found on the Registrar's final exam schedule.
- Dec 5 — Homework 6 posted.
- Nov 22 — Project 4 posted.
- Nov 22 — Homework 5 posted.
- Nov 10 — Project 3 due date moved to Nov 27
- Nov 1 — Exam 2 Review Questions posted
- Oct 31 — Project 3 posted — Happy Halloween!
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.
|01 (7312)||Mr. Dennis Frey||ITE 209||Monday — Thursday 2:30 – 3:email@example.com|
|02 (7313)||Mr. Ryan Bergeron||ITE 215||Tuesday/Thursday 2:30 – 3:firstname.lastname@example.org|
|03 (7314)||Mr. Dan Hood||ITE 211||Tuesday/Thursday 7:00 – 8:email@example.com|
|Honors (10744)||Dr. Tim Oates||ITE 336||Monday 11:00am — 12:00 firstname.lastname@example.org|
Class Meeting Information
|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|