Please send any comments or questions to the instructor:
I have calculated tentaive grades. I still must reread the exams of students who did not pass the course. In some cases, there are some missing assignments/tests that might make a difference so please check the CDF site for your grades. The exam had 150 points and was graded out of 130. As agreed, for those students (which is most of the class) who did better in the final exam than in term test 2, the grading scheme is to count term test 2 as 10% and the final as 45%. For students whose term test 2 was better than the final exam, the grading scheme will be the initial grading scheme counting term test 2 as 15% and the final exam as 40%. NOTE: Grades are not official until approved by the Faculty.
IMPORTANT: You must save all graded work in case there is any inconsistency in what we have recorded and what you have.
The slides are a reasonably accurate reflection of the course. The text reading assignments thus far (in more or less the order discussed) were the following : Chapter 0 (for motivation and to recall some basic notation and concepts); Chapter 5 (Greedy Algorithms); Chapter 6 (Dynamic Programming); Chapter 7 (sections 7.2 and 7.3); Chapter 8 (starting the week of February 4) Chapter 7 Section 7.1 (during week of March 4) Chapter 9 (for approximation algorithms and local search)
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%. (NOTE: See above comment as to the chnage in the gradin g scheme for those who did better in the final exam than in term test 2.) 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. 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.
IMPORTANT NOTE: I allow one page (double-sided) handwritten notes as an aid in all my tests and exams.
Slides from lectures will be posted here. My slides are just an overview of the lectures and in particular they will usually not contain proofs.
ACKNOWLEDGEMENT: Dai Tri Man Le has helped prepare these slides and the vast improvement over my rough slides from last year is due to him and is greatly appreciated.
Problem Sets, Tests and Other Handouts will be posted here.
You may also find it helpful to look at the problem sets and other handouts for the most recent versions of CSC373 and CSC375 that I have taught.
And here is a link to the fall 2012 course taught by Professor Pitt.
I am providing links here to Professor Allan Jepson's lecture notes and demos used in his Fall 2010 CSC373 class. Many of these documents are password protected. I will provide the password during the first week of lectures.