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)

	Mo	Tu	We	Th	Fr
2:30-3:30		Catalin		Catalin
3:30-4:30	Tom	Catalin
4:30-5:30	Tom	Tom

Syllabus

• Syllabus

Homework

• Homework 0: No submission required
• Homework 1: Due on 9/14 (posted 9/8)
• Homework 2: Due on 9/21 (posted 9/16)
• Homework 3: Due on 9/28 (posted 9/23)
• Homework 4: Due on 10/5 (posted 9/30)
  Typo corrected, noon 1 Oct: if you have download the old version that says "array of size nine" (both problem 1 and 2), change it to "array of size eight". Everything else remain unchanged.
• Homework 5: Due on 10/12 (posted 10/7)
• Homework 6: Due on 10/19 (posted 10/14)
• Homework 7: Due on 10/26 (posted 10/21)
• Homework 8: Due on 11/9 (posted 11/4)
• Homework 9: Due on 11/16 (posted 11/11)
• Homework 10: Due on 11/30 (posted 11/22)
• Homework 11: Due on 12/7 (posted 12/2)
• Challenge Problem: no need to turn in

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