ACS 3120 Advanced Recursion & Graphs (CS 2.2)
This course covers graph theory, data structures, algorithms, and analysis. Key concepts include recursion, greedy algorithms, dynamic programming, memoization, graph traversal, spanning trees, and network optimization. Students will build an original project whose underlying structure requires the use of graph structures and algorithms to solve real-world problems such as airplane routing, social networking, maze solving, and board games. Students will also write technical blog articles about these topics to deepen understanding, improve technical writing, and bolster their online presence as knowledgeable and proficient software engineers. Prerequisites:
ACS 2130 (CS 1.3)