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:45am |
|Location||CSI 1122 |
|Instructor ||Dave Mount |
|Office Hours||Mon 1:30-2:30pm, Wed 2:30-3:30pm (or send me email to request a time). I'm teaching two courses this semester. Students from 451 will have priority for the first half hour and those from 427 will have priority for the second half hour. If things get busy, I'll extend these.|
|Teaching Assistant ||Xiao Wang |
|Office Hours|| Mon 12:30-1:30pm, Wed 9:30-10:30am (or send him email to arrange a time)|
Importance class announcements will be made through Piazza. Once class has started, I'll send invitations to join the system.