Course details
Discrete Mathematics
IDM Acad. year 2003/2004 Winter semester 6 credits
The sets, relations and mappings. The topology and the continuous mapping. The structures with one and two operations. Equivalences and partitions. Posets. Lattices and Boolean algebras.The proposional calculus. The normal forms of formulas. Deduction. The proving techniques. The elementary notions of the graph theory. Connectedness. Subgraphs and morphisms of graphs. Planarity. Trees and their properties. Simple graph algorithms.
Guarantor
Language of instruction
Completion
Time span
Department
Subject specific learning outcomes and competences
The student will obtain the basic orientation in mathematics as well as the foundations of the discrete mathematics, logic and related mathematical structures: elementary topology, binary relations, posets, lattices, groups, graphs etc.
Learning objectives
The modern conception of the subject yields a fundamental mathematical knowledge which is necessary for a number of related courses. The student will be acquainted with basic facts and knowledge from the set theory, topology and especially the discrete mathematics with focus on the mathematical structures applicable in computer science.
Progress assessment
The active attendance of the computer practices.
Course inclusion in study plans
- Programme IT-BC-3, field BIT, 1st year of study, Compulsory
- Programme IT-BC-3 (in English), field BIT, 1st year of study, Compulsory