Algorithms

Catalog description

This course concentrates on the design of algorithms and the rigorous analysis of their efficiency. We will cover various algorithm design techniques such as divide and conquer, dynamic programming, greedy algorithms, and approximation algorithms; for each algorithm, we will perform complexity (worst case, average case) analysis. Typically offered Fall Spring Summer. Course Learning Outcomes 1. Demonstrate ability to analyze the correctness and the complexity of various algorithms. 2. Demonstrate mastery a variety of advanced data structures and their implementations. 3. Apply learned algorithm design techniques and data structures to solve problems. View Class Schedule