Abstract
The aim of this paper is to study the algorithms and data modelling parts of the Hungarian final exam. In 2005, the final exams were reformed in Hungary. The research includes the final exams from May 2005 to May 2012, focusing on methodical and algorithmic orientated methods of the teaching of programming. The paper examines the presence of programming theorems, data types, and data structures in the tasks, and collects extra ideas which can make the tasks easier to solve. Following this examination, the results are evaluated on the aspects of the proportion of programming theorems, whether it is appropriate or not, and how the tasks of this exam could be improved. Moreover, this article can be useful for Informatics teachers as well, as they get a comprehensive picture of the programming task of the final exam, so they can prepare their students better.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
