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

\head{CS G713}{Advanced Algorithms}{Fall 2003}{10 September 2003}{1}

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

{\bf Name:}

\smallskip

{\bf Email address (please write legibly):}

\smallskip

{\bf Major:}

\smallskip

\begin{enumerate}
\item
Have you taken an undergraduate course on the design and analysis of algorithms?

\medskip

\item
Have you taken MTH 3001 (Foundations in Mathematics \& Theory) or an
equivalent course in discrete mathematics?  Have you taken COM 3150
(Algorithms and Data Structures) or equivalent?  (If your answer to
the above question is ``yes'', then you may skip these questions)
\medskip

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

\smallskip

\item
Stacks and queues:

\smallskip

\item
Binary search trees:

\smallskip

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

\smallskip

\item
Hash tables:

\smallskip

\end{itemize}

\item
Which sorting algorithms have you learned?  (List up to five
algorithms.) For each one, write ``yes'' if you also analyzed the
running time and ``no'' if not.

\bigskip

\bigskip

\bigskip

\item
Are you familiar with the following graph algorithms?
\begin{itemize}
\item
Depth-first search:

\smallskip

\item
Breadth-first search:

\smallskip

\item
Topological sort:
\end{itemize}

\item
Are you familiar with asymptotic analysis -- the $O(\cdot)$,
$o(\cdot)$, and $\Omega(\cdot)$ notation, and techniques for solving
recurrences?

\medskip

\item
Are you comfortable with elementary probability theory: the notions of
random variable, expectation, and conditional probability?

\end{enumerate}
\end{document}

