|
|
|
|
| LEADER |
01251nam a2200133Ia 4500 |
| 001 |
10.1016-j.sbspro.2013.07.119 |
| 008 |
220127s2013 CNT 000 0 und d |
| 020 |
|
|
|a 1877-0428
|
| 245 |
1 |
0 |
|a The Use of Cyclomatic Complexity Metrics in Programming Performance's Assessment
|
| 856 |
|
|
|z View Fulltext in Publisher
|u https://doi.org/10.1016/j.sbspro.2013.07.119
|
| 520 |
3 |
|
|a Programming course is usually difficult and complex as taken from a student's point of view. Complexity of a programming code may be determined by the number of linearly independent path of its source code. This paper will be discussing the consistencies of the complexity of the code supposedly produced by students based on the programming questions found in the programming assessment throughout a semester of studies. The comparisons of the level of complexity and the students' grade for various assessments materials are done. Based on this a relationship is observed and the conclusion is drawn on whether the consistencies in producing a certain pattern of expected complexity of a programming code has an effect on students performance. (C) 2013 The Authors. Published by Elsevier Ltd.
|
| 700 |
1 |
0 |
|a Endut, WRW
|e author
|
| 700 |
1 |
0 |
|a Mohamed, N
|e author
|
| 700 |
1 |
0 |
|a Sulaiman, RFR
|e author
|
