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.
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.
Course Information
Instructors
- Howard Elman (elman@cs.umd.edu), Office 3125 AV Williams
- Clyde Kruskal (kruskal@cs.umd.edu), Office 3215 AV Williams
Piazza
- We will be using piazza for announcements and discussions. Please register yourself on Piazza. You can ask private questions (only instructor and TAs can see) or ask/reply anonymously. However DO NOT post your answer and ask if it is correct. If in doubt, ask private question or come during office hours.
Books
- Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2009). Introduction to Algorithms (3rd ed.). MIT Press (Any edition is fine)
- Parberry and Gasarch. Problems on Algorithms (free with small suggested donation)
Teaching Assistants
- Soheil Ehsani (soheilehsani@gmail.com)
- Sheng Yang (yangsheng6810@gmail.co)
- Yoav Segev (segev@cs.umd.ed)
- Peter Sutor psutor@umd.edu
- Roozbeh Yousefzadeh (roozy@umd.edu)
- Phong Dinh (dinh@umd.ed)
Midterm Exam
- Wednesday, November 4, 6-8PM
- The exam will take place in two rooms: 0126 Armory, for students with last names beginning with A through L
0226 H. J. Patterson, for students with last names beginning with M through Z
Final Exam
- Wednesday, December 16, 4-6PM
- The exam will take place in three rooms: Section 101: 1412 Physics (old building, near "M")
Section 201: 0106 Francis Scott Key
Section 301: 0200 Skinner
Syllabus
Office Hours
- Howard Elman: Mon,Thu 11:00AM - 12:00PM
- Clyde Kruskal: Tue,Thu 2:00PM - 3:30PM
- Soheil Ehsani: Wed 9:30AM - 11:00AM, 3:30PM - 5:00PM
- Yoav Segev: Thu 2:00PM - 3:30PM
- Peter Sutor: Wed 1:00PM - 2:30PM
- Sheng Yang: Mon 1:00PM - 4:00PM
- Roozbeh Yousefzadeh: Thu 3:30PM - 5:00PM
- Phong Dinh: Wed 5:00PM - 6:30PM
Class Resources
- Upper bound on harmonic sum: Harmonic sum
- Growth Charts: Chart 1 Chart 2
- Introductory Slides
Online Resources
- David Mount's Lecture Notes
- CMSC351 Spring Spring 2011 Reference Pages
- Pseudo code for Heap sort