Announcements | Course information | Important dates | Assignments and tests | Marks | Lecture notes |
Click here for the day section of Winter 2004 CSC364, taught by Alan Borodin
05/05/2004 The very preliminary marks are now posted, together with the marks for the final exam. Please check that all your marks are correct! I am planning to submit the marks no later than Monday, so if you want to talk to me please email me before that. If you don't see your exam mark, then you probably wrote in a different location (two of you are missing the final exam mark). If this is the case, I will try to mark your exam as soon as I can get it.
Old announcements are commented out. If you want to read them, look at the source.
Lectures: W7-9 in BA 1190
Instructor: Antonina
Kolokolova , email: kol@cs, office SF 3204A.
Instructor office hours: Mondays 4-5pm, or by appointment.
Note: By far the best way to contact me is by email. In
case of emergency, you may call the DCS main office at 978-6025.
Tutorials: W6
Your tutorial is determined by the first letter of your last name:
A-L: BA 2130, Phuong The Nguyen
M-Z: BA 1190, Tsuyoshi Morioka
No textbook is required for the course. See lecture notes below.
There are two recommended texts:
Problem Set 1. Due Jan 28, 2004. | Solutions to Problem Set 1. | Solutions to Term Test 1. |
Problem Set 2. Due Mar 1, 2004 | Solutions to Problem Set 2. | Solutions to Term Test 2. |
Problem Set 3. Due Apr 2, 2004 | Solutions to Problem Set 3. | Solutions to Term Test 3. |
Click here to see your marks.
Policy on collaboration: The work you submit must
be your own. You may discuss problems from assignments with each
other; however, you should prepare written solutions alone.
Plagiarism is a serious academic offense and will be dealt with
accordingly.
Lecture Notes and tentative course outline
Viterbi Algorithm tutorial notes
Flow Example This is an example
in which the Ford-Fulkerson algorithm does not terminate.
Turing machine simulator
Million dollar problem (Click on P vs NP)