\documentstyle[12pt]{report}

\pagestyle{myheadings}
\def\headlineaux{\sc Math 220/317: Programming II/Data Structures
\hrulefill
}
\markboth{\headlineaux}{\headlineaux}

\setlength{\textwidth}{6.25in}
\setlength{\oddsidemargin}{0in}
\setlength{\evensidemargin}{0in}

\begin{document}

\begin{titlepage}
Blank Page
\end{titlepage}
                      

\section{Schedule}

\begin{itemize}

\item
{\em Aug 25}
Review of pascal.
Loop invariants, example: find the max. in an array.

\item
{\em Aug 30}
Loop invariants continued. Sentinels.

\item
{\em Sep 1}
Data Objects, the myString object.
HW 1 out.

\item
{\em Sep 6}
Rosh H. holiday.

\item
{\em Sep 8}
Memory references, pointers and linked lists.

\item
{\em Sep 13}
Pointers and Linked List, continued:
printing, adding to.
HW 1 due, HW 2 out.

\item
{\em Sep 15}
Yom Kipper holiday.

\item
{\em Sep 20}
Go over HW1 solutions. 
Data Structure Invariants.
Propositional calculus.

\item
{\em Sep 22}
Finish propositional calc, implies, tautologies, quantifiers.
HW2 due, HW3 out (written)
Head and tail pointers.

\item
{\em Sep 27}
Deleting and dummy headers.
Discrete Calculus for sum of integers, sum of squares,
sum of consecutive odds, and of evens.
Very light introduction to analysis of algorithms
in the context of last week's (too slow) program.

\item
{\em Sep 29}
HW3 due, HW4 out (Move to Front)
Heuristics for algorithms, move to front, the difference that it makes.
Other types of lists: circular, doubly-linked.

\item
{\em Oct 4}
Recursion introduced. A quasi-formal comparison of FOR, WHILE and
REPEAT. The three forms of program control: straight-line, branch
and iteration. Recursion, transforming iteration to recursion, and
recursion to iteration. Example: filling an array by all four
constructs. Listing a list by recursion. Comparing lex. order of
strings by recursion.

\item
{\em Oct 6, Th}
No class, went to pickup the dogs.

\item
{\em Oct 11, Tu}
HW4 due, HW5 out, recursion homework.
Chapter 16 of Condensed, examples of recursion were covered in
detail, reverse the characters, towers of hanoi,
triangle numbers, fibonacci numbers, exponentiation and
fast exponentiation, eight queens problem.

\item
{\em Oct 13, Th}
Trees, recursive printing, searching on trees.
Complete trees of depth $i$ have $2^{i+1}-1$ nodes.

\item
{\em Oct 18, Tu}
HW5 due.
Insertion and deletion algorithms for trees.
The problem of balance.

\item
{\em Oct 20, Th}
Midterm.

\item
{\em Oct 25, Tu}
HW6 out.  Discussion of homework.
Trees, storing at leaves versus internal. Counting leaves
of ``full'' trees. Introdution to 2-4 trees.

\item
{\em Oct 27, Th}
2-4 tree insert.

\item
{\em Nov 1, Tu}
2-4 trees delete.

\item
{\em Nov 3, Th}
HW6 due.
2-4 trees pretty print.
(2-D trees would be nice.)

\item
{\em Nov 8, Tu}
HW 7 Out, HW 6 is really really due.
Algorithms for sorting and their analysis.
Insertion, selection and bubble.

\item
{\em Nov 10, Th}
Fast algorithms for sorting, quick, merge and heap.

\item
{\em Nov 15, Tu}
heap sort, continued.

\item
{\em Nov 17, Th}
Graph Algorithms

\item
{\em Nov 22, Tu}
HW 7 Due, HW 8 Out,
Graph Algorithms

\item
{\em Nov 24, Th}
Thanksgiving Holiday.

\item
{\em Nov 29, Tu}
Graph algorithms.

\item
{\em Dec 1, Th}
Last day of class.
Hashing.
HW 8 Due.
\end{itemize}
\end{document}
