Algorithms (Section 1)
Title  Algorithms (Section 1) (550011) 

Quarter  Winter 2021 
Instructor  Geraldine Brady (gb52@uchicago.edu) 
Website  http://people.cs.uchicago.edu/~brady/MPCS55001/ 
Syllabus  *This course will be conducted remotely and will be online only for Winter 2021*
The course is an introduction to the design and analysis of efficient algorithms, with emphasis on developing design techniques. Algorithmic problems include sorting and searching, discrete optimization, and algorithmic graph theory. Design techniques include divideandconquer methods, dynamic programming, greedy methods, as well as the design of efficient data structures. Methods of algorithm analysis include asymptotic notation, evaluation of recurrences, and the concepts of polynomialtime algorithms. NPcomplete problems and reductions are discussed at the end the course. Coursework Course grade
Introduction to Algorithms (Third Edition) by T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein (ISBN 9780262033848) 
Prerequisites (Courses)  MPCS 50103 Discrete Math (Immersion Math) OR a passing score on the Mathematics Placement exam.

Prerequisites (Other)  
Satisfies  Core Theory 
Time  Tuesday 2:40pm  4:40pm 
Location  Online Only 