FI:IB001 Intro to Programming - Course Information
IB001 Introduction to ProgrammingFaculty of Informatics
- 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).
- RNDr. Jaroslav Pelikán, Ph.D. (lecturer)
Mgr. Luděk Bártek, Ph.D. (seminar tutor)
RNDr. Michal Batko, Ph.D. (seminar tutor)
RNDr. Mgr. Jaroslav Bayer (seminar tutor)
RNDr. Jiří Glozar (seminar tutor)
Mgr. Lukáš Másilko (seminar tutor)
Mgr. Petr Medek (seminar tutor)
Mgr. Ondřej Nečas (seminar tutor)
RNDr. Jaromír Plhák, Ph.D. (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.
- Tue 14:00–15:50 D3
- Timetable of Seminar Groups:
IB001/02: Wed 10:00–11:50 B117, L. Bártek
IB001/03: Wed 14:00–15:50 B117, L. Bártek
IB001/04: Wed 16:00–17:50 B117, L. Bártek
IB001/05: Wed 8:00–9:50 B116, M. Batko
IB001/06: Wed 10:00–11:50 B116, 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 8:00–9:50 B117, J. Plhák
IB001/10: Thu 10:00–11:50 B117, J. Plhák
IB001/11: Tue 16:00–17:50 B116, A. Zlámal
IB001/12: Mon 12:00–13:50 B116, J. Bayer
IB001/13: Mon 14:00–15:50 B116, J. Bayer
IB001/14: Thu 16:00–17:50 B116, P. Medek
- 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
- there are 23 fields of study the course is directly associated with, display
- 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.
- 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.
- 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
- Teaching methods
- Theoretical lectures with examples, practical lessons, homeworks.
- 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
- Further comments (probably available only in Czech)
- Study Materials
The course is taught annually.
- Listed among pre-requisites of other courses
- Teacher's information