Analysis and Design of Algorithms
Analyze the asymptotic performance of algorithms.
Familiarity with an assortment of important algorithms
Ability to analyze time and space complexity
Write rigorous correctness proofs for algorithms.
Demonstrate a familiarity with major algorithms and data structures.
Knowledge of algorithm design strategies
Important Course Notes
Assignments - 20%
Attendance - 10%
Quiz - 10%
Oral Exam - 10%
Midterm Exam - 25%
Projects - 25%
Late assignments and make-up
Assignments submitted after the due date are docked 10% per day and will not be accepted for credit after a week.
Lab & Workshops
Lab Tools: Code::Block