Section | 1 |
---|---|

Instructor(s) | Brady, Geraldine (gb52) |

Location | RY 251 |

Meeting Times | Thursday 5:30pm - 8:30pm |

Website: | http://people.cs.uchicago.edu/~brady/MPCS55001/ |

Fulfills | Core Theory |

****This course can not be taken in your graduating quarter****

Course Description

The course is an introduction to the design and analysis of efficient algorithms, with emphasis on developing techniques for the design and rigorous analysis of algorithms rather than on implementation. Algorithmic problems include sorting and searching, discrete optimization, and algorithmic graph theory. Design techniques include divide-and-conquer methods, dynamic programming, greedy methods, graph search, as well as the design of efficient data structures. Methods of algorithm analysis include asymptotic notation, evaluation of recurrences, and the concepts of polynomial-time algorithms. NP-completeness is discussed at the end the course. Students who complete the course will have demonstrated the ability to use divide-and-conquer methods, dynamic programming methods, and greedy methods, when an algorithmic design problem calls for such a method. They will have learned the design strategies employed by the major sorting algorithms and the major graph algorithms, and will have demonstrated the ability to use these design strategies or modify such algorithms to solve algorithm problems when appropriate. They will have derived and solved recurrences describing the performance of divide-and-conquer algorithms, have analyzed the time and space complexity of dynamic programming algorithms, and have analyzed the efficiency of the major graph algorithms, using asymptotic analysis.

**Course Contents**

Topics covered include: sorting and searching; divide-and-conquer; dynamic programming; graph search; shortest paths; minimum spanning trees; network flow; hashing and binary search trees, as time permits. NP-complete problems are discussed at the end of the course.

**Coursework**

Lectures: Students are responsible for all material presented in lectures.

Problem sessions: Weekly problem sessions are held on Saturdays. Homework, quiz, and exam problems are reviewed and discussed at problem sessions. Attendance at problem sessions is strongly recommended for all students.

Homework: Students are responsible for material covered in homework assignments. Homework is assigned after class each week and is due the day before class the following week. Students are required to submit homework electronically.

Exams: There are four quizzes (weeks 3, 4, 9, and 10), a midterm exam (week 5), and a final exam (week 11). There will be no make-up exams.

**Course grade**

The course grade is based on homework and exams:

- Homework: 5%.
- Quizzes: 20% (5% for each of 4 quizzes).
- Midterm: 25%.
- Final: 50%.

**Textbook**

Introduction to Algorithms (Third Edition) by T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein (ISBN 978-0-262-03384-8).

Immersion math (MPCS 50103) or placement.

Immersion programming (MPCS 50101); or core programming (MPCS 51042, 51036, or 51040); or instructor consent.

This class is scheduled at a time that conflicts with these other classes:

- MPCS 53001-1 -- Databases
- MPCS 52040-1 -- Distributed Systems
- MPCS 56512-1 -- Application Security