IB001 Introduction to Programming using C

Faculty of Informatics
Autumn 2014
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)
RNDr. Igor Chalás (seminar tutor)
Mgr. Jan Juráň (seminar tutor)
RNDr. Adam Jurčík, Ph.D. (seminar tutor)
RNDr. Adam Kučera, Ph.D. (seminar tutor)
Mgr. Dušan Lago (seminar tutor)
Mgr. Lukáš Másilko (seminar tutor)
RNDr. Jaromír Plhák, Ph.D. (seminar tutor)
RNDr. Tomáš Raček (seminar tutor)
Mgr. Boris Ranto (seminar tutor)
Mgr. Karel Štěpka, Ph.D. (seminar tutor)
Mgr. Jiří Weiser (seminar tutor)
RNDr. Aleš Zlámal (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
Timetable
Wed 8:00–9:50 D1, Wed 8:00–9:50 D3
  • Timetable of Seminar Groups:
IB001/T01: Tue 16. 9. to Fri 19. 12. Tue 11:20–12:55 Učebna S7 (18), Fri 19. 9. to Fri 19. 12. Fri 12:30–14:05 Učebna S7 (18), J. Glozar, Nepřihlašuje se. Určeno pro studenty se zdravotním postižením.
IB001/01: Tue 16:00–17:50 A215, L. Bártek
IB001/02: Tue 18:00–19:50 A215, L. Bártek
IB001/03: Wed 12:00–13:50 A215, L. Bártek
IB001/04: Mon 18:00–19:50 A215, P. Bálint
IB001/05: Thu 16:00–17:50 A215, P. Bálint
IB001/06: Mon 12:00–13:50 B117, A. Jurčík
IB001/07: Tue 12:00–13:50 A215, A. Jurčík
IB001/08: Tue 16:00–17:50 B116, K. Štěpka
IB001/09: Mon 16:00–17:50 A215, K. Štěpka
IB001/10: Thu 8:00–9:50 B117, J. Bayer
IB001/11: Thu 10:00–11:50 B117, J. Bayer
IB001/12: Tue 14:00–15:50 B117, J. Weiser
IB001/13: Wed 18:00–19:50 B116, J. Weiser
IB001/14: Thu 12:00–13:50 A215, J. Juráň
IB001/15: Thu 10:00–11:50 A215, J. Juráň
IB001/16: Mon 8:00–9:50 A215, I. Chalás
IB001/17: Wed 10:00–11:50 B117, I. Chalás
IB001/18: Tue 10:00–11:50 B116, I. Chalás
IB001/19: Tue 8:00–9:50 A215, I. Chalás
IB001/20: Thu 18:00–19:50 A215, A. Kučera
IB001/21: Wed 12:00–13:50 B116, A. Kučera
IB001/22: Mon 14:00–15:50 B117, A. Zlámal
IB001/23: Mon 10:00–11:50 A215, A. Zlámal
IB001/24: Mon 14:00–15:50 A215, A. Jurčík
Prerequisites
! 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 the course is directly associated with
there are 19 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)
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
The course is also listed under the following terms Autumn 2002, Autumn 2003, Autumn 2004, Autumn 2005, Autumn 2006, Autumn 2007, Autumn 2008, Autumn 2009, Autumn 2010, Autumn 2011, Autumn 2012, Autumn 2013, Autumn 2015.
  • Enrolment Statistics (Autumn 2014, recent)
  • Permalink: https://is.muni.cz/course/fi/autumn2014/IB001