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

\newcommand{\outdate}{14 December, 1993}
\newcommand{\duedate}{2 December, 1993}

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

\section*{Final Exam Announcement}

The final will be:
\begin{center}{\em  Thursday, 5:00--7:30, December 14-th.}\end{center}
You should have read Sedgewick, Chapters 1--23, but you are responsible
only for algorithms which were the subject of homework assignments.
(Hence Heaps might be on the test, but Tries will not.)
Here is a list of items to be included on the final:
\begin{enumerate}
\item Logic: make sure you know your Boolean Logic and how
  to manipulate program statements preserving their logical
  equivalence.
  Review how change repeat loops in while loops
  and how recursion fits into the picture.
\item Programming: make sure you know how to program!
  There will be a short program to write, similar to on the
  midterm.
\item Algorithms: review the algorithms from your homework
  assignments, including Binary Search Trees, Heaps and
  Balanced Trees.
  Review the chapter of algorithm analysis and how the
  efficiency of an algorithm can be given as a function
  of program size.
\end{enumerate}

\end{document}
