Přístupnostní navigace
E-application
Search Search Close
Course detail
FSI-SDMAcad. year: 2024/2025
The subject Methods of discrete mathematics gets students acquainted with basic areas of set theory, discrete mathematics, and applied algebra. The first area is formed by relations between sets and on sets with a stress on partially ordered sets. The next area covers Axiom of Choice and cardinal and ordinal numbers. After that, lattice theory is discussed with the main interest focused on the theory of Bolean algebras. Then the algebraic theory of automata and formal languages follows. The last area is an introduction to the coding theory. Thus, all the three areas represent theoretical fundamentals of informatics. With respect to the expansion of using computers in all branches of engineering, the acquired knowledge is necessary for graduates in mathematical engineering.
Language of instruction
Number of ECTS credits
Mode of study
Guarantor
Department
Entry knowledge
Rules for evaluation and completion of the course
The course unit credit is awarded on condition of having attended the seminars actively and passed a written test. The exam has a written and an oral part. The written part tests student's ability to deal with various problems using the knowledge and skills acquired in the course. In the oral part, the student has ro prove that he or she has mastered the related theory.
Aims
The course aims to acquaint the students with some usual methods of discrete mathematics used in various applications, especially in computer science for construction and process description of computers and for data transmission. The students will get a proof that, beside the continuous mathematics, also discrete mathematics is a basic discipline whose knowledge is a necessary condition for a successful creative work of an engineer.
The students will learn about the fundamentals of ordered sets, lattices and Boolean algebras. They will learn to minimize Boolean functions and realize them by logic circuits. They will also get acquainted with the most usual types of automata and their properties, with regular languages and with the problem of determinism. Finally, thay will also get an image of the basic problems connected with coding and decoding of messages..
Study aids
Prerequisites and corequisites
Basic literature
Recommended literature
Classification of course in study plans
specialization CZS , 1 year of study, winter semester, elective
Lecture
Teacher / Lecturer
Syllabus
Exercise