Discrete Mathematics and Theory of Algorithms

No Thumbnail Available

Date

2022

Journal Title

Journal ISSN

Volume Title

Publisher

Sumy State University
Lecture notes

Date of Defense

Scientific Director

Speciality

Date of Presentation

Abstract

A discrete mathematics and theory of algorithms course has more than one purpose. Students should learn a particular set of mathematical facts and how to apply them; more importantly, such a course should teach students how to think logically and mathematically. To achieve these goals, this text stresses mathematical reasoning and the different ways problems are solved. Two important themes are interwoven in this text: inductions and recursions and counting. A successful discrete mathematics and theory of algorithms course should carefully blend and balance two these themes. In the lecture materials, we used a number of books, among which we will single out the wonderful book by [1]. In the second part of the lecture notes, we consider the following sections: “Inductions and Recursions” and “Counting”.

Keywords

дискретна математика, алгоритми, discrete math, algorithms

Citation

Dvornichenko A. V., Lysenko O. V. Discrete Mathematics and Theory of Algorithms : lecture notes for students of speciality 113”Applied Mathematics” of full-time course of stud.: in four parts. P. 2. Sumy : Sumy State University, 2022. 148 p.

Endorsement

Review

Supplemented By

Referenced By