\documentclass[11pt]{article}
\usepackage{handout2e}
\begin{document}
\input{macros}
\input{courseMacros}
\thispagestyle{empty}
\setlength{\parindent}{0pt}
\setlength{\parskip}{1.8ex}

\head{CSU690}{Algorithms and Data}{Fall 2006}{15 September 2006}{3}

\begin{center}
\Large{\bf Review 1 (Tuesday, September 19)}
\end{center}

{\bf 1.}  Exercise 5, page 24.

{\bf 2.}  A tromino is an L-shaped tile formed by three adjacent
squares of a chessboard.  Prove by induction on $n \ge 1$ that any
$2^n \times 2^n$ chessboard with one square missing can be completely
covered by trominoes, regardless of the location of the missing
square.

{\bf 3.} Exercise 8 part (a), page 69.

\end{document}