Analysis of Algorithms

An investigation of paradigms for design and analysis of algorithms. The course will include dynamic programming, flows and combinatorial optimization algorithms, linear programming, randomization and a brief introduction to intractability and approximation algorithms. The course will include other advanced topics, time permitting. Prerequisite: Data Structures and Algorithms at the undergraduate level.Please note: During Open Enrollment this course is restricted to the graduate programs listed below. All other students will need to request permission (https://bit.ly/3Ru2uVr) for this course in order to be considered for enrollment. This also applies to all students if the course becomes closed/full. Requests will be reviewed on a rolling basis and students will be notified via email if a spot is available to them.