Přístupnostní navigace
E-application
Search Search Close
Course detail
FSI-9MDMAcad. year: 2020/2021
The subject makes students acquainted with some basic methods of discrete mathematics employed in (not only technical) practice. The content can be divided into four areas. The first of them is logic, especially the propositional and predicate logic, and its applications in computer science. The second area is formed by the graph theory with an emphasis on the graph algorithms utilized for solving optimization problems of different kinds. The next area is algebra and its applications in the theory of formal languages and automata. The last area is represented by the fundamentals of coding theory, especially the linear codes are discussed.
Language of instruction
Mode of study
Guarantor
Department
Learning outcomes of the course unit
Prerequisites
Co-requisites
Planned learning activities and teaching methods
Assesment methods and criteria linked to learning outcomes
Course curriculum
Work placements
Aims
Specification of controlled education, way of implementation and compensation for absences
Recommended optional programme components
Prerequisites and corequisites
Basic literature
Recommended literature
Classification of course in study plans
Lecture
Teacher / Lecturer
Syllabus