CMSC 351 Algorithms, Summer 2012

[Description] [Information] [Syllabus] [Homework] [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 AT cs), Office Hour: MWF 10:45am-12:00pm

Teaching Assistant

- Kan-Leung Cheng (klcheng AT cs), Office Hour: TuTh 11:00am-12:30pm @ AVW 1112

Class Time/Location

- Section 0101: MTuWThF 9:30am-10:55am @ CSI 2107

Recommended Text

- Thomas Cormen, Charles Leiserson, Ron Rivest, and Clifford Stein, Introduction to Algorithms, McGraw Hill and MIT Press. Any edition.

Class page on Piazza (for announcements, postings and discussions)

- http://piazza.com/class#summer2012/cmsc351

Syllabus

• Syllabus

Homework

• Homework 0: Due on 6/1 (posted 5/29)
• Homework 1: Due on 6/6 (posted 6/1)
• Homework 2: Due on 6/8 (posted 6/5)
• Homework 3: Due on 6/13 (posted 6/8)
• Homework 4: Due on 6/15 (posted 6/12, updated 6/13)
• Homework 5: Due on 6/20 (posted 6/15)
• Homework 6: Due on 6/22 (posted 6/20)
• Homework 7: Due on 6/27 (posted 6/22)
• Homework 8: Due on 6/29 (posted 6/27)
• Homework 9: Due on 7/5 (posted 6/29)

Exam

• Info Sheet (posted 6/28)

Web Accessibility