Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/1336
DC FieldValueLanguage
dc.contributor.authorPešić, Đorđeen_US
dc.contributor.authorVujošević Janičić, Milenaen_US
dc.contributor.authorMišić, Markoen_US
dc.contributor.authorProtić, Jelicaen_US
dc.date.accessioned2024-08-23T08:32:22Z-
dc.date.available2024-08-23T08:32:22Z-
dc.date.issued2024-
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/1336-
dc.descriptionĐorđe Pešić, Milena Vujošević-Janičić, Marko Mišić, Jelica Protić, A novel approach to source code assembling in the field of algorithmic complexity, Computer Science and Information Systems 2024 Volume 21, Issue 3, Pages: 781-806 DOI: <a href="https://doi.org/10.2298/CSIS230730015P">https://doi.org/10.2298/CSIS230730015P</a>en_US
dc.description.abstractComputational complexity analysis plays an essential part in the education of computer and software engineers. For that reason, it is carefully studied in programming courses, as well as in the algorithms and data structures courses. The number of students who learn programming is rapidly growing, but the number of teachers cannot keep up with that trend. Therefore, it is necessary to develop tools that can ease and accelerate the daily tasks of teachers, especially for learning purposes and in the context of automating the processes of exam preparation. We propose a novel template- and rule-based approach and a corresponding software system for assembling synthetic source code segments of defined time complexity. Based on the developed grammar, the system can produce source code segments with a broad scope of different time complexities while guaranteeing the complexity of the generated segment. The system can be used for generating questions for exams as it can assemble a large number of different code segments that can be given as questions that have similar difficulty levels. The system was evaluated both by human experts and ChatGPT tool.en_US
dc.language.isoenen_US
dc.publisherComSIS consortiumen_US
dc.relation.ispartofComputer Science and Information Systemsen_US
dc.rightsAttribution 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by/3.0/us/*
dc.subjectautomated source code assemblingen_US
dc.subjectcomputational complexityen_US
dc.subjectTime complexityen_US
dc.subjectrule-based assemblingen_US
dc.titleA Novel Approach to Source Code Assembling in the Field of Algorithmic Complexityen_US
dc.typeArticleen_US
dc.identifier.doi10.2298/CSIS230730015P-
dc.identifier.isi001278591900001-
dc.contributor.affiliationInformatics and Computer Scienceen_US
dc.relation.issn1820-0214en_US
dc.description.rankM23en_US
dc.relation.firstpage781en_US
dc.relation.lastpage806en_US
dc.relation.volume21en_US
dc.relation.issue3en_US
item.fulltextWith Fulltext-
item.languageiso639-1en-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.grantfulltextopen-
item.openairetypeArticle-
crisitem.author.deptInformatics and Computer Science-
crisitem.author.orcid0000-0001-5396-0644-
Appears in Collections:Research outputs
Files in This Item:
File Description SizeFormat
1820-02142400015P.pdf4.17 MBAdobe PDF
View/Open
Show simple item record

Page view(s)

17
checked on Dec 24, 2024

Download(s)

4
checked on Dec 24, 2024

Google ScholarTM

Check

Altmetric

Altmetric


This item is licensed under a Creative Commons License Creative Commons