I will, in fact, claim that the difference between a bad programmer and a good one is whether he considers his code or his data structures more important. Bad programmers worry about the code. Good programmers worry about data structures and their relationships.

Linus Torvalds, Git mailing-list message, 27 July 2006

The class meets on Tuesdays in Howard Hall 543 (the wireless lab) from 6 p.m. to 7:50 p.m. and on Thursdays in Howard Hall C1 (the cs conference room) from 6 p.m. to 7:50 p.m. 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% | assignment grades |

40% | quiz grades |

10% | presentation grade |

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

There are four quizzes, one quiz for each section after the first section; see the syllabus for the schedule. Quizzes are given in class, and are closed book with no notes; calculators and computers will not be necessary. The quizzes are cumulative, covering everything taught up to and including the class before the quiz. Quizzes should take no more than an hour to complete, and are given in the first hour of class. Quiz answers will be made available off the syllabus.

There are no midterms or final exams. Mid-term grades are computed from the straight, unweighted average of what ever grades have accrued by the day mid-term grades are due (Tuesday, 27 October).

The textbook for this class is
*Data Structures & Algorithms in Java*, second edition, by Robert Lafore, Sams, 2003.

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.

`http://tinyurl.com/moqx4r`

). I'll make
the class notes, assignments, and quizzes available off the syllabus
(`http://tinyurl.com/kmd8dr`

); you should
get in the habit of checking the home page and syllabus regularly.
`twitter.com/mucs305`

.
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.

Monmouth University does have a class attendance policy, which you can find in the Academic Information chapter of the Student Handbook. To the extent that I need to keep the record straight, I will take attendance. Attendance lists, however, are entirely for the University's benefit; I will make no use of them in grading.

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.