This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CMSC 351: Algorithms Fall 2011 Instructor: Clyde Kruskal. Office: AVW 3215. Office phone: 301-405-2683. E-mail: [email protected] . Office hours: Tuesday 2:00–4:30pm Also by appointment. Teaching Assistants: Yuk Hei Chan (Tom). Email: [email protected] Office hours: Monday 3:30pm–5:30pm and Tuesday: 4:30pm–5:30pm Catalin Stefan Tiseanu Email: [email protected] Office hours: Tuesday 2:30pm–4:30pm and Thursday 2:30pm–3:30pm Course Overview: This course presents an introduction to the techniques for designing efficient com- puter algorithms and analyzing their running times. General topics include asymptotics, solving summations and recurrences, algorithm design techniques, analysis of data structures, and intro- duction to NP-completeness. Recommened Text: Thomas Cormen, Charles Leiserson, Ron Rivest, and Clifford Stein, Introduction to Algorithms , McGraw Hill and MIT Press, Third Edition, 2009....
View Full Document
This note was uploaded on 01/13/2012 for the course CMSC 351 taught by Professor Staff during the Fall '11 term at University of Louisville.
- Fall '11