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)
Prerequisites: One year of college mathematics. 605.201 Introduction to Programming using Java or equivalent.
The current scheduled offerings for this course for the Spring 2010 term are listed below.
You can search the entire schedule using the Schedule Search form.
| 605.202.31 | Data Structures (Open) | |||||
|
01/26/2010 - 05/04/2010 | Room: K5 | $1,510 |
Resch, C. |
||
| 605.202.71 | Data Structures (Open) | |||||
|
01/28/2010 - 05/06/2010 | Room: Gilchrist303 | $1,510 |
Tjaden, B. |
||