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/22/2022-12/12/2022 Lecture Monday, Wednesday, Friday 02:00PM - 02:50PM, Kemper-Redd Center, Room 105
- Teacher: Adam Anderson