[Description] [Information] [Syllabus] [Homework] [Practice Exam]
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.
|*If you did submit your homework but cannot find your grade in the system, this is probably because we cannot recognize your name. Please contact TA on this matter.|
Midterm: Information sheet provided for the exam (posted 10/30), Exam1 (posted 10/25)
Final: Exam (posted 12/9)