\documentstyle[12pt]{report}
\pagestyle{myheadings}
\def\headlineaux{\sc Math 220/317: Programming II/Data Structures
\hrulefill
}
\markboth{\headlineaux}{\headlineaux}

\begin{document}
\begin{titlepage}\begin{centerline}{\Huge  Burt Rosenberg }
\end{centerline}\end{titlepage}

\section*{Quiz Review}

You are responsible for these items:
\begin{enumerate}
\item Trees: How to search, insert and delete in a binary tree.
\item Union-Find: How to union and find an element using an array
of parent pointers, as in the code distributed in class for Kruskal's MST.
Be prepared to simulate union-find by hand on a given parent array.
\item Heaps: How to insert into a heap and use delete-min to take things
out of a heap. Be prepared to simulate this by hand on given array of
values.
\item Hashing: How to use linear probing to insert things into a hash
table and search for things in a hash table. Be prepared
to simulate this by hand on a given hash array.
\item Pascal: You should be fluent with pointers, records and arrays.
\end{enumerate}
The quiz will be Monday, December 14-th, in class.

\end{document}
