<ol> <li>Intorduction to logic (propositions, logical connectives, truth of propositions, introduction to propositional and predicate logic).</li> <li>Introduction to relations and sets (sets, relations, relations to computer sicence, properties of relations, partial orders, equivalences, partition and factor set, binary relations and graphs, functions and their types, bijections, finite, countable and uncountable sets).</li> <li>Natural numbers, number systems, binary representation of numbers.</li> <li>Induction and recursion.</li> <li>Basic combinatorial considerations.</li> <li>Alphabet, string, code, language.</li> <li>Concept of algorithm (intuitive understanding, formalizations, finite automaton as a simple example).</li> <li>Concept of problem (intuitive understanding, formalization, decision problems, undecidable problems).</li> <li>Introduction to complexity of algorithms. Reducibility of problems. Hard problems and how to cope with them.</li> <li>Selected applications.</li> </ol>
|
-
Bělohlávek R. (2008). Úvod do informatiky. Učební text, Katedra informatiky, UP 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. (2001). Introduction to Algorithms. Second Edition.. MIT Press.
-
Goodaire E. G., Parmenter M. M. (1998). Discrete Mathematics with Graph Theory. Prentice-Hall, Inc.
-
Grimaldi R. (1999). Discrete and Combinatorial Mathematics. An Applied Introduction. 4th ed.. Addison Wesley, Reading, MA.
-
Gruska J. (1997). Foundations of Computing. International Thompson Computer Press.
-
Maurer S. B., Ralston A. (1991). Discrete Algorithmic Mathematics. Addison Wesley.
|