We present a novel technique for the automatic correction of open exercises in the area of technical science. The task is not solvable in general, and thus we restrict ourselves to exercises whose solutions are represented through data structures that can be automatically analyzed. Example of such data structures are: undirected and directed graphs; finite state automata; truth tables, programmable logic arrays (PLAs), and Boolean functions; and stacks, trees and lists. Restricting the task to such data-structures has the added advantage that the answers can be encoded through web-forms or through cheaper paper-forms to be read through optical mark readers. This allows the delivery of such exercises both as a self-assessment tool through the web and as formal exams.
Automatic correction of complex technical exercises / Sterbini, Andrea. - 3:(2002), pp. S1E-24-S1E-27. (Intervento presentato al convegno Frontiers in Education tenutosi a Boston, USA nel 6-9 Nov. 2002) [10.1109/FIE.2002.1158631].
Automatic correction of complex technical exercises
STERBINI, Andrea
2002
Abstract
We present a novel technique for the automatic correction of open exercises in the area of technical science. The task is not solvable in general, and thus we restrict ourselves to exercises whose solutions are represented through data structures that can be automatically analyzed. Example of such data structures are: undirected and directed graphs; finite state automata; truth tables, programmable logic arrays (PLAs), and Boolean functions; and stacks, trees and lists. Restricting the task to such data-structures has the added advantage that the answers can be encoded through web-forms or through cheaper paper-forms to be read through optical mark readers. This allows the delivery of such exercises both as a self-assessment tool through the web and as formal exams.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
