\documentstyle[11pt]{article}
\pagestyle{empty}
\begin{document}
\begin{center} {\Large\bf G22.1170 Fundamental Algorithms, Spring 2015} \end{center}
\begin{tabular}{ll}
Time & Monday 5:00-6:50 \\
Place & ciww109 \\
Instructor & Prof. Joel Spencer, wwh 829 \\
Phone & x8-3219\\ email & spencer@cs.nyu.edu \\
Office Hours & TBA \\
Text & Introduction to Algorithms by \\
& Cormen, Leiserson, Rivest, Stein -- THIRD EDITION \\
Midterm Exam & TBA \\
Final Exam & As Scheduled by University \\
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 26 & Heaps & 6 \\
Feb 2 & Sorts & 7,8 \\
Feb 9 & $\Theta,\Omega,o$ and $O$ & 3 \\
Feb 16 & HOLIDAY! & Thanks, George \\
Feb 23 & Divide and (sometimes!) Conquer & 4 \\
Mar 2 & Hashing & 11 \\
Mar 9 & MIDTERM & (TENTATIVE!) \\
Mar 16 & Spring Break! & -- \\
Mar 23 & Binary Search & 12 \\
Mar 30 & Dynamic Programming & 15 \\
Apr 6 & Greed is Good & 16 \\
Apr 13 & Graph Search & 22 \\
Apr 20 & Min Spanning Trees & 23 \\
Apr 27 & Number Theory & 31 \\
May 4 & P \& NP & 34 \\
May 11 & Shortest Paths & 24.2,3 \\
\end{tabular}
\vspace{1cm}
\end{document}