CSE3101: Design and Analysis of Algorithms -
Final grades have been calculated. Click here
Marks are available here. Please email the instructor ASAP if there is any problem.
Last O.H.: 1:30-2:30pm Thursday August 17 in CSEB2015.
Test 3 will be ready to pick up during the O.H.
Assignment 3 can now be picked up from the department office.
Test 3 is being marked.
Lectures: Tuesday 7-10pm in CB 115.
email: see the instructor's homepage,
Office (on Tuesday afternoon): CSEB 2015, phone: 416 939 3865
For e-mails, please include in the subject ``3101''.
Messages without this header may be ignored.
Office Hours: Tuesday 3-4pm in CSEB 2015.
Or make an appointment, or send a question via email.
Cormen, Leiserson, Rivest, Stein:
Introduction to Algorithm (2nd edition) McGraw-Hill (2001), ISBN: 0-07-013151-1
Jon Kleinberg and Éva Tardos:
Algorithm Design (2006) by Pearson Education, ISBN: 0-321-29535-8
Click here for the course information sheet (.pdf file).
- 3 assignments, due at beginning of class on May 16 (10%), and June 20 and July 18 (15% each)
- 3 closed-book tests worth 20% each in classes on June 6, July 4 and last class.
FAQ for A1
Solution to Q1 and Q2
Comments and stats
FAQ for A2
Comments and average
slides for week 2
slides for week 3
slides for week 4
slides for week 7
slides for week 8
slides for week 10
slides for week 11
slides for week 12
For Activity scheduling/selection click here (called Interval Scheduling)
For the Longest Common Subsequence problem click
For SubsetSum, Knapsack and Scheduling Jobs with Deadlines, Durations and Profits click
For Flow Network:
click here and here.