Data Structures
Session
Eight Week - First
Class Number
1299
Career
Undergraduate
Units
3 units
Grading
Description
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.
Enrollment Requirements
You must have completed CMSC 202 and CMSC 203 with a grade of C or better
Notes
This is a synchronous online course. Students are expected to attend class online during the days/times listed in the meeting pattern. It requires reliable internet access and computer literacy; and the ability to self-manage independent learning assignments according to deadlines. In place of classroom activities, online work may include independent mastery assignments, discussion boards, videos with quizzes, writing assignments, and other active learning experiences. Students are responsible for completing these online learning experiences by the specified deadlines and in accordance with instructor requirements.
Class Actions
Book Store
Class Details
Instructor(s)
Shawn Lupoli
Meets
TBA
Dates
06/01/2021 - 07/23/2021
Room
WEB
Instruction Mode
Online
Campus
Main Campus
Location
Univ of MD, Baltimore County
Components
Lecture Required
Class Availability
Status
Open
Seats Taken
46
Seats Open
4
Class Capacity
50
Wait List Total
0
Wait List Capacity
10