CMSC 351 Algorithms, Fall 2010

[Description] [Information] [Homework] [Practic Exam] [Announcement] [Others]

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. Syllabus

General Information

Instructor
- Clyde Kruskal (kruskal@cs)
Time/Location
- Section 0101: TuTh 9:30am-10:45am @ CSI 2117
- Section 0201: TuTh 12:30pm-1:45pm @ CSI 1115
Textbook
- Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001). Introduction to Algorithms (2nd ed.). MIT Press and McGraw-Hill
Teaching Assistant
- Sravanthi Bondugula (sravb@cs)
- Hsueh-Chien Cheng (cheng@cs)
Office Hour (AVW 1112)
MoTuWeThFr
10:00-11:00Hsueh-ChienSravanthiHsueh-Chien
11:00-12:00Sravanthi
14:00-15:00Hsueh-Chien
15:00-16:00Sravanthi

Homework

*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.

Practice Exam

Midterm: Information Exam1 Exam2

Final: Information Exam

Announcement

Others

Valid HTML 4.01 Strict