CSC373 Home Page (Fall 2004)

Announcements for week of December 13.

I have placed a solution set for term test 3 below. The graded assignment 3 and term test 3 papers will be returned to the CSSU office as soon as they are available. Good luck on the final exam. Previously (in CSC364) we used the flow network formalization as in CLRS and followed their presentation in our abbreviated lecture notes on flows. Or click here for a pdf file for flow notes.

The University of Toronto's Professional Experience Year (PEY) is your opportunity to turn classroom knowledge into valuable work experience. By taking part in the PEY program, you can gain meaningful work experience, clarify your career path, build industry contacts and make money. Lasting between 12 to 16 months, a PEY internship gives you more time and opportunity to gain all the advantages a work placement can offer. See http://www.peyonline.com for more details. Note that PEY is hosted by the Faculty of Engineering, but computer science students are active participants. Last year, nearly 50 studnets went out on PEY, earning an average annual salary of $38,000. This info session will be geared specifically to computer science students.

This page provides general course information and access to various documents concerning CSC373. Lectures are held Wednesdays and Fridays at 12 PM and the tutorials take place Thursdays at 11 AM. The first lecture is Friday, September 9 and the first tutorial is Thursday, September 15. 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:

Borodin

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: October 6, November 3, December 1.

Term Tests: October 7, November 4, December 2.

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

Problem Set 2 in ps format

Problem Set 2 in pdf format

Problem Set 3 in ps format

Problem Set 3 in pdf format