Assessment of Learner's Algorithms

In this paper we propose a method based on program comprehension to assess learners in algorithmic. This method understands automatically the algorithms proposed by the students using comprehension methods from the domain of the software engineering. To assess students propositions, we use prebuilt models of algorithms. These models are documented with information and pedagogical characteristics, and they are organized into tasks and subtasks. We recognize students propositions based on a distance calculus between the model and the proposition. A first experiment and results are presented.

[1]  Mike Joy,et al.  Effective peer assessment for learning computer programming , 2004, ITiCSE '04.

[3]  Richard C. Waters,et al.  Challenges to the field of reverse engineering , 1993, [1993] Proceedings Working Conference on Reverse Engineering.

[4]  Susan A. Mengel,et al.  A case study of the static analysis of the quality of novice student programs , 1999, SIGCSE '99.

[5]  Greg J. Michaelson,et al.  Automatic analysis of functional program style , 1996, Proceedings of 1996 Australian Software Engineering Conference.

[6]  Mark G. Simkin,et al.  Multiple-Choice Tests and Student Understanding: What Is the Connection? , 2005 .

[7]  Peter M. Chen An automated feedback system for computer organization projects , 2004, IEEE Transactions on Education.

[8]  Thomas A. Corbi,et al.  Program Understanding: Challenge for the 1990s , 1989, IBM Syst. J..