CS 466/666: Design and Analysis of Algorithms, Spring 2014
link to S13 web page
David R. Cheriton School of Computer Science
Contents:
General Info,
Organization,
Announcements,
Resources,
Assignments,
Lectures,
University Policies
General Information
- Course Description:
Advanced design and analysis of algorithms.
Topics include: amortized analysis, randomized algorithms, lower bounds, approximation algorithms, and on-line algorithms.
- Objectives:
To learn more about algorithms and how to analyze them.
- Calendar
Description - Official course description from academic calendar.
- Handbook
Description - Longer course description from Computer Science Undergraduate Handbook.
Instructor:
Ian Munro,
DC2343, x34433, imunro "at" uwaterloo.ca
Time and Place:
Tuesday, Thursday 10-11:30 RCH 306
TAs:
- Yizhe Zeng (DC 2555A but this will change) y29zeng "at" uwaterloo.ca
- Vinayak Pathak (DC 3322) vpathak "at" uwaterloo.ca
General Office Hours (changes for specific weeks will be posted on Piazza):
- Ian Munro, Tuesday and Thursday immediately after class i.e. 11:20-12:20, DC 2343
- Yizhe Zeng, some weeks, Fridays 11-12 and 1-2, in the Tutorial Centre on 4th floor of MC
- Vinayak Pathak the other weeks, Fridays 11-12 and 1-2, DC 3322
Credit:
CS 466
- (small) Written assignments (small, no programming, about 10 assignments), 25%
- Midterm exam, 25% (June 24 in class)
Sample Midterm
- Final exam, 50%
CS 666
- as for CS 466, marks *.75
- project, 25%. The project description is here.
Also Piazza which we will use instead of a newsgroup.
Note the office hours before the final as given above; also that assignments can be picked up from the CS receptionist.
Books:
The main text for this course is Cormen, Leiserson, Rivest, and Stein (see below).
It covers most of the necessary material though by no means all;
it is also used as a text for CS 341 and so many students will have it already.
The following references are
in the DC library.
-
[CLRS] Cormen, Leiserson, Rivest, and Stein, Introduction to Algorithms (3rd ed.), MIT Press,
2009 (QA76.6 .C662 2009). (on-reserve in the DC library)
You can also use the 2nd edition, which is available electronically through the
library.
- [MR] Motwani and Raghavan, Randomized Algorithms,
Cambridge University Press, 1995 (QA274.M68) [MR]
- [MU] M. Mitzenmacher and E. Upfal, Probability and Computing,
Cambridge University Press, 2005 (QA274 .M574 2005)
- [V] Vazirani, Approximation Algorithms,
Springer-Verlag, 2001 (QA76.9.A43 V39)
- [H] D.S. Hochbaum, ed., Approximation Algorithms
For NP-Hard Problems, PWS, 1997 (T57.7.A68)
- [BE] Borodin and El-Yaniv, Online Computation and Competitive
Analysis, Cambridge University Press, 1998 (QA76.9.A43 B67)
Other web resources:
The work you hand in must be your own. Acknowledge any sources you have used.
You may discuss the assignment questions verbally with others, but you
should come away from these discussions with no written or electronic records.
Write your solutions in your own words, from your own head.
Please include a cover page for your assignment with your name and student number. The TAs will use the cover page to write your marks.
Hand in your assignment to the assignment boxes
on the 4th floor of MC across from the tutorial centre.
Assignments will be due on Mondays at noon, unless an explicit exception is made such as after a long weekend.
Late assigments will not be accepted.
Assignments will be available here on the web page and will be handed back in class.
Questions regarding the marking of any assignment must be dealt with within 10 days of the marked assignment being available. See the TA who marked it.
We hope to hand assignments back in the Thursday class after they are handed in. As TA office hours are the next day, the plan is for the TA to have unclaimed assignments with him during that time.
Assignment 1 Due Tuesday May 20, as May 19 is a holiday. Yizhe will have office hours on both Friday May 16 and 23, and will mark.
Assignment 2 Due Monday May 26. Yizhe will have office hours on both Friday May 23 and 30, and will mark.
Assignment 3 Due Monday June 2. Yizhe will have office hours on both Friday May 30 and for at least 1 hour on June 6, and will mark.
Assignment 4 Due Monday June 9. Yizhe will have office hours in the Tutorial Centre, and will mark.
Assignment 5 Due Monday June 16. Yizhe will have office hours in the Tutorial Centre, and will mark.
Assignment 6: Do Problem 34-3 "Graph Coloring" from CLRS (all 6 parts "a through f") Due July 7. Vinayak will have office hours DC 3322 on July 4 and will mark.
Assignment 7: Do Problem 35-7 "An Approximation Algorithm for the 0-1 Knapsack Problem" from CLRS (all 5 parts "a through e") Due July 14. Vinayak will have office hours DC 3322 and will mark.
Assignment 8 Due Monday July 21. Vinayak will have office hours on Friday July 18 in DC 3322, and will mark.
The midterm will be held in class on June 24. (Clearly therass room is not large enough to reasonable handle
everyone ... but we have RCH 307 as well)
The time and location of the final exam will be announced.
See the official schedule.
The exam covers the whole course.
Here is a sample exam --- note it was given a few years ago by another professor, some of the material covered in that version of the course differs from what we did, but it might be helpful anyway.
Academic Integrity: In order to maintain a culture of academic integrity, members of the University of Waterloo community are expected to promote honesty, trust, fairness, respect and responsibility.
[Check www.uwaterloo.ca/academicintegrity for more information. ]
Grievance: A student who believes that a decision affecting some aspect of his/her university life has been unfair or unreasonable may have grounds for initiating a grievance. Read Policy 70 - Student Petitions and Grievances, Section 4. When in doubt please be certain to contact the department's administrative assistant who will provide further assistance.
Discipline: A student is expected to know what constitutes academic integrity to avoid committing academic offenses, and to take responsibility for his/her actions. A student who is unsure whether an action constitutes an offense, or who needs help in learning how to avoid offenses (e.g., plagiarism, cheating) or about “rules” for group work/collaboration should seek guidance from the course professor, academic advisor, or the Undergraduate Associate Dean. When misconduct has been found to have occurred, disciplinary penalties will be imposed under Policy 71 – Student Discipline. For information on categories of offenses and types of penalties, students should refer to Policy 71 - Student Discipline. For typical penalties check Guidelines for the Assessment of Penalties.
Appeals: A decision made or penalty imposed under Policy 70, Student Petitions and Grievances (other than a petition) or Policy 71, Student Discipline may be appealed if there is a ground. A student who believes he/she has a ground for an appeal should refer to Policy 72, Student Appeals.
Note for students with disabilities: The Office for Persons with Disabilities (OPD), located in Needles Hall, Room 1132, collaborates with all academic departments to arrange appropriate accommodations for students with disabilities without compromising the academic integrity of the curriculum. If you require academic accommodations to lessen the impact of your disability, please register with the OPD at the beginning of each academic term.