Course Number
705.621
Next Offered
Spring 2025
Location
Online
Course Format
Asynchronous Online

This course concentrates on the design of algorithms and the rigorous analysis of their efficiency. Topics include the basic definitions of algorithmic complexity (worst case, average case); basic tools such as dynamic programming, sorting, searching, and selection; advanced data structures and their applications (such as union-find); graph algorithms and searching techniques such as minimum spanning trees, depth-first search, shortest paths, design of online algorithms and competitive analysis.

Course Offerings

Open

Introduction to Algorithms

705.621.81
08/26/2024 - 12/10/2024
Notes: This course contains content produced by faculty members other than the listed instructors including: Dr. Michael Dinitz.
Semester
Fall 2024
Course Format
Asynchronous Online
Location
Online
Cost
$5,270.00
Course Materials
Open

Introduction to Algorithms

705.621.82
08/26/2024 - 12/10/2024
Notes: This course contains content produced by faculty members other than the listed instructors including: Dr. Michael Dinitz.
Semester
Fall 2024
Course Format
Asynchronous Online
Location
Online
Cost
$5,270.00
Course Materials
Open

Introduction to Algorithms

705.621.83
08/26/2024 - 12/10/2024
Notes: This course contains content produced by faculty members other than the listed instructors including: Dr. Michael Dinitz.
Semester
Fall 2024
Course Format
Asynchronous Online
Location
Online
Cost
$5,270.00
Course Materials
Open

Introduction to Algorithms

705.621.81
01/21/2025 - 05/06/2025
Semester
Spring 2025
Course Format
Asynchronous Online
Location
Online
Cost
$5,270.00
Course Materials
Open

Introduction to Algorithms

705.621.82
01/21/2025 - 05/06/2025
Semester
Spring 2025
Course Format
Asynchronous Online
Location
Online
Cost
$5,270.00
Course Materials