CME 305: Discrete Mathematics and AlgorithmsInstructor: Reza ZadehWinter 2017 Time: Tue, Thu 10:30 AM  11:50 AM Room: Bishop Auditorium Topics Covered
Course DescriptionThis course is targeting doctorate students with strong foundations in mathematics who wish to become more familiar with the design and analysis of discrete algorithms. An undergraduate course in algorithms is not a prerequisite, only familiarity with basic notions in linear algebra and discrete mathematics.
Required textbook:
Midterm: Thursday, Feb 16th Assignments
ReferencesNote that these references are not intended to be any substitute for the material covered during lectures.
Practice ExamsSpring 2012 Qual pdf. Fall 2012 Qual pdf. Spring 2013 Qual pdf. 2016 Midterm pdf, Solutions pdf 2015 Midterm pdf, Solutions pdf 2014 Midterm and Solutions pdf, 2011 Midterm pdf, Solutions pdf. 2010 Midterm pdf, Solutions pdf. Practice Midterm 1 (InClass) pdf, Solutions pdf. Practice Midterm 2 (InClass) pdf, Solutions pdf. Problem SessionsProblem Session 3/20/17, 2 Solutions Problem Session 2/15/17 SolutionsProblem Session 2/14/17 Solutions
Problem Session 2/11/15 and Solutions Problem Session 2/10/15 and Solutions Problem Session 2/10/14 and Solutions Problem Session 2/20/14 and Solutions Previous yearsWinter 2016: Class website Winter 2015: Class website Winter 2014: Class website 
