Discrete Mathematics and Graphs

Garant předmětu:

Marie Demlová

Přednášející:

Daniel Gromada

Cvičící:

Daniel Gromada

Předmět zajišťuje:

katedra matematiky

Anotace:

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.

Požadavky:

None.

Osnova přednášek:

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.

Osnova cvičení:

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.

Cíle studia:

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.

Studijní materiály:

[1] Lindsay N. Childs: A Concrete Introduction to Higher Algebra, Springer; 3rd edition (November 26, 2008), ISBN-10: 0387745270

[2] Richard Johnsonbaugh: Discrete Mathematics, Prentice Hall, 4th edition (1997), ISBN 0-13-518242-5

Poznámka:

Další informace:

https://math.fel.cvut.cz/en/people/russotom/Teaching/DMG21-22.html

Rozvrh na zimní semestr 2023/2024:

	06:00–08:0008:00–10:0010:00–12:0012:00–14:0014:00–16:0016:00–18:0018:00–20:0020:00–22:0022:00–24:00
Po	místnost T2:C2-82 Gromada D. 09:15–10:45 (přednášková par. 1) Dejvice T2:C2-82
Út
St	místnost T2:C2-82 Gromada D. 16:15–17:00 (přednášková par. 1) Dejvice T2:C2-82místnost T2:C2-82 Gromada D. 17:00–17:45 (přednášková par. 1 paralelka 101) Dejvice T2:C2-82
Čt
Pá

Rozvrh na letní semestr 2023/2024:

Rozvrh není připraven

Předmět je součástí následujících studijních plánů:

• Electrical Engineering and Computer Science (EECS) (povinný předmět programu)
• Electrical Engineering and Computer Science (EECS) (povinný předmět programu)