About this paper

Appears in:
Pages: 5892-5899
Publication year: 2017
ISBN: 978-84-697-6957-7
ISSN: 2340-1095
doi: 10.21125/iceri.2017.1549

Conference name: 10th annual International Conference of Education, Research and Innovation
Dates: 16-18 November, 2017
Location: Seville, Spain

IMPROVED APPROACH FOR MEASURING COMPLEXITY OF CODE SNIPPETS FOR INTRODUCTORY PROGRAMMING TASKS

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

Sts. Cyril and Methodius University, Faculty of Computer Science and Engineering (MACEDONIA)
Teaching programming is an activity receiving significant attention nowadays. Assessment of students’ knowledge in introductory programming courses can (partly) be done by presenting simple source code snippets (fragments). Students should be able to correctly answer the question: “What is the output of the given code?” When preparing the code snippets, teachers must be aware of the code’s complexity. Particularly, when preparing many different versions of the same test (to assess a huge number of students), they should try to provide same or similar complexity tasks for all students. A possible solution to this problem is to turn to automatic generation of questions containing source code snippets.

In order to attain complexity consistency in the process of automatic production of questions for programming courses, there needs to be a way to automatically measure the complexity of source codes. In this paper we describe a source code metric that we have defined and that considers the source code complexity from a perspective of the student’s effort required for manual calculation of the program output, if the input is known. The metric measures the complexity using weight values assigned to each of the operators and branch statements in the code. We also describe our findings from the research that we have conducted in order to determine appropriate weight values for the arithmetic operators. The main goal of this research was to improve the accuracy of the code complexity calculation for automatically generated tasks that contain source codes, by determining weight values for basic arithmetic operations with simplest operand types. We also provide remarks for the future experiments that we plan to conduct on the subject.
@InProceedings{STANKOV2017IMP,
author = {Stankov, E. and Jovanov, M. and Madevska Bogdanova, A.},
title = {IMPROVED APPROACH FOR MEASURING COMPLEXITY OF CODE SNIPPETS FOR INTRODUCTORY PROGRAMMING TASKS},
series = {10th annual International Conference of Education, Research and Innovation},
booktitle = {ICERI2017 Proceedings},
isbn = {978-84-697-6957-7},
issn = {2340-1095},
doi = {10.21125/iceri.2017.1549},
url = {http://dx.doi.org/10.21125/iceri.2017.1549},
publisher = {IATED},
location = {Seville, Spain},
month = {16-18 November, 2017},
year = {2017},
pages = {5892-5899}}
TY - CONF
AU - E. Stankov AU - M. Jovanov AU - A. Madevska Bogdanova
TI - IMPROVED APPROACH FOR MEASURING COMPLEXITY OF CODE SNIPPETS FOR INTRODUCTORY PROGRAMMING TASKS
SN - 978-84-697-6957-7/2340-1095
DO - 10.21125/iceri.2017.1549
PY - 2017
Y1 - 16-18 November, 2017
CI - Seville, Spain
JO - 10th annual International Conference of Education, Research and Innovation
JA - ICERI2017 Proceedings
SP - 5892
EP - 5899
ER -
E. Stankov, M. Jovanov, A. Madevska Bogdanova (2017) IMPROVED APPROACH FOR MEASURING COMPLEXITY OF CODE SNIPPETS FOR INTRODUCTORY PROGRAMMING TASKS, ICERI2017 Proceedings, pp. 5892-5899.
User:
Pass: