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. (Not for Graduate credit.)
Course prerequisites: 
One year of college mathematics. 605.201 Introduction to Programming Using Java or equivalent.
Course notes: 
Not for Graduate credit.
Course instructor: 
Chlan, Cost, Earle, Kann, Resch

View Course Homepage(s) for this course.