Course HomepageThis homepage contains links to lecture notes and homework assignments; in the near future, it should contain more of the syllabus information. All lecture notes were produced using the HtX system, a compiler mapping LaTEX-like source to HTML target. The course text is Mark Allen Weiss' book Data Structures & Problem Solving Using Java; on-line errata and other materials can be found at the author's website .
On-line lecture notes
Some of the definitions are missing from the last section; they are given in
the book on page 121.
This lecture covers two examples, one using loops from the text (the maximum
contiguous subsequence sum problem) and one involving recursion (Fibonacci
numbers). The definition of Ackermann's function and table of values is not
currently in the notes, but will be added for the review if mentioned on
the exam.
This lecture is finally on-line ...
and there's still a cartoon!
This lecture is finally on-line ...
and here's some poetry about error messages.
This lecture provides a sample use of the tree code from the Weiss textbook.
It also describes a few issues on setting up project directories and a
little bit on generics (but it's missing an example here).
This lecture discusses a few different kinds of sorting algorithms and draws
the distinction between several broad categories. It needs some detail on
mergesort ... and lots of pictures! (especially the "folding vector" for
shellsort)
Printable (ASCII) versions of lectures
On-line homework and programming projects
Assigned: Tue 3 Feb 1998
Due: Tue 10 Feb 1998
Assigned: Thu 12 Feb 1998
Due: Thu 26 Feb 1998 (revised from Thu 19)
Assigned: Thu 5 Mar 1998
Due: Thu 19 Mar 1998
Assigned: Wed 1 Apr 1998
Due: Thu 9 Apr 1998
Assigned: Mon 13 Apr 1998
Due: Mon 20 Apr 1998
|