Abstract
This paper proposes a structure driven approach to assess graph-based exercises. Given two graphs, a solution and an attempt of a student, this approach computes a mapping between the node sets of both graphs that maximizes the student’s grade, as well as a description of the differences between the two graph. The proposed algorithm uses heuristics to test the most promising mappings first and prune the remaining when it is sure that a better mapping cannot be computed.
The proposed algorithm is applicable to any type of document that can be parsed into its graph-inspired data model. This data model is able to accommodate diagram languages, such as UML or ER diagrams, for which this kind of assessment is typically used. However, the motivation for developing this algorithm is to combine it with other assessment models, such as the test case model used for programming language assessment.
The proposed algorithm was validated with thousands of graphs with different features produced by a synthetic data generator. Several experiments were designed to analyse the impact of different features such as graph size, and amount of difference between solution and attempt.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
References
Ali, N.H., Shukur, Z., Idris, S.: A design of an assessment system for UML class diagram. In: International Conference on Computational Science and its Applications, 2007, ICCSA 2007, pp. 539–546. IEEE (2007)
Alur, R., D’Antoni, L., Gulwani, S., Kini, D., Viswanathan, M.: Automated grading of DFA constructions. In: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, pp. 1976–1982. AAAI Press (2013)
Batmaz, F., Hinde, C.J.: A diagram drawing tool for semi-automatic assessment of conceptual database diagrams (2006)
Douce, C., Livingstone, D., Orwell, J.: Automatic test-based assessment of programming: a review. J. Educ. Resour. Comput. (JERIC) 5(3), 4 (2005)
Hell, P., Nesetril, J.: Graphs and Homomorphisms. Oxford University Press, Oxford (2004)
Shukur, Z., Mohamed, N.F.: The design of adat: a tool for assessing automata-based assignments. J. Comput. Sci. 4(5), 415 (2008)
Soler, J., Boada, I., Prados, F., Poch, J., Fabregat, R.: A web-based e-learning tool for UML class diagrams. In: 2010 IEEE Education Engineering (EDUCON), pp. 973–979. IEEE (2010)
Thomas, P., Smith, N., Waugh, K.: Automatically assessing diagrams. In: Proceedings of the IADIS International Conference on e-Learning, vol. 2009 (2009)
Thomas, P., Waugh, K., Smith, N.: Automatically assessing free-form diagrams in e-assessment systems. In: 1st HEA Aiming for Excellence in STEM Learning and Teaching Annual Conference, Imperial College London (2012)
Vachharajani, V., Pareek, J.: A proposed architecture for automated assessment of use case diagrams. Int. J. Comput. Appl. 108(4), 35–40 (2014). full text available
Acknowledgments
Project “NORTE-07-0124-FEDER-000059” is financed by the North Portugal Regional Operational Programme (ON.2 O Novo Norte), under the National Strategic Reference Framework (NSRF), through the European Regional Development Fund (ERDF), and by national funds, through the Portuguese funding agency, Fundao para a Cincia e a Tecnologia (FCT).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Sousa, R., Leal, J.P. (2015). A Structural Approach to Assess Graph-Based Exercises. In: Sierra-Rodríguez, JL., Leal, JP., Simões, A. (eds) Languages, Applications and Technologies. SLATE 2015. Communications in Computer and Information Science, vol 563. Springer, Cham. https://doi.org/10.1007/978-3-319-27653-3_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-27653-3_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-27652-6
Online ISBN: 978-3-319-27653-3
eBook Packages: Computer ScienceComputer Science (R0)