Course Description

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.

General Information


Instructor

Class Time / Venue

Piazza

Midterm

Final

Textbook

Teaching Assistant

Office Hour (AVW 1112)


Monday Tuesday Wednesday Thursday Friday
9:00-10:00 Tom
10:00-10:50 0201 Class 0201 Class 0201 Class
12:30-1:45 0101 Class 0101 Class
2:00-3:00 Melika Emily
3:00-4:00
4:00-5:00 Tom
5:00-6:00

Syllabus

Recent items

Web Accessibility