Analysis and Design of Algorithms

Information

Course Objectives

• 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

Supplemental Course Texts

• Introduction to the Design and Analysis of Algorithms, By Anany Levitin

• Introduction to Algorithms, By Kevin

Important Course Notes

Class Sessions

• Tuesday from 10:15- 11:45am [AI] @Hall 3.

Office Hours

• Sunday from 8:30am - 1:30pm

Grading Criteria

• 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 

Social Group

• Facebook group