Minimizing Curricular Complexity through Backwards Design

In this paper, we first describe the Optimal Learning Outcomes Assignment (OLOA) problem, which involves assigning learning outcomes to courses during the backwards curriculum design process in ways that minimize the complexity of the resulting curriculum. An approximation algorithm for the OLOA problem is then described that yields novel solutions to important engineering curricular design challenges. Reducing curricular complexity, while maintaining effective learning outcomes attainment, increases the likelihood students will complete a curriculum and earn a degree. The rationale for the approach taken here follows from the fact that by rearranging the learning outcomes among the courses in a curriculum, the overall structure of a curriculum can be changed. Thus, the OLOA problem provides a criterion for finding curricular structures that enhance student success. The OLOA problem is shown to be strongly NP-complete; however, an integer quadratic programming approximation algorithm is described that effectively produces practical, efficient, and novel solutions for attaining the most important leaning outcomes in an undergraduate engineering curriculum.