CME 305: Discrete Mathematics and AlgorithmsInstructor: Reza ZadehWinter 2015 Time: Tuesdays and Thursdays 12:50 PM  2:05 PM Room: Building 60 Room 120 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: Date TBA in class Assignments
ReferencesNote that these references are neither required reading for the class nor intended to be any substitute for the material covered during lectures.
ExamsMidterm 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. Spring 2012 Qual pdf. Fall 2012 Qual pdf. Spring 2013 Qual pdf. Problem SessionsProblem Session 2/10/14 and Solutions Problem Session 2/20/14 and Solutions Previous yearsWinter 2014: Class website 
