Outcomes

Course Outcomes

1. Explain the need to analyze algorithms before writing a computer program
2. Analyze an algorithm's efficiency
3. Compare efficiencies of algorithms and choose the best for a particular problem
4. Discuss and implement greedy algorithms
5. Discuss and implement graph theoretic algorithms
6. Discuss and implement divide and conquer algorithms
7. Discuss distributed algorithms
8. Recognize and implement polynomial time algorithms
9. Recognize and discuss NP-Complete algorithms
10. Develop and implement approximation algorithms
11. Use standard asymptotic notations dealing with efficiencies of algorithms
12. Develop mathematical proofs by induction
13. Develop mathematical proofs by contradiction
14. Disprove false claims by counter-example
15. Solve recurrences

Revised Spring 2012.