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.
|Class Time||Tue, Thu 9:30-10:45pm |
|Location||CSI 1122 |
|Instructor ||Dave Mount |
|Office Hours||Mon 2:30-3:30pm, Wed 10:00-11:00am (or send me email to request a time) |
|Teaching Assistant ||Amit Chavan |
|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.