Search
Search Results
-
The hyperbola and Geogebra in high-school instruction
277-285Views:182In this article the results of teaching/learning hyperbola and its characteristics in high-school using computers and GeoGebra are shown. Students involved in the research attend Engineering School "Nikola Tesla" in Leposavic, Serbia. The aim of the research was to define ways and volume of computer and GeoGebra usage in mathematics instruction in order to increase significantly students' mathematical knowledge and skills. -
Fostering engineering freshmen’s shifts of attention by using Matlab LiveScript for solving mathematical tasks
1-14Views:270We designed an experimental path including a summative assessment phase, where engineering freshmen are involved in solving mathematical tasks by using Matlab LiveScripts. We analyzed the students’ answers to a questionnaire about their perceived impact of the use of Matlab on their way to solve mathematical tasks. The main result is that students show shifts of attention from computations to other aspects of problem solving, moving from an operational to a structural view of mathematics.
Subject Classification: 97U70, 97H60
-
Synthesis of concurrent programs
301-317Views:94Students need a well defined method to be successful in the complex process of writing a concurrent program. In this paper we show a step by step method to create such programs. The method based on UML which has been thought to students during previous courses. UML provides standard and relatively simple tools to describe concurrent systems, and from the description the program can be derived.
First we give a brief introduction to the concurrent systems. This is followed by the description of the method, and finally we demonstrate the method on a small problem. -
Software engineering education in cooperation with industrial partners
133-148Views:171This paper presents our experiences on teaching software engineering in teams which are organized around different R+D projects. These long-running, innovative projects are carried out in cooperation with industrial partners, and are supported by student exchange. While MSc and PhD students work together with faculty staff members on the projects in an industrial-like environment, the students develop skills that would be otherwise very hard for them to obtain. The methodological contributions of the paper are illustrated by, and substantiated with, the description of a concrete software engineering project. -
A computational thinking problem-thread for grade 7 students and above from the Pósa method
101-110Views:292Lajos Pósa has been developing his “learning through discovery” (Győri & Juhász, 2018) method since 1988. His weekend math camps are focused on fostering problem-solving skills and high-level mathematical-thinking skills in gifted students from grades 7 to 11. One of the core aspects of the method is the structure of the problems, all problems are part of a complex, intertwined, and rich network. In this article we analyze a computational thinking problem-thread and its role in the camps’s network of problems (Gosztonyi, 2019), and show some aspects of the method. The insights gained using this method can be useful in other contexts. The possible adaptation of the method to secondary and high schools is briefly discussed as well.
Subject Classification: 97D40
-
Typical mistakes in Mental Cutting Test and their consequences in gender differences
385-392Views:204Spatial ability of first year university students is measured and evaluated in this paper. We used standard Mental Cutting Test (MCT), where a body is given by perspective view and correct cross section has to be chosen. While gender differences in MCT are reported by several papers including our earlier results, much less known are the reasons of these differences. Here we show that typical mistakes (answers to problems which are close to be correct) can be one of the possible reasons, since female students made typical mistakes in some cases more frequently than males. -
Examining continuity/discontinuity of a function by using GeoGebra
241-257Views:200The possibility to visualize the things with the help of today's dynamic software (GeoGebra being one of them), enables the students to see and explore mathematical relations and concepts that were difficult to be presented in the past, prior to the state-of-the-art technologies. In methodological sense, the contribution of this paper lies in the presentation of a set of visualizations designed to help students better understand and explore the basic calculus concepts such as continuity at a point, to examine discontinuity at a point, to display discontinuities and the relations between continuity and differentiability of single variable functions. In technical sense, this paper presents creative GeoGebra applets which offer new possibilities that could be of a vital importance for the future development of e-learning of College mathematics. -
Difference lists in Prolog
73-87Views:163Prolog is taught at Bradford University within the two-semester module Symbolic and Declarative Computing/Artificial Intelligence. Second year undergraduate students are taught here the basics of the functional and the logic programming paradigms, the latter by using the Linux implementation of SWI Prolog [6]. The topic 'Difference lists' is mentioned in traditional textbooks such as [2] and [5] but it was felt that the available texts do not quite serve our purposes. We present here a lecture handout and a laboratory sheet for the teaching sessions on Difference lists. It is believed that the lectures and lab sessions together with the handouts shown here are a gentle, self-contained and reasoned introduction into the topic. The figures here shown to illustrate the concepts are considered a special feature of the handouts which in this form do not seem to be well known. -
Combinatorics – competition – Excel
427-435Views:165In 2001 the Informatics Points Competition of the Mathematics Journal for Secondary School Students (KÖMAL) was restarted [1]. The editors set themselves an aim to make the formerly mere programming competition a bit more varied. Therefore, every month there has been published a spreadsheet problem, a part of which was related to combinatorics. This article is intended to discuss the above mentioned problems and the solutions given to them at competitions. We will prove that traditional mathematical and programming tasks can be solved with a system developed for application purposes when applying a different way of thinking. -
On the legacy of G. Pólya: some new (old) aspects of mathematical problem solving and relations to teaching
169-189Views:115In this article are given some new aspects of mathematical problem solving. A framework is presented by three main resources: (1) Pólya's studies about mathematical heuristics are augmented by information drawn from a study of the history of mathematical problem solving. (2) Connections are presented between mathematical problem solving and mathematical beliefs. (3) Experience with a special program for mathematical talented students is sketched. On this background a new textbook-series has been developed and some teaching examples are taken from this context. An outlook is given on some new research on teaching of problem solving, including possible relations to modern brain research. -
Über die Verwendung von Maple für die Simulation von Mechanismen
21-39Views:131Maple is used to do numerical computation, plot graphs and do exact symbolic manipulations and word processing. This paper demonstrates how Maple can be used for the simulation of mechanisms. This offers the possibility for students to become familiar with this particular section of mathematical modelling. The mechanism under consideration is a so-called F-mechanisms, i.e., a planar parallel 3-RRR robot with three synchronously driven cranks. It turns out that at this example it is not possible to find the poses of the moving triangle exactly by graphical methods with traditional instruments only. Hence, numerical methods are essential for the analysis of motions which can be performed by an F-mechanism. -
Algorithmics of the knapsack type tasks
37-71Views:151We propose a new kind of approach of the teaching of knapsack type problems in the classroom. We will remind you the context of the general knapsack-task and we will classify it, including the two most popular task variants: the discrete and the continuous one. Once we briefly present the solving algorithm of the continuous variant, we will focus on the solving of the discrete task, and we will determine the complexity of the algorithms, looking for different optimizing possibilities. All these issues are presented in a useful way for highschool teachers, who are preparing students in order to participate in different programming contests. -
Report of Meeting Researches in Didactics of Mathematics and Computer Sciences, April 1-3, 2022 Baja, Hungary
135-155Views:295The meeting Researches in Didactics of Mathematics and Computer Sciences was held in Baja, Hungary, at Eötvös József College, from the 1st to the 3th of April, 2022. It was organized by the Doctoral School of Mathematical and Computational Sciences of the University of Debrecen and by Eötvös József College. The 62 participants - including 18 PhD students - came from 8 countries and represented 26 institutions of higher and secondary education. There were 3 plenary and 40 session talks in the program.
-
Interactive web portals in mathematics
347-361Views:238Many of the recent problems in higher education (less contact seminars, the heterogeneity and the increasing number of our students) call for new instructional methods. At University of Szeged we have developed a mathematical web portal which can offer a solution for such problems among the changing circumstances. This freely available, easy-to-use web-surface supports interactive mathematical problem-solving and student self assessment. Our computer program cooperates with a lot of free software (computer algebra systems, formula parsers, converters, word processors). WebMathematics Interactive has been available for the public since June 2002 on its web page http://wmi.math.u-szeged.hu. -
Nice tiling, nice geometry!?!
269-280Views:148The squared papers in our booklets, or the squared (maybe black and white) pavements in the streets arise an amusing problem: How to deform the side segments of the square pattern, so that the side lines further remain equal (congruent) to each other? More precisely, we require that each congruent transformation of the new pattern, mapping any deformed side segment onto another one, leaves the whole (infinitely extended) pattern invariant (unchanged).
It turns out that there are exactly 14 types of such edge-transitive (or so-called isotoxal) quadrangle tilings, sometimes with two different forms (e.g. black and white) of quadrangles (see Figure 2). Such a collection of tiling can be very nice, perhaps also useful for decorative pavements in streets, in flats, etc.
I shall sketch the solution of the problem that leads to fine (and important) mathematical concepts (as barycentric triangulation of a polygonal tiling, adjacency operations, adjacency matrix, symmetry group of a tiling, D-symbol, etc). All these can be discussed in an enjoyable way, e.g. in a special mathematical circle of a secondary school, or in more elementary form as visually attractive figures in a primary school as well.
My colleague, István Prok [11] developed an attractive computer program on the Euclidean plane crystallographic groups with a nice interactive play (for free download), see our Figures 3-5.
A complete classification of such Euclidean plane tilings (not only with quadrangles) can be interesting for university students as well, hopefully also for the Reader (Audience). This is why I shall give some references, where you find also other ones.
Further problems indicate the efficiency of this theory now. All these demonstrate the usual procedure of mathematics and the (teaching) methodology as well: We start with a concrete problem, then extend it further, step-by-step by creating new manipulations, concepts and methods. So we get a theory at certain abstraction level. Then newer problems arise, etc.
This paper is an extended version of the presentation and the conference paper [7]. The author thanks the Organizers, especially their head Professor Margita Pavlekovic for the invitation, support and for the kind atmosphere of the conference. -
Report of meeting Researches in Didactics of Mathematics and Computer Sciences: January 30 - February 1, 2009, Debrecen, Hungary
165-186Views:148The meeting Researches in Didactics of Mathematics and Computer Sciences was held in Debrecen, Hungary from January 30 to February 1, 2009. The 49 Hungarian participants – including 15 PhD students – came from 18 cities and represented 29 institutions of higher education. The abstracts of the talks and the posters and also the list of participants are presented in this report. -
Sequenced problems for functional equations
179-192Views:140There are many possible methods to solve equations of the form H(f(x + y), f(x − y), f(x), f(y), x, y) = 0 (x, y 2 R), where H is a known function and f is the unknown function to be determined. Here we will create a sequence of problems for equations of type (1) (see on the next page). These sequenced problems are appropriate for the fostering of talented students on different level of mathematical education. -
Programming Theorems and Their Applications
213-241Views:293One of the effective methodological approaches in programming that supports the design and development of reliable software is analogy-based programming. Within this framework, the method of problem reduction plays a key role. Reducing a given problem to another one whose solving algorithm is already known can be made more efficient by the application of programming theorems. These represent proven, abstract solutions – in a general form – to some of the most common problems in programming. In this article, we present six fundamental programming theorems as well as pose five sample problems. In solving these problems, all six programming theorems will be applied. In the process of reduction, we will employ a concise specification language. Programming theorems and solutions to the problems will be given using the structogram form. However, we will use pseudocodes as descriptions of algorithms resembling their actual implementation in Python. A functional style solution to one of the problems will also be presented, which is to illustrate that for the implementation in Python, it is sufficient to give the specification of the problem for the design of the solution. The content of the article essentially corresponds to that of the introductory lectures of a course we offered to students enrolled in the Applied Mathematics specialization.
Subject Classification: D40
-
Report of Meeting Researches in Didactics of Mathematics and Computer Sciences: January 26-28, 2018 Hajdúszoboszló, Hungary
131-153Views:175The meeting Researches in Didactics of Mathematics and Computer Sciences was held in Hajdúszoboszló, Hungary from the 26th to the 28th of January, 2018. It was organized by the Doctoral School of Mathematical and Computational Sciences of University of Debrecen.
The 61 participants – including 47 lectures and 17 PhD students – came from 8 countries, 21 cities and represented 37 institutions of higher and secondary education. -
Report of meeting Researches in Didactics of Mathematics and Computer Sciences: January 24-26, 2014 Eger, Hungary
117-134Views:165The meeting Researches in Didactics of Mathematics and Computer Sciences
was held in Eger, Hungary from the 24th to the 26th of January, 2014 at the
Eszterházy Károly College. It was organized by the PhD School of Mathematics and Computer Sciences of the University of Debrecen and the Eszterházy Károly College in Eger.
The 58 participants – including 43 lecturers and 18 PhD students – came from 7 countries, 15 cities and represented 22 institutions of higher education. -
Cultivating algorithmic thinking: an important issue for both technical and HUMAN sciences
107-116Views:163Algorithmic 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. -
Decomposition of triangles into isosceles triangles I: let the students ask bravely
163-184Views:152We report about working up an open geometric problem as a mathematical research with pupils of a mathematics camp. This paper shows the didactic aims and the methods we worked with, the didactic results. The second part of this paper gives a general solution of the problem, using pure mathematics and a computer programme. -
Mathematics in Good Will Hunting II: problems from the students perspective
3-19Views:254This is the second part of a three paper long series exploring the role of mathematicians and of the mathematical content occurring in popular media. In particular we analyze the drama film Good Will Hunting. Here we investigate the mathematical content of the movie by considering the problems appearing in it. We examine how a mathematician or a mathematics student would solve these problems. Moreover, we review how these problems could be integrated into the higher education of Hungary. -
New style in teaching word processing
417-426Views:136Teaching word processing is confined to looking through some menus and showing some functions of a word processor program, although technology presents just a small part of forming layouts. This fact causes that people who are writing documents spend a lot of time by trying to form, e.g., title pages or inner pages.
The present paper deals with a design of an online course on word processing that fits better the needs of many users. The online course is designed for teaching (LA)TEX by leading the students to the technical issues of the typesetting system through layout and grammar rules: demonstrates the most important basic recommendations of typography and grammar rules through samples, and shows how to program the currently displayed layout in the (LA)TEX programming languages. This methodology suits better the common working habit, and can be a useful help in word processing documents. -
Aspects théoriques de la classification à base de treillis
125-135Views:193La classification est une notion cruciale dans les systémes orientés objets et se fait de plus en plus présente en représentation de connaissances. Elle permet principalement de trouver des regularités dans un grand tableau de nombres. Dans ce sens général, il s'agit donc d'une méthode qui joue un role important dans différents domaines scientifiques oú les connaissances sont á organiser selon certaines hiérarchies (biologie, chimie, etc.). En informatique nous parlons aussi de langages de classes sans mentionner es aspects mathématiques de la classification. Dans cet article l'auteur a pour but de proposer une introduction á la classification á travers la notion de treillis. Nous sommes persuadés que l'étude de la classification permet aux étudiants de familiariser leurs connaissances sur la modélisation et la programmation orientée objet.
The classification is a crucial notion in the object oriented systems and more and more appears in the knowledge representation. It allows us to find the regularities in a huge table of numbers. In this general sense the classification plays an important role in various domains of science, where knowledge has to be organized into hierarchy (biology, chemistry, etc.) In the computer science the languages of classes are often studied without mathematical aspects of the classification. In this paper the author has the goal to propose an introduction to the classification through the notion of lattices.We are convinced that the study of classification allows students to enlarge their knowledge on the object oriented modelling and programming.
Database Logos
Keywords
Issues by Year
2020
2017
2011
2010
2009
2007
2006
2005
2004
2003