The class meets in Howard Hall 524 on Tuesdays 8:10 p.m. to 10:00 p.m. and on Thursdays from 8:10 p.m. to 9:00 p.m. Lab is held in Howard Hall 542 from 9:05 p.m. to 10:00 p.m. on Thursdays. There is no class on Thanksgiving, Thursday, 27 November. Thursday, 6 November is the last day to withdraw from class with a W on your transcript.

- know some basic data structures and algorithms,
- be able to choose wisely among data structures and algorithms, and
- design and write code supporting data structures and algorithms well.

All grades are kept with one digit of precision to the right of the decimal point and 0.05 rounded up. No grades are adjusted to a curve; that means, for example, that 89.9 is always a B+, never an A-.

For CS 305: for CS 503:

95 ≤ A 90 ≤ A- < 95 86.6 ≤ B+ < 90 83.3 ≤ B < 86.6 80 ≤ B- < 83.3 76.6 ≤ C+ < 80 73.3 ≤ C < 76.6 70 ≤ C- < 73.3 60 ≤ D < 70 F < 60

95 ≤ A 90 ≤ A- < 95 86.6 ≤ B+ < 90 83.3 ≤ B < 86.6 80 ≤ B- < 83.3 76.6 ≤ C+ < 80 73.3 ≤ C < 76.6 70 ≤ C- < 73.3 F < 70

50% | quiz grades |

50% | assignment grades |

The quiz- and assignment-grade averages are straight, unweighted averages.

The final grades.

The textbook for this class is
*ADTs, Data Structures, and Problem Solving with C++*, second edition,
by Larry Nyhoff, Prentice-Hall, 2005. An
errata is
available off Nyhoff's web page for the book.

An annotated bibliography of other books of interest.

Mail relevant to the class are stored in a hyper-mail archive. If your message is of general interest to the class, I'll store it, suitably stripped of identification and along with my answer, in the archive.

My attendance policy applies only to lecture attendance; it does not apply to other kinds of attendance which may be required for the course. Repeated failures to meet the attendance expectations set for tests, meetings, projects, labs or other forms of course work will have a bad influence on your grade.

First, the only complaint that matters is that something got marked wrong when it was actually right. When you come to complain, be prepared to present, in explicit detail, what it is you did and why you think it's right.

Second, complaints about a particular test or assignment are only valid until the next test or assignment is due; after that point the book is permanently closed on all previous test or assignment grades.

A late assignment is penalized five points a day for each day it's late. I use a 24-hour clock running from midnight to midnight to measure days; note this means that an assignment handed in the day after it's due is penalized ten points: five for the day it was due and five for the next day.

A make-up test must be scheduled to be taken by the date of the test following the missed test (or the final exam if you miss the last test). If a missed test is not made up by the time of the next test, you get a zero for the missed test.

There will be only one make up given per missed test. If more than one person misses the same test, those people will have to coordinate among themselves to pick a mutually agreeable date for the make up.

FreeTechBooks' list of on-line data structures and algorithm books.

Softpanorama's old but wide ranging link page for data structures and algorithms.

Algosort's link page to algorithm pages.

Even data structures blog.