Data Structures
605.202
Data Structures
605.202
Course Description
This course investigates abstract data types (ADTs), recursion, algorithms
for searching and sorting, and basic algorithm analysis. ADTs to be covered
include lists, stacks, queues, priority queues, trees, sets, and dictionaries.
The emphasis is on the trade-offs associated with implementing alternative
data structures for these ADTs. There will be four or five substantial
programming assignments.
NOTE: This course DOES NOT count toward the Master of Science
in computer science degree.
Prerequisites
Differential and integral calculus and C++, C, or Pascal programming.
Instructor
Eleanor Chlan has a M.S. in computer science from the Johns Hopkins
University Whiting School of Engineering, a B.S. in computational mathematics
from Rochester Institute of Technology. She is currently a PhD student
at UMBC studying computer graphics and visualization with Dr. David Ebert.
In addition to teaching, Mrs. Chlan is the Special Student advisor for
the computer science and information systems & technology programs.
Prior to working for the University, Mrs. Chlan was a staff mathematician
at the Applied Physics Laboratory.
E-mail the instructor.
Return to Computer Science Courses | Computer Science | Part-Time Engineering