Programming theorems on enumerator

A tétel rövid nézete
dc.contributor.authorGregorics, Tibor
dc.date.accessioned2024-09-04T09:46:19Z
dc.date.available2024-09-04T09:46:19Z
dc.date.issued2010-06-01
dc.description.abstractThis paper deals with the examination of the programming patterns best known by programmers: the programming theorems. It is a significant issue that in what way these patterns can be formulated in order to solve a relatively broad spectrum of problems using a small number of patterns. In this paper, the well known programming theorems are applied to the processing of enumerators. To this end, the robustness of patterns gained this way will be presented, and it will be also pointed out how the programs thus constructed can be implemented in the modern object-oriented programming environments: in language C++, Java and C#.en
dc.formatapplication/pdf
dc.identifier.citationTeaching Mathematics and Computer Science, Vol. 8 No. 1 (2010) , 89-108
dc.identifier.doihttps://doi.org/10.5485/TMCS.2010.0243
dc.identifier.eissn2676-8364
dc.identifier.issn1589-7389
dc.identifier.issue1
dc.identifier.jatitleTeach. Math. Comp. Sci.
dc.identifier.jtitleTeaching Mathematics and Computer Science
dc.identifier.urihttps://hdl.handle.net/2437/379677
dc.identifier.volume8
dc.languageen
dc.relationhttps://ojs.lib.unideb.hu/tmcs/article/view/14867
dc.rights.accessOpen Access
dc.rights.ownerTibor Gregorics
dc.subjectprogramming patternen
dc.subjectanalogous programminngen
dc.subjectprogramming theoremen
dc.subjectenumeratoren
dc.subjectiteratoren
dc.titleProgramming theorems on enumeratoren
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:
540.61 KB
Formátum:
Adobe Portable Document Format
Letöltés
Gyűjtemények
Teaching Mathematics and Computer Science (DE-journals)