Additional books on DC library reserve for 3 hour loan: [DPV] Dasgupta, Papadimitriou, and Vazirani, Algorithms (QA9.58 .D37 2008, see also draft version); [KT] Kleinberg and Tardos, Algorithm Design (QA76.9.A43K54 2006); [BB] Brassard and Bratley, Fundamentals of Algorithmics (QA9.58.B73 1996); [GJ] Garey and Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (QA76.6.G35 1979).
To summarize: after reviewing some basics on the mathematical analysis of algorithms, we will devote the lectures to designing efficient algorithms for a variety of interesting problems. These problems are chosen to illustrate a number of useful techniques: divide-and-conquer, greedy, dynamic programming, etc. In particular, we will discuss a few favorite graph algorithms. We will also encounter a number of important "hard" problems, and prove that they are hard via the theory of NP-completeness. At the end, we will even see some problems that are not solvable at all...
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 this link 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" or group work/collaboration should seek guidance from the course professor, academic advisor, or the undergraduate associate dean. 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.