CMSC 351 Algorithms, Fall 2011

[Description] [Information] [Syllabus] [Homework] [Practice Exam]

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
- Clyde Kruskal (kruskal@cs)
Time/Location
- Section 0201: MW 2:00pm-3:15pm @ CSI 3117
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
- Catalin Stefan Tiseanu (ctiseanu@gmail.com)
- Yuk Hei Chan (Tom) (yhchan@cs)
Office Hour (AVW 1112)
MoTuWeThFr
2:30-3:30CatalinCatalin
3:30-4:30TomCatalin
4:30-5:30TomTom

Syllabus

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 sheet provided for the exam (posted 10/30), Exam1 (posted 10/25)

Final: Exam (posted 12/9)

Valid HTML 4.01 Strict

Web Accessibility