3 credits
Fall 2025 Lecture Distance Learning Upper Division
Solving large-scale problems typically rely on many clever data structures and algorithms. This course aims to cover many such useful algorithms for solving large-scale problems. These algorithms include greedy algorithms, dynamic programming and more advanced graph algorithms. The course also aims to demonstrate how such algorithms can be applied to solve optimization problems encountered in engineering applications. In particular, applications in the design of VLSI (very large scale integration) at circuit, layout, or system level will be used to demonstrate how an engineering problem can be formulated as a tree/graph problem and solved using established tree/graph algorithms.
Learning Outcomes1Demonstrate an understanding of greedy algorithms and dynamic programming (ABET outcome 1).
2Demonstrate an n understanding of advanced graph algorithms (ABET outcome 1).
3Demonstrate an ability to design and implement appropriate data structures and algorithms for engineering applications (ABET outcomes 1 and 2).
Prerequisites
Restrictions
made by Purdue students.