Polytope generated by Jenn (http://www.math.cmu.edu/~fho/jenn/index.html)


This course presents the fundamental techniques for designing efficient computer algorithms, proving their correctness, and analyzing their running times. We will discuss a number of topics, including greedy algorithms, divide and conquer algorithms, dynamic programming, network flow algorithms, NP completeness and computational intractability, approximation algorithms, and randomized algorithms.

For further information, please see the course syllabus.

General Information

Class TimeTue, Thu 9:30-10:45pm
LocationCSI 1122
Instructor Dave Mount
Email mount@cs.umd.edu
Office AVW 3373
Office HoursMon 2:30-3:30pm, Wed 10:00-11:00am (or send me email to request a time)
Teaching Assistant Amit Chavan
Email amitc@cs.umd.edu
Office AVW 1112
Office Hours Mon 1:30 - 2:30pm, Wed 2:30 - 3:30pm (or send him email to set up a time)


Importance class announcements will be made through Piazza. Once class has started, I'll send invitations to join the system.

Return to CMSC 451 Home  —  Polytope image at top of page by Jenn

Web Accessibility