This is an unofficial page for section 01 & 04 of 198:344. The page with higher priority is Professor S. Muthu Muthukrishnan's course webpage and Professor Martin Farach-Colton's course webpage.
TA's information:
Carlos Greg Diuk
Office Hours: Wed 2:30 - 4:30pm
Office: Hill 418
Phone: (732)-445-4467
Email: cdiuk AT paul.rutgers.edu
News
11/12/03 Special office hours for midterm 2: Thursday 13th 2-3:30pm @ Hill-418.
11/12/03 No office hours Wed 11/26: Wednesday 11/26 is a Friday (??), so I won't be there for my regular office hours. If you want to see me during Thanksgiving week, send me an email.
Homework solutions
Links
Floyd's algorithm Java applet (see end of page)
The Final
Some of you asked me to suggest sections of the book I'd read or at least take a look at. Disclaimer: these sections might not cover ALL of the material and/or they may cover MORE material than the course.So check your class notes!
General mathematical background, algorithm complexity, asymptotics: Chapter 1
Recurrences, proofs: Chapter 3 (3.4, 3.6, 3.7)
Divide and conquer, Sorting: Chapter 4.
Selection: Chapter 5 (5.4)
Graphs: directed, undirected, labeled, representations, minimum spanning trees, shortest path, traversals (BFS, DFS), connected components, strongly connected components: Chapters 7, 8, 9.4, 9.5.
Plus: some dynamic programming (chapter 10), least common ancestor and range minimum query (not in book, check out notes and Google for Farach's paper).