# Subject description - BE5B01DMG

Summary of Study | Summary of Branches | All Subject Groups | All Subjects | List of Roles | Explanatory Notes               Instructions
BE5B01DMG Discrete Mathematics and Graphs
Roles:P Extent of teaching:3P+1S
Department:13101 Language of teaching:EN
Guarantors:Demlová M. Completion:Z,ZK
Lecturers:Russo T. Credits:5
Tutors:Russo T. Semester:Z

Anotation:

The aim of the course is to introduce students to fundamentals of Discrete Mathematics with focus on electrical engineering. The content of the course covers fundamentals of propositional and predicate logic, infinite sets with focus on the notion of cardinality of sets, binary relations with focus on equivalences and partial orderings; integers, relation modulo; algebraic structures including Boolean algebras. Further, the course covers basics of the Theory of Graphs.

Study targets:

The goal of the course is to introduce students with the basic notions from discrete mathematics, namely logic, basics of set theory, binary relationsand binary operations; basics from graph theory and combinatorics.

Content:

 1 Foundation of Propositional logic, Boolean calculus. 2 Foundation of Predicate logic, quantifiers, interpretation. 3 Sets, cardinality of sets, countable and uncountable sets. 4 Binary relations on a set, equivalence relation, partial order. 5 Integers, Euclid (extended) algorithms. 6 Relation modulo n, congruence classes Zn and operations on Zn. 7 Algebraic operations, semigroups, groups. 8 Sets together with two binary operations, Boolean algebras. 9 Rings of congruence classes Zn, fields Zp. 10 Undirected graphs, trees and spanning trees. 11 Directed graphs, strong connectivity and acyclic graphs. 12 Euler graphs and Hamiltonian graphs, coloring. 13 Combinatorics.

Course outlines:

 1 Foundation of Propositional logic, Boolean calculus 2 Foundation of Predicate logic, quantifiers, interpretation. 3 Sets, cardinality of sets, countable and uncountable sets. 4 Binary relations on a set, equivalence relation, partial order. 5 Integers, Euclid (extended) algorithms. 6 Relation modulo n, congruence classes Zn and operations on Zn. 7 Algebraic operations, semigroups, groups. 8 Sets together with two binary operations, Boolean algebras. 9 Rings of congruence classes Zn, fields Zp. 10 Undirected graphs, trees and spanning trees. 11 Directed graphs, strong connectivity and acyclic graphs. 12 Euler graphs and Hamiltonian graphs, coloring. 13 Combinatorics.

Exercises outline:

 1 Foundations of propositional and predicate logic. 2 Binary relations, equivalence and partial order. 3 Euclid algorithm, relation modulo n, congruence classes modulo n and operations with them. 4 Algebraic operations, semigroups, groups, fields Zp, Boolean algebras. 5 Undirected graphs, trees, spanning trees. 6 Directed graphs, strong connectivity, acyclic graphs. 7 Combinatorics.

Literature:

  Lindsay N. Childs: A Concrete Introduction to Higher Algebra, Springer; 3rd edition (November 26, 2008), ISBN-10: 0387745270  Richard Johnsonbaugh: Discrete Mathematics, Prentice Hall, 4th edition (1997), ISBN 0-13-518242-5

Requirements:

None.

Webpage:

https://math.feld.cvut.cz/0educ/BE5B01DMG.html

Keywords:

Propositional and predicate logic, sets and their cardinality, binary relations, Euclid's algorithm, rezidual classes, semigroups, groups, undirected and directed graphs, trees, strong connectivity, acyclic graphs, combinatorics.

Subject is included into these academic programs:

 Program Branch Role Recommended semester BEECS Common courses P 1 BPEECS_2018 Common courses P 1

 Page updated 3.7.2020 17:51:56, semester: Z,L/2020-1, L/2019-20, Send comments about the content to the Administrators of the Academic Programs Proposal and Realization: I. Halaška (K336), J. Novák (K336)