\documentstyle[11pt]{article}
\pagestyle{empty}
\begin{document}
\begin{center} {\Large\bf G22.1170 Fundamental Algorithms, Spring 2018} \end{center}
\begin{tabular}{ll}
Time & Monday, 5:10-7:00 p.m. \\
Place & ciww 109 \\
Instructor & Prof. Joel Spencer, ciww 829 \\
Phone & x8-3219\\ email & spencer@cs.nyu.edu \\
Office Hours & TBA \\
Recitation & TBA \\
Recitation Times & TBA \\
Recitation Places & see schedule \\
Text & Introduction to Algorithms by \\
& Cormen, Leiserson, Rivest, Stein \\
Midterm Exam & TBA (in class) \\
Final Exam & Yes, Regularly scheduled during finals week \\
Final Exam & Place 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 \\
Jan 22 & Heaps & 6 \\
Jan 29 & Sorts & 7,8 \\
Feb 5 & $\Theta,\Omega,o$ and $O$ & 3 \\
Feb 12 & Divide and (sometimes!) Conquer & 4 \\
Feb 19 & NO CLASS & Thanks George! \\
Feb 26 & Hashing & 11 \\
Mar 5 & Binary Search & 12 \\
Mar 12 & NO CLASS! & Spring Break \\
Mar 19 & MIDTERM & (Tentative!!) \\
Mar 26 & Dynamic Programming & 15 \\
Apr 2 & Greed is Good & 16 \\
Apr 9 & Graph Search & 22 \\
Apr 16 & Min Spanning Trees & 23 \\
Apr 23 & Number Theory & 31 \\
Apr 30 & $P$, $NP$ and all that & 34 \\
May 7 & Shortest Paths & 24.2,3 \\
\end{tabular}
\vspace{1cm}
\end{document}