Search

Search Results

• Cultivating algorithmic thinking: an important issue for both technical and HUMAN sciences

  107-116

  Zoltán Kátai

  Lehel István Kovács

  Zoltán Kása

  Gyöngyvér Márton

  Kinga Fogarasi

  Ferenc Fogarasi

  Views:

  23

  Algorithmic thinking is a valuable skill that all people should master. In this paper we propose a one-semester, algorithm-oriented computer science course for human science students. According to our experience such an initiative could succeed only if the next recipe is followed: interesting and practical content + exciting didactical methods + minimal programming. More explicitly, we suggest: (1) A special, simple, minimal, pseudo-code like imperative programming language that integrates a graphic library. (2) Interesting, practical and problem-oriented content with philosophical implications. (3) Exciting, human science related didactical methods including art-based, inter-cultural elements.

• ICT methodology

  3-24

  László Zsakó

  Katalin Juhász

  Zoltán Kátai

  Views:

  31

  This article is an overview discussing what ICT subject methodology, ICT didactics and ICT methodology are, what the philosophy of ICT is, and finally what ICT pedagogy is.

• "Frontier algorithms"

  139-152

  Zoltán Kátai

  Views:

  20

  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.

• Proof without words

  311-312

  Zoltán Kátai

  Views:

  4

  Let us prove: If we add 1 to the product of four consecutive natural numbers, we get a square number:…

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

  221-240

  Zoltán Kátai

  Views:

  34

  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:

  25

  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.