CSC375 Home Page (Winter 2006)

IMPORTANT NOTE: I allow one page (double-sided) handwritten notes as an aid in all my tests and exams.

Announcements for week of May 8. I have graded the final exams and have computed final grades. I will be submitting these grades to the Department Office which then gets sent to the Faculty office. The grades are not official untl approved by the Department and Faculty. If you email me, I will send your complete set of grades including your unofficial final grade for the course. I want to correct an incorrect statement I think I made regarding Max2SAT (or MaxSat). Namely, I may have said that this problem was #P complete but in fact it is "just" NP-hard and given our current beliefs cannot be #P complete. #P problems essentially count the number of certificates and in general this number is exponential in the length of the input. Even if P = NP, there is no reason to believe we could exactly compute the output of a #P complete problem in polynomial time. But it is easy to see that if P = NP we could polynomial time compute the maximum number of satisfiable clauses. As I mentioned in class there is a known hardness of approximation (approximately .95) result known for Max2SAT and 7/8 for Max3SAT.

Students are encouraged to check the undergrad announcements (UGA) website which contains announcements about things such as job and scholarship opportunities, academic and social events, and reminders of administrative deadlines.

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 9 and the first tutorial is Friday, January 11. 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: February 1, March 8, April 5.
  • Term Tests: February 3, March 10, April 7.
    • Here are the free
  • lecture notes
    • that have been used previously in CSC364 and CSC366.

    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.

    Problem Sets, Tests and Other Handouts will be posted here.
  • Problem set 1 in ps format
  • Problem set 1 in pdf format
  • The obvious interval covering algorithm in ps format
  • The obvious interval covering algorithm in pd f format
  • One pass algorithm for weighted (job) interval scheduling in ps format
  • One pass algorithm for weighted (job) interval scheduling in pdf format
  • Interval cover algorithm in ps format
  • Interval cover algorithm in pdf format
  • Problem set 2 in ps format
  • Problem set 2 in pdf format
  • Uri Zwick paper (in ps format) showing a non-terminating example for the generic FF max flow algorithm
  • Overview of Dinic's algorithm (in ps format)
  • Overview of Dinic's algorithm (in pdf format)
  • Problem set 3 in ps format
  • Problem set 3 in pdf format
  • IP for scheduling problem (in ps format)
  • IP for scheduling problem (in pdf format)