Sep 19, 2020  
2017-2018 Undergraduate Catalog 
    
2017-2018 Undergraduate Catalog [ARCHIVED CATALOG]

Add to Portfolio (opens a new window)

CMSC 341 - Data Structures

(3.00)
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.

Course ID: 52914
Consent: No Special Consent Required
Components: Lecture
Course Equivalents: CMSC 341H 
Requirement Group: You must have completed CMSC 202  and CMSC 203  with a grade of C or better



Add to Portfolio (opens a new window)