CMSC 3140 Analysis of Algorithms

Outcomes

Course Outcomes

Explain the need to analyze algorithms before writing a computer program
Analyze an algorithm's efficiency
Compare efficiencies of algorithms and choose the best for a particular problem
Discuss and implement greedy algorithms
Discuss and implement graph theoretic algorithms
Discuss and implement divide and conquer algorithms
Discuss distributed algorithms
Recognize and implement polynomial time algorithms
Recognize and discuss NP-Complete algorithms
Develop and implement approximation algorithms
Use standard asymptotic notations dealing with efficiencies of algorithms
Develop mathematical proofs by induction
Develop mathematical proofs by contradiction
Disprove false claims by counter-example
Solve recurrences

Revised Spring 2012.