"Upperview" algorithm design in teaching computer science in high schools

dc.contributor.authorKátai, Zoltán
dc.date.accessioned2024-09-04T09:45:14Z
dc.date.available2024-09-04T09:45:14Z
dc.date.issued2005-12-01
dc.description.abstractIn this paper we are going to present a teaching/learning method and suggest a syllabus that help the high school students look at the algorithm design strategies from a so called "upperview": greedy, backtracking, divide and conquer, dynamic programming. The goal of the suggested syllabus is, beyond the presentation of the techniques, to offer the students a view that reveals them the basic and even the slight principal differences and similarities between the strategies. In consensus with the Comenius principle this is essential, if we want to master this field of programming ("To teach means scarcely anything more than to show how things differ from one another in their different purposes, forms, and origins. ... Therefore, he who differentiates well teaches well.").en
dc.formatapplication/pdf
dc.identifier.citationTeaching Mathematics and Computer Science, Vol. 3 No. 2 (2005) , 221-240
dc.identifier.doihttps://doi.org/10.5485/TMCS.2005.0095
dc.identifier.eissn2676-8364
dc.identifier.issn1589-7389
dc.identifier.issue2
dc.identifier.jatitleTeach. Math. Comp. Sci.
dc.identifier.jtitleTeaching Mathematics and Computer Science
dc.identifier.urihttps://hdl.handle.net/2437/379559
dc.identifier.volume3
dc.languageen
dc.relationhttps://ojs.lib.unideb.hu/tmcs/article/view/14749
dc.rights.accessOpen Access
dc.rights.ownerZoltán Kátai
dc.subjectteaching methoden
dc.subjectalgorithm design strategiesen
dc.subjectalgorithm design techniquesen
dc.title"Upperview" algorithm design in teaching computer science in high schoolsen
dc.typefolyóiratcikkhu
dc.typearticleen
Fájlok
Eredeti köteg (ORIGINAL bundle)
Megjelenítve 1 - 1 (Összesen 1)
Nincs kép
Név:
PDF
Méret:
220.03 KB
Formátum:
Adobe Portable Document Format