IB001 Introduction to Programming

Faculty of Informatics
Autumn 2011
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. et Mgr. Vít Baisa, Ph.D. (seminar tutor)
Mgr. Peter Bálint (seminar tutor)
Mgr. Luděk Bártek, Ph.D. (seminar tutor)
RNDr. Mgr. Jaroslav Bayer (seminar tutor)
RNDr. Jan Byška, Ph.D. (seminar tutor)
RNDr. Jiří Glozar (seminar tutor)
RNDr. Igor Chalás (seminar tutor)
Mgr. Jan Juráň (seminar tutor)
RNDr. Milan Kabát (seminar tutor)
Mgr. Marek Klučár (seminar tutor)
RNDr. Ing. Bc. Tomáš Majtner, Ph.D. (seminar tutor)
Mgr. Lukáš Másilko (seminar tutor)
Mgr. Ondřej Nečas (seminar tutor)
RNDr. Matej Pivoluska, Ph.D. (seminar tutor)
RNDr. Jaromír Plhák, Ph.D. (seminar tutor)
Mgr. Martin Stančík (seminar tutor)
Mgr. Karel Štěpka, Ph.D. (seminar tutor)
Mgr. Vilém Šustr (seminar tutor)
RNDr. Marek Vinkler, Ph.D. (seminar tutor)
Mgr. Petr Volný (seminar tutor)
Mgr. Jiří Weiser (seminar tutor)
Mgr. et Mgr. Tomáš Sklenák (assistant)
doc. RNDr. Petr Švenda, Ph.D. (assistant)
Guaranteed by
prof. RNDr. Luděk Matyska, CSc.
Department of Computer Systems and Communications – Faculty of Informatics
Contact Person: RNDr. Jaroslav Pelikán, Ph.D.
Timetable
Thu 17:00–18:50 D1, Thu 17:00–18:50 D3, Thu 17:00–18:50 D2
  • Timetable of Seminar Groups:
IB001/01: Wed 8:00–9:50 B117, V. Baisa
IB001/02: Wed 10:00–11:50 B117, V. Baisa
IB001/03: Wed 14:00–15:50 B117, K. Štěpka
IB001/04: Wed 16:00–17:50 B117, K. Štěpka
IB001/05: Mon 16:00–17:50 A104, T. Majtner
IB001/06: Mon 18:00–19:50 A104, T. Majtner
IB001/07: Mon 8:00–9:50 B116, J. Plhák
IB001/08: Mon 10:00–11:50 B116, J. Plhák
IB001/09: Wed 20:00–21:50 B116, P. Volný
IB001/10: Tue 12:00–13:50 A104, M. Vinkler
IB001/11: Tue 14:00–15:50 A104, M. Vinkler
IB001/12: Wed 16:00–17:50 B116, V. Šustr
IB001/13: Wed 18:00–19:50 B116, V. Šustr
IB001/14: Mon 12:00–13:50 B117, J. Bayer
IB001/15: Mon 14:00–15:50 B117, J. Bayer
IB001/16: Wed 8:00–9:50 B116, J. Bayer
IB001/17: Mon 16:00–17:50 B117, L. Bártek
IB001/18: Thu 14:00–15:50 B116, L. Bártek
IB001/19: Wed 12:00–13:50 B117, L. Bártek
IB001/20: Fri 8:00–9:50 B117, J. Byška
IB001/21: Fri 10:00–11:50 B117, J. Byška
IB001/22: Mon 18:00–19:50 B117, M. Stančík
IB001/23: Tue 10:00–11:50 B117, M. Stančík
IB001/24: Tue 12:00–13:50 B116, I. Chalás
IB001/25: Tue 18:00–19:50 B116, I. Chalás
IB001/26: Mon 8:00–9:50 A104, J. Weiser
IB001/27: Wed 18:00–19:50 A104, J. Weiser
IB001/28: Mon 8:00–9:50 B117, M. Klučár
IB001/29: Thu 8:00–9:50 B117, M. Klučár
IB001/30: Fri 16:00–17:50 B116, P. Bálint
IB001/31: Tue 20:00–21:50 B116, P. Bálint
IB001/32: Thu 14:00–15:50 A104, J. Juráň
IB001/33: Thu 16:00–17:50 A104, J. Juráň
IB001/34: Mon 18:00–19:50 B116, M. Pivoluska
IB001/35: Tue 18:00–19:50 A104, M. Pivoluska
IB001/36: Thu 8:00–9:50 A104, M. Kabát
IB001/37: Thu 10:00–11:50 A104, M. Kabát
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
there are 19 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 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, practical lessons.
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, the attendance is mandatory, and the students also must successfully pass intrasemestral tests).
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 2012, Autumn 2013, Autumn 2014, Autumn 2015.
  • Enrolment Statistics (Autumn 2011, recent)
  • Permalink: https://is.muni.cz/course/fi/autumn2011/IB001