Search

Search Results

• Force of summation

  185-199

  Tibor Gregorics

  Views:

  12

  Programming theorems are important tools of programming methodology. By using analogous programming techniques, the solutions of different tasks can be created easily and fast based on programming theorems. Perhaps the summation is the simplest programming theorem that is widely-known among the programmers but once and for all the most various tasks can be solved by this theorem. The aim of the present paper is to investigate the summation programming theorem. Several different abstract levels of this theorem will be defined and the problem types that can be solved based on summation are going to be described. We will underline those points of a programming theorem that make a theorem general and that are not defined in advance, just later during its application, when the solution of a problem is derived from the theorem.

• Teaching multiparadigm programming based on object-oriented experiences

  171-182

  Zoltán Porkoláb

  Viktória Zsók

  Views:

  18

  Multiparadigm programming is an emerging practice in computer technology. Co-existence of object-oriented, generic and functional techniques can better handle variability of projects. The present paper gives an overview of teaching multiparadigm programming approach through typical language concepts, tools in higher education. Students learning multiparadigm-oriented subjects would gain considerable expertise, which is highly needed by the industrial side in large-scale application development.

• "Frontier algorithms"

  139-152

  Zoltán Kátai

  Views:

  6

  In this paper we present a new method to compare algorithm design strategies. As in case of frontier towns the cultures blend, the so called "frontier algorithms" are a mixture of different programming techniques like greedy, backtracking, divide and conquer, dynamic programming. In case of some of them the frontier character is hidden, so it has to be discovered. There are algorithms that combine different techniques purposively. Furthermore, determining the programming technique the algorithm is using can be a matter of point of view. The frontier algorithms represent special opportunities to highlight particular characteristics of the algorithm design strategies. According to our experience the frontier algorithms fit best to the revision classes.

• Teaching XML

  317-335

  Péter Jeszenszky

  Views:

  9

  The author has been teaching XML at the Faculty of Informatics, University of Debrecen since the end of the nineties. This paper gives an overview of XML technology from an educators viewpoint that is based on the experience that the author has gained teaching XML over the years. A detailed description of the XML course is provided. Methodological issues are also discussed.

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

  221-240

  Zoltán Kátai

  Views:

  11

  In 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.").

• The single-source shortest paths algorithms and the dynamic programming

  25-35

  Zoltán Kátai

  Views:

  14

  In this paper we are going to present a teaching—learning method that help students look at three single-source shortest paths graph-algorithms from a so called "upperview": the algorithm based on the topological order of the nodes, the Dijkstra algorithm, the Bellman-Ford algorithm. The goal of the suggested method is, beyond the presentation of the algorithms, to offer the students a view that reveals them the basic and even the slight principal differences and similarities between the strategies. In order to succeed in this object, teachers should present the mentioned algorithms as cousin dynamic programming strategies.