Optimising Programming Curriculum Gradation Using the Program Builds Count Method

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60076658%3A12410%2F26%3A43910946" target="_blank" >RIV/60076658:12410/26:43910946 - isvavai.cz</a>

Výsledek na webu

<a href="https://link.springer.com/chapter/10.1007/978-3-032-01222-7_2" target="_blank" >https://link.springer.com/chapter/10.1007/978-3-032-01222-7_2</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-032-01222-7_2" target="_blank" >10.1007/978-3-032-01222-7_2</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Optimising Programming Curriculum Gradation Using the Program Builds Count Method

Popis výsledku v původním jazyce

Beginners in programming solve tasks by creating programs which correctness could be evaluated by an automatic system. To do so, it must recognize all correct solutions and be able to decide whether the pupil&apos;s solution corresponds to them. This paper introduces an alternative method of assessing the gradation of programming tasks-Variance of Program Builds count (VPB). This is based on the fact that building a program takes the form of its successive iteration. In that case, the number of times such a program was built by the solver can be monitored. The variance of the program builds count can be considered as a criterion of the difficulty of the task. This variance is the highest in the age group for which the task is most suitable. If a series of tasks has a slow gradation in difficulty, all the tasks should be most suitable for the same age group. If the gradation is faster, each task should be most suitable for slightly older pupils than the preceding task. The VPB method was applied to a series of graded programming tasks in order to ascertain whether these tasks satisfied the requirement of increasing difficulty. The tasks were completed by 24,806 pupils from grades 4 to 9. The method identified an issue with the gradation of the series. This was in line with the opinions of two independent experts. Using the VPB method can be regarded as beneficial for the refinement of a series of programming tasks, with the objective of optimising its gradation.

Název v anglickém jazyce

Optimising Programming Curriculum Gradation Using the Program Builds Count Method

Popis výsledku anglicky

Beginners in programming solve tasks by creating programs which correctness could be evaluated by an automatic system. To do so, it must recognize all correct solutions and be able to decide whether the pupil&apos;s solution corresponds to them. This paper introduces an alternative method of assessing the gradation of programming tasks-Variance of Program Builds count (VPB). This is based on the fact that building a program takes the form of its successive iteration. In that case, the number of times such a program was built by the solver can be monitored. The variance of the program builds count can be considered as a criterion of the difficulty of the task. This variance is the highest in the age group for which the task is most suitable. If a series of tasks has a slow gradation in difficulty, all the tasks should be most suitable for the same age group. If the gradation is faster, each task should be most suitable for slightly older pupils than the preceding task. The VPB method was applied to a series of graded programming tasks in order to ascertain whether these tasks satisfied the requirement of increasing difficulty. The tasks were completed by 24,806 pupils from grades 4 to 9. The method identified an issue with the gradation of the series. This was in line with the opinions of two independent experts. Using the VPB method can be regarded as beneficial for the refinement of a series of programming tasks, with the objective of optimising its gradation.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

50301 - Education, general; including training, pedagogy, didactics [and education systems]

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2026

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Lecture Notes in Computer Science

ISBN

978-3-032-01221-0

ISSN

0302-9743

e-ISSN

1611-3349

Počet stran výsledku

12

Strana od-do

15-26

Název nakladatele

Springer-Verlag Heidelberg

Místo vydání

Heidelberg

Místo konání akce

Trier

Datum konání akce

8. 9. 2025

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

001576307200002