CSC375 Home Page (Winter 2005)


Announcements for week of May 9

I have the grades for CSC375. Rather than posting them, since this is such a small class I will give you your grade if you email me.

Here follows an enquiry concerning a 4 month job that seems appropriate for any 375 student.

Date: Tue, 12 Apr 2005 13:44:44 -0400 From: Ivy Fong . Veridicom International Inc. is interested in identifying a Comp. Sci student with strengths in algorithm development, pattern recognition, C++, etc for employment. Employment would be for approximately 4 months and would commence immediately.


This page provides general course information and access to various documents concerning CSC375. Lectures are held Mondays and Wednesday at 2 PM and the tutorials take place Fridays at 2 PM. The first lecture is Monday, January 3 and the first tutorial is Froday, January 7. Weekly announcements for the course will be posted on this web site. As the required text, we will use the lecture notes "Algorithm Design" by Jon Kleinberg and Eva Tardos (which are being developed into a textbook) and the lecture notes are available at the bookstore. The text "Introduction to Algorithms" (second edition) by Corman, Leiserson, Rivest and Stein is an additional good reference. Another comparable text is ``Algorithmics: Theory and Practice" by Brassard and Bratley. More information is contained in the brief course syllabus . Please send any comments or questions to the instructor:

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 will give a pragmatic definition for distiguishing between genuine learning together and plagarism. If you have any questions please see the instructor immediately! Any cases of plagarism will be reported to the Faculty. Here is some further information on how not to cheat .
Schedule 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: January 26, March 2, March 30.
  • Term Tests: January 28, March 4, April 1.

  • Here are the free
  • lecture notes
  • that have been used previously in CSC364 and CSC366.

    Problem Sets, Tests and Other Handouts will be posted here.
  • Problem set 1 in ps format
  • Problem set 1 in pdf format
  • One pass algorithm for WJISP in ps format
  • One pass algorithm in pdf
  • Problem set 2 in ps format
  • Problem set 2 in pdf format
  • Problem set 3 in ps format
  • Problem set 3 in pdf format