FI:IB001 Intro to Prog. using C - Course Information
IB001 Introduction to Programming using CFaculty 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. Peter Bálint (seminar tutor)
Mgr. Luděk Bártek, Ph.D. (seminar tutor)
RNDr. Mgr. Jaroslav Bayer (seminar tutor)
RNDr. Jiří Glozar (seminar tutor)
Mgr. Jan Juráň (seminar tutor)
RNDr. Adam Kučera, Ph.D. (seminar tutor)
Mgr. Lukáš Másilko (seminar tutor)
RNDr. Jaromír Plhák, Ph.D. (seminar tutor)
Mgr. Martin Stančík (seminar tutor)
Mgr. Jiří Weiser (seminar tutor)
- Guaranteed by
- doc. RNDr. Eva Hladká, Ph.D.
Department of Computer Systems and Communications - Faculty of Informatics
Contact Person: RNDr. Jaroslav Pelikán, Ph.D.
Supplier department: Department of Computer Systems and Communications - Faculty of Informatics
- Mon 12:00–13:50 D1
- Timetable of Seminar Groups:
IB001/01: Tue 12:00–13:50 A215, L. Bártek
IB001/02: Mon 14:00–15:50 B311, L. Bártek
IB001/03: Mon 18:00–19:50 A215, L. Bártek
IB001/04: Wed 18:00–19:50 B116, P. Bálint
IB001/05: Thu 18:00–19:50 A215, P. Bálint
IB001/06: Mon 8:00–9:50 A215, J. Bayer
IB001/07: Tue 8:00–9:50 A215, J. Bayer
IB001/08: Tue 10:00–11:50 A215, J. Bayer
IB001/09: Tue 14:00–15:50 A215, M. Stančík
IB001/10: Wed 8:00–9:50 A215, M. Stančík
IB001/11: Thu 14:00–15:50 A215, M. Stančík
IB001/12: Wed 16:00–17:50 A215, J. Weiser
IB001/13: Tue 18:00–19:50 B311, J. Weiser
IB001/14: Mon 18:00–19:50 B117, J. Weiser
IB001/15: Thu 16:00–17:50 B117, J. Juráň
IB001/16: Thu 12:00–13:50 B116, J. Juráň
IB001/17: Tue 18:00–19:50 B116, A. Kučera
IB001/18: Tue 16:00–17:50 A215, A. Kučera
IB001/19: Tue 10:00–11:50 B116, J. Plhák
IB001/20: Thu 14:00–15:50 B116, J. Plhák
- ! NOW ( IB111 Intro to Programming ) && ! IB111 Intro to Programming
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)
- Informatics with another discipline (programme FI, B-EB)
- Informatics with another discipline (programme FI, B-FY)
- Informatics with another discipline (programme FI, B-IO)
- Informatics with another discipline (programme FI, B-MA)
- Informatics with another discipline (programme FI, B-TV)
- 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)
- Embedded Systems (programme FI, N-IN)
- Service Science, Management and Engineering (programme FI, N-AP)
- Social Informatics (programme FI, B-AP)
- Artificial Intelligence and Natural Language Processing (programme FI, B-IN)
- Course objectives
- The main aim of the course Introduction to Programming using C is to introduce students to basic principles of computer problem-solving. This course is based on the use of the C 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 C programming language;
debug a created program.
- Programming languages, compiler.
- Output functions, constants, expressions.
- Variables, declarations, input functions.
- Assignment statement, conditional statement, loops.
- Algorithms based on recurrence relation.
- Data types (abstraction, representation, data processing): array, string, struct, union, file.
- Functions, parameters, recursion.
- Numerical algorithms: precision, errors.
- Non-numerical algorithms: text processing.
- Algorithm analysis: correctness, efficiency.
- Pointer type. Dynamic data structures.
- HEROUT, Pavel. Učebnice jazyka C. 6. vyd. České Budějovice: Kopp, 2009. 271, viii. ISBN 9788072323838. info
- KERNIGHAN, Brian W. Programovací jazyk C. Edited by Dennis M. Ritchie. 1. vyd. Brno: Computer Press, 2006. 286 s. ISBN 802510897X. info
- Učíme se programovat v jazyce C. Edited by Václav Kadlec. Vyd. 1. Praha: Computer Press, 2002. xiii, 277. ISBN 8072267159. info
- CORMEN, Thomas H. Introduction to algorithms. 2nd ed. Cambridge, Mass.: MIT Press, 2001. xxi, 1180. ISBN 0070131511. info
- Teaching methods
- Theoretical lectures with examples - 2 hours per week (the attendance is optional), class exercises - 2 hours per week (class exercises take place in a computer classroom, the attendance is mandatory, and the students also must successfully pass intrasemestral tests and make homeworks).
- Assessment methods
- Assesment consists of 3 parts: 4 homeworks (points are subtracted for each incorrect homework - max. 4), 2 intrasemestral tests with computer usage (total 60 points), and final written exam (40 points). It is required to obtain at least 56 points to pass the exam successfully. It is necessary to obtain at least 30 points from intrasemestral tests (after subtraction of points from incorrect homeworks) to pass a "credit".
- 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
- Enrolment Statistics (recent)
- Permalink: https://is.muni.cz/course/fi/autumn2015/IB001