Course: Introduction to Computer Science

« Back
Course title Introduction to Computer Science
Course code KMI/YUDI
Organizational form of instruction Lecture
Level of course Bachelor
Year of study not specified
Semester Winter
Number of ECTS credits 9
Language of instruction Czech
Status of course unspecified
Form of instruction Face-to-face
Work placements This is not an internship
Recommended optional programme components None
Lecturer(s)
  • Kolařík Miroslav, doc. RNDr. Ph.D.
  • Krupka Michal, doc. RNDr. Ph.D.
Course content
<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>

Learning activities and teaching methods
Lecture
Learning outcomes
The course introduces the fundamental concepts of computer science.
1. Knowledge Describe and comprehense basics of informatics.
Prerequisites
unspecified

Assessment methods and criteria
Student performance

Exam: oral exam.
Recommended literature
  • Bělohlávek R. (2008). Úvod do informatiky. Učební text, Katedra informatiky, UP Olomouc.
  • CORMEN, T. H., LEISERSON C. E., RIVEST D. L., STEIN C. (2001). Introduction to Algorithms, Second Edition. MIT 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.
  • KNUTH, D. (2005). The Art of Computer Programming, Volume 3, Sorting and Searching, Second Edition. Addison-Wesley.
  • Maurer S. B., Ralston A. (1991). Discrete Algorithmic Mathematics. Addison Wesley.
  • Preparata F. P.. (1973). Introduction to Discrete Structures. For Computer Science and Engineering.. Addison Wesley, Reading, MA.
  • SEDGEWICK, R. (2003). Algoritmy v C, části 1- 4: základy, datové struktury, třídění, vyhledávání. Praha, Softpress.
  • WIRTH, N. (1989). Algoritmy a štruktúry údajov. Alfa.


Study plans that include the course
Faculty Study plan (Version) Branch of study Category Recommended year of study Recommended semester