CSC364 Home Page for Daytime Section (Spring 2004)

Announcements for week of May 10

Click here to see your final marks.
Please contact me immediately (by noon Wednesday, May 12) if you detect any grades which have not been properly recorded. Assignment 3 and Term Test 3 are still avialable at my office (SF2303B) during this week. The graders for assignment 3 and test 3 have provided a list of common errors/points deducted for assignment 3 and for test 3 .

I am available (by appointment) for office hours thorughout the period preceding the final exam. You can also take your chances and drop in but I can't guarantee my schedule during the next few weeks. You are allowed one page of handwritten notes for the exam. The exam will contaoin a list of some NP-complete problems and some undecidable languages.

This page provides general course information and access to various documents concerning CSC364 for the (MW 2PM) lecture section. Lectures are held Monday and Wednesday at 2PM and the tutorials takes place Friday at 2PM. For the month of January, tutorial assignments (by day of birth) are as follows: Jan 1 - April 30 in MP202, May 1 - Aug 31 in UC144, Sept 1 - Dec 31 in UC52. Please send any comments or questions to the instructor:
The home page for the
  • evening section
    • can be found here.
    The following grading scheme will be used for this course: 3 assignments (worth 5% each), 3 term tests (closely related to the assignments and worth 15% each) and a final 3 hour exam worth 40%. As will be discussed in class, every (sub) problem in any assignment or test will be worth some multiple of 5 points. You will receive 1/5 points for any (sub) problem for which you state "I do not know how to answer this question". You will receive .5/5 if you leave a question blank. If instead you submit irrelevant or erroneous answers you will lose the 1/5 points. That is, you will receive some credit for knowing what you don't know. You can also receive some additional credit for partial work that is clearly "on the right track". Even if the assignments are worth only 5% each, you are still obliged to submit your own work. In our first lecture, I gave a pragmatic definition for distiguishing between genuine learning together and plagarism. If you have any questions please see the instructor now! Any cases of plagarism will be reported to the Faculty.
    Sschedule for assignments and term tests: Assignments are due at the start of the lecture held on the indicated date. I will answer questions about the assignments as soon as the assignments are submitted and hence I will not accept late assignments.
  • Assignments: Jan 28, March 3, March 31.
  • Tests: Jan 30, March 5, April 2.
    • There is no official required text for this course as we will be using some lecture notes. However, Introduction to Algorithms (second edition) by Cormen, Leiserson, Rivest and Stein (CLRS) is being used in CSC378 and it is a very useful text to have. Here are the free
  • lecture notes
    • that have been used previously in CSC364 and CSC366. These lectures notes will occasionally be modified as typos are discovered and/or to reflect new examples, etc. It is therefore adviseable that you only print the notes that you are presently using. Another comparable text is ``Algorithmics: Theory and Practice" by Brassard and Bratley. Both the CLRS textbook and the Brassard and Bratley textbook emphasize algorithmic design and some compexity theory but do not cover computability theory. Another recommended text therefore is ``Introduction to the Theory of Computation'' by Sipser which emphasizes computability and complexity theory but does not cover algorithmic design. I also suggest Harel's Book ``Algorithmics'' as a gentle and well written introduction to NP-Completeness and Computability. And if you need some more motivation for this course, then consider
  • how to get rich quick.
    • and its discussion of the P vs NP problem.

    Problem Sets, Tests and Other Handouts.
  • Problem Set 1 in ps format
  • Problem Set 1 in pdf format
  • Problem Set 2 in ps format
  • Problem Set 2 in pdf format
  • Problem Set 3 in ps format
  • Problem Set 3 in pdf format
  • Test 1 in ps format
  • Test 1 in pdf format
  • Test 2 in ps format
  • Test 2 in pdf format
  • Test 3 in ps format
  • Test 3 in pdf format