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
08/26/2024 - 12/10/2024
|
|
Open
Introduction to Algorithms
08/26/2024 - 12/10/2024
|
|
Open
Introduction to Algorithms
08/26/2024 - 12/10/2024
|
|
Open
Introduction to Algorithms
01/21/2025 - 05/06/2025
|
|
Open
Introduction to Algorithms
01/21/2025 - 05/06/2025
|