\documentstyle[11pt]{article}
\pagestyle{empty}
\begin{document}
\begin{center} {\Large\bf G22.1170 Fundamental Algorithms, Fall 2013} \end{center}
\begin{tabular}{ll}
Time & Monday 5:00-6:50 \\
Place & Cantor 101 \\
Instructor & Prof. Joel Spencer, wwh 829 \\
Phone & x8-3219\\ email & spencer@cs.nyu.edu \\
Office Hours & Tuesday morning 9-11 a.m. \\
Text & Introduction to Algorithms by \\
& Cormen, Leiserson, Rivest, Stein -- THIRD EDITION \\
Midterm Exam & Monday, Oct 21 in class \\
Final Exam & December 16th, 5:10-7:00PM, Cantor 101\\
Recitation & Thursday 7:10-8\\
Place & ciww 102\\
Instructor & TBA
\end{tabular}
\vspace{1cm}
There will generally be one assignment per week, made available
electronically (on the website) around classtime and due the
next week.
Submission of assignments (unless clearly marked
otherwise) is {\em mandatory}.
\par Collaboration on the assignments is {\em encouraged.} Each student
must hand in the assignment individually and should write out the
solutions in their own words. At the end of the assignment the
collaborations must be listed. E.g.: Collaboration with Alan Turing
and William Gates.
\par The final grade will be based $60\%$ on the Final Exam, $30\%$ on the
Midterm and $10\%$ on the Homework.
But grades are not determined by an
algorithm, subjective factors such as class participation
(in both lecture and recitation) are a ``fudge
factor'' that can carry great weight.
\par The Final Exam date is FIXED by the University well in
advance.
You MUST NOT arrange your flight home for an earlier date!
\par On the next page is a
{\em rough} outline of the course. We expect to
cover these topics but not necessarily in the precise order indicated.
In addition there is likely to be some material in class that is
not in the text. Students are responsible for all such material.
\pagebreak
\begin{center}{\bf Weekly Schedule}\end{center}
Note that this schedule may be adjusted during the term.
Any such adjustments will be noted on the website.
\vspace{2cm}
\begin{tabular}{rlr}
CLASS & TOPIC & CHAPTER \\
Sept 9& Heaps & 6 \\
Sept 16 & Sorts & 7,8 \\
Sept 23 & $\Theta,\Omega,o$ and $O$ & 3 \\
Sept 30 & Divide and (sometimes!) Conquer & 4 \\
Oct 7 & Hashing & 11 \\
Oct 14 & FALL RECESS! & -- \\
Oct 21 & MIDTERM & -- \\
Oct 28 & Binary Search & 12 \\
Nov 4 & Dynamic Programming & 15 \\
Nov 11 & Greed is Good & 16 \\
Nov 18 & Graph Search & 22 \\
Nov 25 & Min Spanning Trees & 23 \\
Dec 2 & Number Theory & 31 \\
Dec 9 & Shortest Paths & 24.2,3 \\
Dec 11 & P \& NP & 34 \\
\end{tabular}
\vspace{1cm}
Special Notes
\\ $\bullet$ Monday, Sept 2 is Labor Day. There are no classes that day.
\\ $\bullet$ Monday, Oct 14 and Tuesday, Oct 15 are Fall Recess. There
are no classes on those days.
\\ $\bullet$ Wednesday, December 11 classes meet on a Monday schedule.
We will have full classes on both December 9 and December 11. Arrangements
(TBA) will be made so that the assignments are not too onerous.
\end{document}