\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}{Spring 2005}{5 January 2005}{1}

\begin{center}
\Large{\bf Questionnaire}
\end{center}

\bigskip

{\bf Name:}

\medskip

{\bf Email address:}

\medskip

{\bf Major:}

\bigskip

\bigskip

\begin{enumerate}
\item
Have you taken CSU370 (Object-Oriented Design) or equivalent?

\bigskip

\item
Have you taken CSU390 (Theory of Computation) or equivalent?

\bigskip

\bigskip

\item
Are you familiar with the following data structures?
\begin{itemize}
\item
Linked lists:

\medskip

\item
Stacks and queues:

\medskip

\item
Binary search trees:

\medskip

\item
Balanced binary search trees (e.g., AVL trees, 2-3 trees, red-black
trees, B-trees):

\medskip

\item
Hash tables:

\medskip

\end{itemize}

\item
Which sorting algorithms have you learned?  For each one, write
``yes'' if you also analyzed the running time and ``no'' if not.
\end{enumerate}
\end{document}