Faithful Prof: Jeff  Edmonds    jeff@cse.yorku.ca    Office Hours
Lectures: Mon Ross S 125, Wed Ross S 130, 11:30-1:00
Office Hour: After class
Syllabus
Home Work and Test Dates     Your Marks
Presentations    Talk Dates
6111 Forum

TEXTS:

Course Description
Syllabus and Course Material
Cormen, Leiserson, Rivest, and Stein  "Introduction to Algorithms" , second edition
Jeff Edmonds' "How to Think about Algorithms"   Amazon   Cambridge House Press   Desk Copies   reviews
3101 Material
Umesh Vazirani's Book
Jeff Erickson's Notes
Gems of Theoretical Computer Science (Many thanks to U. Schoning and R. Pruim)

PREREQUISITES:

You should know the 3101 material to take this advanced graduate course in algorithms.
Last year, because many people struggled with it, we spent too much time reviewing the 3101 material.
This year we will spend much less time reviewing this material and I will be more insistent that you know it.
If you are at all uncomfortable with this material then you may still take 6111, but I strongly recommend that you
Read my 3101 text & slides
attend my 3101 lectures in parallel. (Sorry not teaching it this term)

GRADING: (Mark Alg)

Assignments    (30%) (Listed in Sylabus)
A test every 2 weeks    (30%)
Presentation    (30%)
Class Participation    (10%)