FI:IB110 Introduction to Informatics - Course Information
IB110 Introduction to Informatics
Faculty of InformaticsAutumn 2012
- Extent and Intensity
- 2/2. 4 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
- Teacher(s)
- prof. RNDr. Ivana Černá, CSc. (lecturer)
RNDr. Nikola Beneš, Ph.D. (seminar tutor)
RNDr. Mária Svoreňová, Ph.D. (seminar tutor) - Guaranteed by
- prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics - Timetable
- Thu 8:00–9:50 B410
- Timetable of Seminar Groups:
IB110/T01AA: Mon 16:00–17:55 Učebna S2 (36b), M. Svoreňová
IB110/01: Thu 10:00–11:50 B410, N. Beneš - Prerequisites (in Czech)
- ! 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.
- fields of study / plans the course is directly associated with
- Public Administration Informatics (programme FI, B-AP)
- Embedded Systems (programme FI, N-IN)
- Service Science, Management and Engineering (programme FI, N-AP)
- Social Informatics (programme FI, B-AP)
- 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.
- Syllabus
- 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.
- Literature
- 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 homeworks during the term. Final written test.
- Language of instruction
- Czech
- Further Comments
- Study Materials
The course is taught annually. - Teacher's information
- https://is.muni.cz/auth/el/1433/podzim2010/IB110/index.qwarp
- Enrolment Statistics (Autumn 2012, recent)
- Permalink: https://is.muni.cz/course/fi/autumn2012/IB110