COMP 212 - Data Structures |
Spring 2000 |
| Instructor-- | Danny Krizanc |
| Office-- | 631 Science Center |
| Office Hours-- | Mondays and Wednesdays 4:30-5:30 or by appointment |
| Phone-- | 860-685-2186 |
| E-mail-- | dkrizanc@wesleyan.edu |
| Webpage-- | http://www.wesleyan.edu/~dkrizanc |
| Schedule-- | MW 1:10-2:30 139SC |
The purpose of this course is to introduce and investigate a variety of important data structures based on the notion of an abstract data type. In particular, the following topics will be discussed:
Depending on the time available other topics may be addressed such as data structures for radix searching and for searching external memory.
The required textbook for the course is
It does a pretty good job of presenting pretty much all of the material to be covered in the course and since it is likely that some of the assignment questions will taken from it, I highly recommend purchasing it.
Other books that present much of the same material perhaps from a different perspective include the following.
The following is an approximate plan of the course and is subject to change.
|
|
Topic | Readings |
| 1 | Introduction | Chapter 1 |
|
|
Analysis of Algorithms | Chapter 2 |
|
|
Arrays and Lists | Chapter 3 |
|
|
Stacks and Queues | Chapter 4 |
|
|
Trees and Recursion | Chapter 5 |
|
|
Priority Queues | Chapter 9 |
|
|
Symbol Tables and Binary Search Trees | Chapter 12 |
|
|
Balanced Search Trees | Chapter 13 |
|
|
Hashing | Chapter 14 |
|
|
Tries and B-Trees | Chapters 15-16 |
| Page last modified on February 15, 2000 |
| Report problems to dkrizanc@wesleyan.edu
|