CSI 4105 - Design and Analysis of Algorithms II - Fall 2003

Professor :  Lucia Moura
Sources of Info: Office hours with T.A.
Marks: midterm, FINAL MARKS 
Course Material:  Course Description and Outline (this is the first handout with prof's contact info, textbook, marking scheme, due dates, etc.)
Lecture Contents (contents for each lecture, due dates) 
Lecture notes/slides: Lect 1-5  (postscript, ,pdf
Assignments:  A1 (ps,pdf) A2 (ps,pdf) A3 (ps,pdf)
Solutions: SolA1 (ps,ps:4in1, pdf,pdf:4in1) SolA2 (ps, pdf)
Midterm: past midterm (ps,pdf)
Past Final Exam
Converting a Turing Machine into a RAM program: sample (ps, pdf)
Study/fun links:  Program your own Turing machine. Follow a Turing machine simulation
The Alan Turing home page.
Advice on learning how to write proofs, by Francois Pitt.
The million dolar question: P versus NP, minesweeper and P vs NP
Computational complexity of games and puzzles, by David Eppstein.
Policies:  [Plagiarism| Remarking | Late Assignments| Missed Midterm
Useful links:  SITE,University of Ottawa
University of Ottawa Library
Download a free postscript viewer.

Might want to go to GRADUATE SCHOOL?
If you want to start on the Fall 2004, apply on the Fall 2003 for an NSERC scholarship
(good to be held at any canadian university).
Check out our computer science graduate program.
Fell free to talk to me if you have questions about graduate school.