This course presents an introduction to the techniques for designing efficient computer algorithms and analyzing their running times. General topics include asymptotics, solving summations and recurrences, algorithm design techniques, analysis of data structures, and introduction to NP-completeness.
|09/07||no class (labor day)|
|Monday||Jie: 12:00 PM - 2:00 PM|
|Tuesday||Eric: 10:00 AM - 11:00 AM|
|Wednesday||Ishat: 1:00 PM - 5:00 PM|
|Thursday||Eric: 10:00 AM - 11:00 AM|
|Friday||Jie: 11:00 AM - 1:00 PM,
Ksenia: 1:00 - 3:00 PM
Click the name of an assignment below to see its specifications.
|Homework 0||Sep. 04, 2020|