The Recurrence Relations in Teaching Students of Informatics

The topic “Recurrence relations” and its place in teaching students of Informatics is discussed in this paper. We represent many arguments about the importance, the necessity and the benefit of studying this subject by Informatics students. They are based on investigation of some fundamental books a...

Full description

Saved in:
Bibliographic Details
Published inInformatics in education Vol. 9; no. 2; pp. 159 - 170
Main Author Bakoev, Valentin
Format Journal Article
LanguageEnglish
Published Vilnius Vilniaus Universiteto Leidykla 01.01.2010
Vilnius University Press
Institute of Mathematics and Informatics
Vilnius University Institute of Mathematics and Informatics, Lithuanian Academy of Sciences
Vilnius University
Subjects
Online AccessGet full text
ISSN1648-5831
2335-8971
DOI10.15388/infedu.2010.10

Cover

Loading…
More Information
Summary:The topic “Recurrence relations” and its place in teaching students of Informatics is discussed in this paper. We represent many arguments about the importance, the necessity and the benefit of studying this subject by Informatics students. They are based on investigation of some fundamental books and textbooks on Discrete Mathematics, Algorithms and Data Structures, Combinatorics, etc. Somemethodological aspects of training to solve problems with applying recurrence relations are also given. We hope that the considered topics concern also the school teachers in Mathematics and Informatics and the paper will be useful to them.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1648-5831
2335-8971
DOI:10.15388/infedu.2010.10