FI:IB001 Intro to Programming - Course Information
IB001 Introduction to Programming
Faculty of InformaticsAutumn 2008
- Extent and Intensity
- 2/2. 4 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).
- Teacher(s)
- RNDr. Jaroslav Pelikán, Ph.D. (lecturer)
Mgr. Luděk Bártek, Ph.D. (seminar tutor)
RNDr. Michal Batko, Ph.D. (seminar tutor)
doc. RNDr. Jiří Filipovič, Ph.D. (seminar tutor)
RNDr. Jiří Glozar (seminar tutor)
Mgr. Lukáš Másilko (seminar tutor)
RNDr. Jiří Materna, Ph.D. (seminar tutor)
RNDr. Petr Medek, Ph.D. (seminar tutor)
Mgr. Ondřej Nečas (seminar tutor)
RNDr. Pavel Šmerk, Ph.D. (seminar tutor)
RNDr. Aleš Zlámal (seminar tutor) - Guaranteed by
- prof. RNDr. Václav Matyáš, M.Sc., Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics
Contact Person: RNDr. Jaroslav Pelikán, Ph.D. - Timetable
- Tue 14:00–15:50 D3
- Timetable of Seminar Groups:
IB001/02: Tue 16:00–17:50 B117, L. Bártek
IB001/03: Thu 10:00–11:50 B117, L. Bártek
IB001/04: Thu 14:00–15:50 B117, L. Bártek
IB001/05: Wed 8:00–9:50 B117, M. Batko
IB001/06: Wed 10:00–11:50 B117, M. Batko
IB001/07: Fri 8:00–9:50 B117, P. Šmerk
IB001/08: Fri 10:00–11:50 B117, P. Šmerk
IB001/09: Thu 16:00–17:50 B117, P. Medek
IB001/10: Thu 18:00–19:50 B117, P. Medek
IB001/11: Mon 18:00–19:50 B117, J. Materna
IB001/12: Thu 10:00–11:50 A104, A. Zlámal
IB001/13: Mon 8:00–9:50 A104, J. Filipovič - Prerequisites
- Knowledge of PC computer handling (on a user level).
- Course Enrolment Limitations
- The course is also offered to the students of the fields other than those the course is directly associated with.
- fields of study / plans the course is directly associated with
- Applied Informatics (programme FI, B-AP)
- Bioinformatics (programme FI, B-AP)
- Economic Information Systems (programme ESF, B-SI)
- Informatics with another discipline (programme FI, B-BI)
- Informatics with another discipline (programme FI, B-FY)
- Informatics with another discipline (programme FI, B-GE)
- Informatics with another discipline (programme FI, B-GK)
- Informatics with another discipline (programme FI, B-CH)
- Informatics with another discipline (programme FI, B-IO)
- Informatics with another discipline (programme FI, B-MA)
- Informatics with another discipline (programme FI, B-SO)
- Informatics with another discipline (programme FI, B-TV)
- Informatics (programme FI, B-IN)
- Mathematical Informatics (programme FI, B-IN)
- Mathematics with Informatics (programme PřF, N-MA)
- Parallel and Distributed Systems (programme FI, B-IN)
- Computer Graphics and Image Processing (programme FI, B-IN)
- Computer Networks and Communication (programme FI, B-IN)
- Computer Systems and Data Processing (programme FI, B-IN)
- Programmable Technical Structures (programme FI, B-IN)
- Artificial Intelligence and Natural Language Processing (programme FI, B-IN)
- Course objectives
- The main aim of the course Introduction to Programming is to introduce students to basic principles of computer problem-solving. This course is based on the use of the Pascal programming language.
At the end of this course, students should be able to:
design an algorithm to solve a given problem;
code an algorithm in the Pascal programming language;
debug a created program. - Syllabus
- Programming languages, compiler.
- Output statements, constants, expressions.
- Variables, input statements.
- Assignment statement, conditional statement, loops.
- Algorithms based on recurrence relation.
- Data types (abstraction, representation, data processing): array, string, set, record, file, text file.
- Procedures and functions, parameters, recursion, side effect.
- Numerical algorithms: precision, errors.
- Non-numerical algorithms: text processing.
- Algorithm analysis: correctness, efficiency.
- Pointer type. Dynamic data structures.
- Literature
- Borland Pacsal 7.0 manuál, Borland International, 1992
- DRÓZD, Januš and Rudolf KRYL. Začínáme s programováním. 1. vyd. Praha: Grada, 1992, 306 s. ISBN 80-85424-41-X. info
- WIRTH, Niklaus. Algoritmy a štruktúry údajov. Translated by Pavol Fischer. 2. vyd. Bratislava: Alfa, 1989, 481 s. ISBN 80-05-00153-3. info
- Assessment methods
- Lectures - 2 hours per week (the attendance is optional), class exercises - 2 hours per week (class exercises take place in a computer classroom and the attendance is mandatory, the students also must submit all required homeworks and successfully pass intrasemestral test).
The examination consists of two parts: the theoretical part (written examination without computers, 60 minutes, 5 questions) and the practical part (written examination with a computer usage, 70 minutes. During this part students code a program solving a given problem). The practical part can be passed only after a successful passing of the theoretical part. - Language of instruction
- Czech
- Further comments (probably available only in Czech)
- Study Materials
The course is taught annually. - Listed among pre-requisites of other courses
- Teacher's information
- http://www.fi.muni.cz/usr/pelikan/Vyuka/Vyuk2.html
- Enrolment Statistics (Autumn 2008, recent)
- Permalink: https://is.muni.cz/course/fi/autumn2008/IB001