Computer Aided Design and Grading for an Electronic Functional Programming Exam

Abstract

Electronic exams (e-exams) have the potential to substantially reduce the effort required for conducting an exam through automation. Yet, care must be taken to sacrifice neither task complexity nor constructive alignment nor grading fairness in favor of automation. To advance automation in the design and fair grading of (functional programming) e-exams, we introduce the following: A novel algorithm to check Proof Puzzles based on finding correct sequences of proof lines that improves fairness compared to an existing, edit distance-based algorithm; an open-source static analysis tool to check source code for task relevant features by traversing the abstract syntax tree; a higher-level language and open-source tool to specify regular expressions that makes creating complex regular expressions less error-prone. Our findings are embedded in a complete experience report on transforming a paper exam to an e-exam. We evaluated the resulting e-exam by analyzing the degree of automation in the grading process, asking students for their opinion, and critically reviewing our own experiences. Almost all tasks can be graded automatically at least in part (correct solutions can almost always be detected as such), the students agree that an e-exam is a fitting examination format for the course but are split on how well they can express their thoughts compared to a paper exam, and examiners enjoy a more time-efficient grading process while the point distribution in the exam results was almost exactly the same compared to a paper exam.

Teaching Type Systems Implementation with Stella, an Extensible Statically Typed Programming Language

“…Additionally, in some situations, the playground is able to suggest some alternative errors, allowing for some variation in student's implementations. An approach to automation of testing similar to Lübke, Fuger, Bahnsen, Billerbeck, and Schupp [19] could also be employed in the future.…”

“…Lübke, Fuger, Bahnsen, Billerbeck, and Schupp [19] show how to automate exams and assignments for functional programming that include proofs traditionally performed on paper. With STELLA's system of extensions, we have the basis for similar automation for our assignments, but we keep advanced automation for future work.…”