\documentclass[twocolumn]{article}
% \documentclass{article}

\setlength{\oddsidemargin}{-0.5in}
\setlength{\evensidemargin}{-0.5in}
\setlength{\topmargin}{0.0in}
\setlength{\headheight}{0in}
\setlength{\headsep}{0in}
\setlength{\textwidth}{7.0in}
\setlength{\textheight}{9.5in}
\setlength{\parindent}{0in}
\setlength{\parskip}{0.05in}
\setlength{\columnseprule}{0.3pt}

\setlength\columnsep{25pt}

\usepackage{fancyvrb}
\usepackage{relsize}
\usepackage{hyperref}

\usepackage{listings}
\usepackage{amsmath}

\begin{document}

\lstset{xleftmargin=5mm,framexleftmargin=10mm,basicstyle=\footnotesize}


{\Large \bf GROUP QUIZ SUBMISSIONS INSTRUCTIONS:}

\begin{itemize}

\item Your work must be submitted by 6 p.m, March 12.  Submission must
be done from within the classroom.

\item Submit your work on {\bf handin}, to the directory {\bf 158quiz7}.

\item Your {\bf .tar} file name must conform to the rules explained in our
Syllabus, Section 19.4.  

\item Your {\bf .tar} file must comprise one file, named {\bf
GrpQuiz.R}. 

\end{itemize}

My grading script will be 

\begin{lstlisting}
source("GrpQuiz.R")
# set cls, f, nsubints, niters (not shown)
findroots(cls,f,nsubints,niters)
\end{lstlisting}

\bigskip

{\bf 1.} This problem will be similar to the root-finding examples we've
seen.  Here we are given a function {\bf f()}, known to have
one {\it or more} roots in (0,1), which you will write R Snow code to
find.  The call form will be

\begin{lstlisting}
findroots(cls,f,nsubints,niters)
\end{lstlisting}

with arguments as follows:

\begin{itemize}

\item {\bf cls:} The Snow cluster.

\item {\bf f:} The function whose roots are to be found.

\item {\bf nsubints:}  Number of subintervals in each iteration, to be
explained below.

\item {\bf niters:}  Number of iterations.

\end{itemize}

The return value is the vector of roots found, to the accuracy of the
current subinterval width.

The function {\bf f()} is assumed to be continuous.  If you wish to
impose any additional restrictions on it, consult with me.  It is not
known how many roots it has.

At each iteration, each of the Current Intervals will be divided into
{\bf nsubints} subintervals, each one of which will be checked for a
sign change.  The Current Interval starts as (0,1), but at any later
iteration, there may be multiple Current Intervals waiting to be
checked.

You are welcome to download code from the Web, as long as it doesn't
requite compilation.  The preceding sentence should not be construed to
mean that a Web search necessarily be helpful.

Extra Credit will be given for the three fastest versions of the code.
Note that in order to test your code's speed, you'll need a function
{\bf f()} that takes a nontrivial amount of time to evaluate, especially
over many calls.

% \onecolumn

% \newpage

% {\bf Solutions:}

\end{document}

