Computer Science 3711: Algorithms and Complexity (Winter 2003)

Instructor	Office	Office Hours	Lectures
Todd Wareham harold@cs.mun.ca	EN-2014 737-7511	Tue/Thu, 2-3pm Wed, 2-4pm	Tue, 3:30-4:45pm Thu, 3:30-4:45pm EN-4035

• Course outline
• Course diary
• Assignments
• Midterm exam answers [PDF/ PostScript]
• Course marks (assignments/tests) (as of 1:35pm, Apr 22)

• Home pages for previous offerings of this course:
  • Fall 2002 (Wang)
  • Winter 2002 (Wareham)
  • Winter 2001 (Wareham)

Notices:

• Apr 14, 3:15pm
  Error fixed in answers to final exam (W'02) for Question #5, parts (a.i) and (a.iv); this is related to the fact that NP-hardness (and not necessarilly NP-membership (and hence completeness)) passes forwards along many-one polynomial-time reductions (thanks go to Adam Leung for pointing out these errors).

• Apr 14, 3:15pm
  Error fixed in answers to Assignment #5 in Question #3, parts (b) and (d); was using vertex s as source vertex for Bellman-Ford algorithm instead of vertex y (thanks go to Abul Khair Shafaet Ali for pointing out these errors).

• Apr 11, 3:40pm
  Answers posted for Assignment #5.

• Apr 7
  
  • Final exam notes posted here (2:15pm)
  • Answers posted for Assignment #4 (2:25pm).

• Mar 26, 8:15am
  Answers posted for Assignment #3.

• Mar 25, 11:30am
  Assignment #5 posted.

• Mar 12, 11:30am
  Assignment #4 posted.

• Mar 11, 11:35am
  Answers posted for midterm exam.

• Mar 3
  
  • Midterm exam notes posted here (9:15am)
  • Answers posted for Assignment #2 (11:20am).

• Feb 20, 2:10pm
  Answers posted for Assignment #1.

• Feb 19, 10:15am
  Assignment #3 posted.

• Jan 30, 5:15pm
  Assignment #2 posted.

• Jan 13, 1:00pm
  Assignment #1 posted.

• Oct 29, 2:50pm
  Open for business!

Created: November 28, 2002
Last Modified: April 22, 2003