Data Structures in Java
605.202.72
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
- Introduction to Data Structures
- Recursion
- Algorithms
- Stacks
- Queues
- Linked Lists
- Sorting
- Midterm
- Spring Break
- Hashing Tables
- Trees
- Other Binary Trees; Binary Search Trees
- Priority Queue
- Topics of Interest; Final Exam
Prerequisites
Differential and integral calculus and 605.201 or equivalent.
Instructor
Bunny J Tjaden is a computer scientist and senior software specialist at Client Network Services, Inc. (CSNI) in Gaithersburg, Maryland. She earned her B.A. in Mathematics from Cedar Creat College in 1967, an M.S. in Applied Mathematics in 1971 and an M.S. in Computer Science in 1991, both from Johns Hopkins University, and a Ph.D in Computer Science from The George Washington University in 1997. She has been a professor of Computer Science for 16 years, most recently having taught at California Polytechnic State University and The George Washington University. She is a member of ACM.
Course Section, Location, and Time
Please refer to the Course Schedule
for section information, including time and location.
Computer Lab Requirements
knowledge of Java;
knowledge of UNIX
knowledge of differential and integral calculus
Textbook
by
Return to Part-Time Engineering
Return to Whiting School of Engineering
Return to JHUniverse