FI:IB110 Introduction to Informatics - Course Information
IB110 Introduction to InformaticsFaculty of Informatics
- Extent and Intensity
- 2/2/0. 3 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
- prof. RNDr. Ivana Černá, CSc. (lecturer)
- Guaranteed by
- prof. RNDr. Ivana Černá, CSc.
Department of Computer Science - Faculty of Informatics
Supplier department: Department of Computer Science - Faculty of Informatics
- Tue 14:00–15:50 B410
- Timetable of Seminar Groups:
- ! IB102 Automata and Grammars && ! IB005 Formal languages and Automata
- Course Enrolment Limitations
- The course is only offered to the students of the study fields the course is directly associated with.
The capacity limit for the course is 35 student(s).
Current registration and enrolment status: enrolled: 37/35, only registered: 1/35
- Fields of study the course is directly associated with
- there are 46 fields of study the course is directly associated with, display
- Course objectives
- The main objectives of the course is to acquaint students with the concepts, ideas, methods, and results fundamental to computer science. It is not specifically about computer technology, nor is it about computer programming. At the end of the course students should understand basics of theoretical computer science, algorithmics, and computational complexity.
- Learning outcomes
- After enrolling the course students are able:
- understandt the concept of algorithms,
- explain the Church - Turing hypothesis and the formal definition of the algorithm as a Turing machine,
- design simple finite automaton and Turing machine,
- explain the concept of nondeterminism,
- differentiate between recursive and nonrecursive problems,
- identify basic recursive and nonrecursive problems,
- explain the concept of computational complexity,
- identify basic polynomially solvable and hard problems.
- Algorithmic problem and the algorithm that solves it. The structure of algorithms, the data they manipulate, their correctness and efficiency (mainly time efficiency). Inherent limitations of effectively executable algorithms, inefficiency and intractability. Complexity classes, the P vs NP problem. Noncomputability and undecidability.
- required literature
- HROMKOVIČ, Juraj. Sedem divov informatiky. xi, 336. ISBN 9788080849580. info
- not specified
- HAREL, David and Yishai A FELDMAN. Algorithmics :the spirit of computing. 3rd ed. Harlow: Addison-Wesley, 2004. xviii, 514. ISBN 0-321-11784-0. info
- Teaching methods
- lectures and seminars Lectures give a theoretical background which is consequently applied in seminars to specific problems and tasks
- Assessment methods
- Lectures and seminars with tests during the term. Final written test.
- Language of instruction
- Further Comments
- Study Materials
The course is taught annually.
- Teacher's information
- Enrolment Statistics (recent)
- Permalink: https://is.muni.cz/course/fi/autumn2019/IB110