This course will cover advanced data structures and algorithmic analysis from a theoretical and practical perspective. Data Structures covered will include: Trees, Graphs, and Hash Maps. Algorithmic focus will consist of the following topics: Big-O Notation, Graph and Tree Algorithms, Greedy Algorithms, Divide and Conquer Algorithms, and Dynamic Programming. Prerequisites: Grade of C or better in Computer Science 120 and Mathematics 167 or WPI. 08/23/2021-12/13/2021 Lecture Monday, Wednesday, Friday 03:00PM - 03:50PM, Room to be Announced
- Teacher: Adam Anderson