FI:IB001 Intro to Prog. using C - Course Information
IB001 Introduction to Programming using C
Faculty of InformaticsAutumn 2018
The course is not taught in Autumn 2018
- 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. 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 - Prerequisites
- !NOW( IB111 Foundations of Programming ) && ! IB111 Foundations of 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
- there are 18 fields of study the course is directly associated with, display
- 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. - Syllabus
- 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.
- Literature
- 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
- Czech
- Further comments (probably available only in Czech)
- Course is no more offered.
The course is taught: every week. - Listed among pre-requisites of other courses
- Teacher's information
- http://www.fi.muni.cz/usr/pelikan/Vyuka/Vyuk2.html
- Enrolment Statistics (Autumn 2018, recent)
- Permalink: https://is.muni.cz/course/fi/autumn2018/IB001