Course Materials

Textbook (optional)

Introduction to Algorithms by Cormen, Leiserson, Rivest, Stein. 3rd edition or later recommended.

Course Objectives

Upon the completion of this course, students will be able to:

• Understand the implementation of common randomized algorithms.
• Analyze common algorithms for correctness and running time in the presence of randomness.
• Apply mathematical techniques to understand optimality of algorithms.
• Evaluate an algorithm’s performance characteristics against use-case requirements.
• Create new analyses of algorithms using knowledge from the standard topics studied in class.
• Produce a written report which summarizes findings in a research paper.
• Give a presentation in class on a topic that we study.

Grading Policy

• The late policy is at the instructor’s discretion, do not expect late work to be graded.
• Exam rescheduling or retakes are only allowed under special circumstances with appropriate documentation.

Assessment details

The standard grade boundaries will be used by default, though the instructor reserves the right to modify the grade boundaries slightly.