Lecturer(s)
|
-
Tříska Jan, Mgr. Ph.D.
-
Laštovička Jan, Mgr. Ph.D.
-
Kolařík Miroslav, doc. RNDr. Ph.D.
-
Juračka Jakub, Mgr.
|
Course content
|
Introduction to propositional logic (axiomatic system, concept of proof). Introduction to predicate logic (language, notion of structure for language and truth in structure, example of PROLOG language). Brief on fuzzy logic and modal logic. Fundamentals of elementary number theory (divisibility, prime numbers, Euclidean algorithm, congruence modulo n and residue classes). Selected numerical functions, growth rates. Basic algebraic structures with one and two binary operations. Real number sequences, their properties and limits. Infinite series and their convergence and divergence criteria. Graphs (graph scores, Eulerian moves, vertex colouring of graphs, flows in networks). Probability (classical definition of probability, finite probability space, probability calculation, random variable, expected value, variance).
|
Learning activities and teaching methods
|
Lecture, Demonstration
|
Learning outcomes
|
Students will learn the basics of discrete structures and discrete mathematics used in computer science.
|
Prerequisites
|
KMI DISK1 Discrete structures 1
|
Assessment methods and criteria
|
Oral exam, Written exam
Completion of assigned tasks. Passing an oral or written examination.
|
Recommended literature
|
-
Bělohlávek R. (2020). Diskrétní struktury. Katedra informatiky, Olomouc.
-
Bělohlávek R., Vychodil V. (2006). Diskrétní matematika pro informatiky I, II.. Katedra informatiky.
-
Brookshear J. G. (2013). Informatika. Computer Press.
-
Cormen T. H., Leiserson C. E., Rivest R. L., Stein C. (2009). Introduction to Algorithms. 3rd ed.. MIT Press.
-
Goodaire E. G., Parmenter M. M. (2005). Discrete Mathematics with Graph Theory, 3rd ed.. Prentice Hall.
-
Grimaldi R. (2003). Discrete and Combinatorial Mathematics. An Applied Introduction. 5th ed.. Pearson, Reading, MA.
-
Maurer S. B., Ralston A. (2005). Discrete Algorithmic Mathematics. 3rd ed.. A K Peters/CRC Press.
|