\documentclass[12pt]{article}

%\setlength{\parindent}{2em}
%\setlength{\parskip}{0ex}
\usepackage[letterpaper,hmargin=1in,vmargin=1in]{geometry}

\newcommand{\comment}[1]{}
\newcommand{\var}[1]{\mbox{\em #1}}
%\pagestyle{empty}

\begin{document}

\bibliographystyle{plain}
\setcounter{page}{1}
%\pagestyle{myheadings}
%\markright{\protect\small DRAFT \hfill\today\hfill page \protect\arabic{page}}

\normalsize

\begin{center}
\LARGE
Homework 4 \\
\normalsize 
\ \\
CS 3343 -- Fall 2006 \hfill assigned September 14, 2006 \\
Tom Bylander, Instructor \hfill due September 22, 2006
\end{center}

Your solutions must be submitted as a document to WebCT.

\begin{enumerate}

\item (10 pts.)
Do Exercise 3.1.5.  Show the result after each inner loop.

\item (10 pts.)
Do Exercise 3.1.8.  Show the result after each inner loop.

\item (20 pts.)
Do Exercise 3.2.5.

\item (20 pts.)
Do Exercise 3.3.2.  Use pseudocode in the book's style for your
algorithms.  Your algorithms can be brute force.  They do not have to
be the most efficient.

\item (20 pts.)
Do Exercise 3.4.6.  Use pseudocode in the book's style for your
algorithm.

\item (20 pts.)  Design and analyze a brute force algorithm to find
the smallest circle that contains a set of points in the plane.  Hint:
three points determine a circle if the points are not on the same
line.

\end{enumerate}

\end{document}