You are here:

Marking student programs using graph similarity
ARTICLE

, ,

Computers & Education Volume 54, Number 2, ISSN 0360-1315 Publisher: Elsevier Ltd

Abstract

We present a novel approach to the automated marking of student programming assignments. Our technique quantifies the structural similarity between unmarked student submissions and marked solutions, and is the basis by which we assign marks. This is accomplished through an efficient novel graph similarity measure (

Citation

Naudé, K.A., Greyling, J.H. & Vogts, D. (2010). Marking student programs using graph similarity. Computers & Education, 54(2), 545-561. Elsevier Ltd. Retrieved December 11, 2019 from .

This record was imported from Computers & Education on January 30, 2019. Computers & Education is a publication of Elsevier.

Full text is availabe on Science Direct: http://dx.doi.org/10.1016/j.compedu.2009.09.005

Keywords

Cited By

View References & Citations Map

These links are based on references which have been extracted automatically and may have some errors. If you see a mistake, please contact info@learntechlib.org.