CMSC 351 Algorithms, Fall 2010
[Description]
[Information]
[Homework]
[Practic Exam]
[Announcement]
[Others]
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
- 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)
| Mo | Tu | We | Th | Fr |
| 10:00-11:00 | Hsueh-Chien | | Sravanthi | | Hsueh-Chien |
| 11:00-12:00 | | | Sravanthi | | |
| 14:00-15:00 | | | Hsueh-Chien | | |
| 15:00-16:00 | Sravanthi | | | | |
| *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
Exam1
Exam2
Final:
Information
Exam
- (10/5): The class of section 0201 on 10/7 will be in room 2117
- (10/5): Midterm exam is scheduled on 10/27 5:00-7:00pm at PHY1412
- (11/13): Final exam is scheduled on 12/15 4:00-6:00pm
- (12/9): Here is a short summary of the homework assignments. Also,
please complete the course evaluation.
- (12/10): Final exam is scheduled on 12/15 4:00-6:00pm at CHM1407
Web Accessibility