Generating Multi-Part Autogradable Faded Parsons Problems From Code-Writing Exercises

被引:2
|
作者
Caraco, Serena [1 ]
Lojo, Nelson [1 ]
Verdicchio, Michael [2 ]
Fox, Armando [1 ]
机构
[1] Univ Calif Berkeley, Dept Elect Engn & Comp Sci, Berkeley, CA 94720 USA
[2] The Citadel, Dept Cyber & Comp Sci, Charleston, SC USA
关键词
Educational Tools; Parsons Problems; Scaffolding; Autograding; Software Engineering Education;
D O I
10.1145/3626252.3630786
中图分类号
G40 [教育学];
学科分类号
040101 ; 120403 ;
摘要
Parsons Problems and Faded Parsons Problems have been shown to be effective in helping students in programming courses transition from passive learning, such as lectures or textbooks, to active learning in the form of writing code. We present FPPgen, an authoring system that largely automates the conversion of existing open-ended code-writing exercises to Faded Parsons Problems (FPPs). FPP solutions can be machine-checked using either spec-based autograding, in which student solutions are evaluated against instructor-provided test cases, or mutation-based autograding, in which students produce one or more unit tests that are evaluated using mutation testing. Our system allows creating exercises that rely on complex libraries and helper functions, such as student code intended to be run as part of a complex framework-based application. Our system also gracefully supports cumulative multi-part problems, in which later parts build on earlier parts. Python and Ruby exercises are currently supported, but FPPgen is language-agnostic and adding autograders for other languages is straightforward. In our experience so far, instructors can draft simple questions in less than an hour and mutation-based questions in about two hours as open-ended coding questions, and student helpers can use our tools to convert these to FPPs in less than an hour. FPPgen is in active use in both beginning and advanced large-enrollment programming courses in a CS undergraduate program at a large US university.
引用
收藏
页码:179 / 185
页数:7
相关论文
empty
未找到相关数据