Course detail
Mathematical Principles of Computer Science
FSI-VZI-KAcad. year: 2018/2019
The course provides students with the introduction to mathematical computer science. Basic mathematical structures of the branch are discussed, their properties and implementation. C# is used as an implementation tool. Practical use of theorems and consequents is demonstrated on the implementation of simple technical applications.
Language of instruction
Number of ECTS credits
Mode of study
Guarantor
Learning outcomes of the course unit
Prerequisites
Co-requisites
Planned learning activities and teaching methods
Assesment methods and criteria linked to learning outcomes
Course curriculum
Work placements
Aims
Specification of controlled education, way of implementation and compensation for absences
Recommended optional programme components
Prerequisites and corequisites
Basic literature
Recommended reading
M.Chytil: Automaty a gramatiky.
Classification of course in study plans
Type of course unit
Guided consultation
Teacher / Lecturer
Syllabus
2. The list, queue, stack structures, designs of representation and implementation.
3. Generalization of the list; oriented graph, its representation and implementation.
4. Breadth-first and depth-first search of graph, combined search; the use of queue and stack.
5. Approaches to implementation of evaluated graph, search in evaluated graph.
6. Special graph topologies (sp. trees, binary trees), representation and implementation, basics of use. AND/OR graphs.
7. Languages and grammars. Chomsky’s classification of languages.
8. Finite automatons and grammars, representation.
9. Finite automaton without stack, representation.
10. Finite automaton with stack, representation.
11. Turing machine, enumeratibility, algorithm complexity.
12. Basic concepts of fuzzy sets theory.
13. Recapitulation.