About this paper

Appears in:
Pages: 9395-9404
Publication year: 2018
ISBN: 978-84-697-9480-7
ISSN: 2340-1079
doi: 10.21125/inted.2018.2325

Conference name: 12th International Technology, Education and Development Conference
Dates: 5-7 March, 2018
Location: Valencia, Spain

A SURVEY ON SOFTWARE COMPLEXITY METRICS IN THE CONTEXT OF THEIR APPLICATION IN EDUCATIONAL ENVIRONMENT

E. Stankov, A. Madevska Bogdanova, B. Ilijoski, M. Jovanov

Ss. Cyril and Methodius University, Faculty of Computer Science and Engineering (MACEDONIA)
Assessment is an extremely important part of the process of education. One of the most significant learning goals of the introductory programming courses is to make students able to comprehend an already written program source code. A common way to assess this ability of students is by giving them tasks that consist of a source code snippet and a question regarding its behavior. When creating a large number of tasks containing source code snippets, e.g. for educative assessment needs in a typical introductory programming course attended by a high number of students, teachers need to maintain the task complexity in order to achieve fair assessment. This problem can be addressed by turning to automated production of such questions. However, in order to attain the complexity consistency in the process of automated production of tasks containing source code snippets, there must be a means of automated measurement of source code complexity. Further, in order to enable automated measurement of source code complexity - an appropriate source code complexity metric is needed.

In this paper we present a survey on software complexity metrics. We discuss and compare the properties of the analyzed metrics, and identify the advantages and drawbacks of using each of them. We also analyze their potential for application in educational environment, in the context of the described problem. Finally, we describe the complexity metric that we have defined, and that is completely suitable for the problem under consideration. We analyze its properties and we present the basis of our claim on the metric’s suitability by explaining the reasons in detail.
@InProceedings{STANKOV2018ASU,
author = {Stankov, E. and Madevska Bogdanova, A. and Ilijoski, B. and Jovanov, M.},
title = {A SURVEY ON SOFTWARE COMPLEXITY METRICS IN THE CONTEXT OF THEIR APPLICATION IN EDUCATIONAL ENVIRONMENT},
series = {12th International Technology, Education and Development Conference},
booktitle = {INTED2018 Proceedings},
isbn = {978-84-697-9480-7},
issn = {2340-1079},
doi = {10.21125/inted.2018.2325},
url = {http://dx.doi.org/10.21125/inted.2018.2325},
publisher = {IATED},
location = {Valencia, Spain},
month = {5-7 March, 2018},
year = {2018},
pages = {9395-9404}}
TY - CONF
AU - E. Stankov AU - A. Madevska Bogdanova AU - B. Ilijoski AU - M. Jovanov
TI - A SURVEY ON SOFTWARE COMPLEXITY METRICS IN THE CONTEXT OF THEIR APPLICATION IN EDUCATIONAL ENVIRONMENT
SN - 978-84-697-9480-7/2340-1079
DO - 10.21125/inted.2018.2325
PY - 2018
Y1 - 5-7 March, 2018
CI - Valencia, Spain
JO - 12th International Technology, Education and Development Conference
JA - INTED2018 Proceedings
SP - 9395
EP - 9404
ER -
E. Stankov, A. Madevska Bogdanova, B. Ilijoski, M. Jovanov (2018) A SURVEY ON SOFTWARE COMPLEXITY METRICS IN THE CONTEXT OF THEIR APPLICATION IN EDUCATIONAL ENVIRONMENT, INTED2018 Proceedings, pp. 9395-9404.
User:
Pass: