MWF, 09:30AM-10:20AM
Margaret Morrison Carnegie Hall (MM) A14

Course Description

The objective of this course is to study general computational problems and their algorithms. We will focus on the principles used to design these algorithms, prove their correctness, and analyze their complexity. Efficient data structures will be discussed to support these algorithmic concepts. Topics include: Run time analysis, divide-and-conquer algorithms, dynamic programming algorithms, network flow algorithms, linear and integer programming, large-scale search algorithms and heuristics, efficient data storage and query, and NP-completeness. This course is not a programming course. Instead, it will focus on the design and analysis of algorithms for general classes of problems.

Course Materials

• Lecture slides, homework announcements, and discussions: Piazza [Signup Link]
• Submitting homework assignment: Canvas

Course Syllabus

• See the Syllabus on Piazza

Instructor

• Jian Ma, Associate Professor, School of Computer Science
  
  Office: GHC 7705

Textbook

• Algorithm Design, by Jon Kleinberg and Éva Tardos

Contact TAs

• Please use Piazza