CSC365
Instructor: Doug Lea
Class: TR 4pm
Office/Lab hours. Normally M-F 11-12
Course home page: http://gee.cs.oswego.edu/dl/csc365
Topics
- Collections
- Review and extension of arrays, lists, tables, trees.
- Balanced trees
- Persistence
- Indexing, BTrees, Hashing
- Sequential IO
- Serialization, Pipes, Sorting, Text searching, etc.
- Graphs
- Algorithms for traversal, connectivity, paths, flow
Requirements
Subject to minor change:
- One final exam (15%)
- Practice exam
- About 15 10-minute quizes (25%)
- Some may be unannounced. They are intended to motivate you
to keep up with schedules.
- 4 programming assignments (60%)
- Programs may not be
submitted unless they successfully run according to
specification. You must demo your program to me
within 2 days of submitting it.
Five percent credit is taken off per day late.
- Assignment 1
- Assignment 2
- Assignment 3
- Assignment 4
Readings
There is no required text. However, I recommend that you buy:
Robert Sedgewick. Algorithms in C++, third edition. Addison-Wesley, 1998.
This is a good reference-quality text on about half the data
structures discussed in class. A few sections of this book will be
assigned as required readings. (Alternatively, you can get the "C"
version of the book. Unfortunately, the Java version is still not
yet published. But the descriptions of the algorithms are about the
same in all these languages.) A copy will be on reserve at the
library. Other readings will be based on on-line resources and
handouts.
You will also be expected to work through several online tutorials
and related readings.
Useful Links
Doug Lea
Last modified: Wed Oct 24 07:35:34 EDT 2001