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 Java programming assignments.
NOTE: This course DOES NOT count toward the Master of Science in Computer
Science degree.
Syllabus
- Data Abstraction
- Recursion
- Recursion
- Linked Lists
- Stacks
- Queues
- Algorithm Efficiency and Sorting
- Sorting
- Trees
- Priority Queues and Tables
Prerequisites
One year of college mathematics.
Instructor
Cheryl Resch is a scientist at the Johns Hopkins University Applied Physics Laboratory.
She received Bachelors and Masters Degrees in Mechanical Engineering from University of
Maryland in 1986 and 1988. She received a Masters Degree in Computer Science from
Johns Hopkins University in 2001. She has worked at JHU/APL since 1988 and is currently
in the System and Information Sciences Group in the Research and Technology Development
Center.
Course Section, Location, and Time
Please refer to the Course Schedule
for section information, including time and location.
Computer Lab Requirements
No specific computer requirements are necessary for this course.
Textbook
Return to Part-Time Engineering
Return to Whiting School of Engineering
Return to JHUniverse