Dynamically Adaptive Parsons Problems

Parsons problems are code segments that must be placed in the correct order with the correct indention. Research on Parsons problems suggests that they might be a more effective and efficient learning approach than writing equivalent code, especially for time-strapped secondary teachers. I am exploring this hypothesis with empirical experiments, observations, and log file analyses. Our research team also plans to modify the open-source js-parsons software to allow Parsons problems to be dynamically adaptive, which means that the difficulty of the problem will change based on the user's past performance. I plan to compare dynamically adaptive Parsons problems to the current non-adaptive Parsons problems to determine which learners prefer and to see if solving dynamically adaptive Parsons problems leads to more efficient and effective learning than solving non-adaptive Parsons problems.