IB111 Foundations of Programming

Faculty of Informatics
Autumn 2026
Extent and Intensity
2/2/2. 5 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
In-person direct teaching
Teacher(s)
prof. Ing. Tomáš Vojnar, Ph.D. (lecturer)
Mgr. Marek Trtík, Ph.D. (lecturer)
RNDr. Lukáš Ručka (seminar tutor)
RNDr. Samuel Pastva, Ph.D. (seminar tutor)
Bc. Vladimír Uhlík (seminar tutor)
Karel Čermák (seminar tutor)
RNDr. Jakub Gajarský, Ph.D. (seminar tutor)
Jiří Pastrňák (assistant)
prof. RNDr. Jiří Barnat, Ph.D. (seminar tutor)
Mgr. Tomáš Foltýnek, Ph.D. (seminar tutor)
Ing. Josef Melkus (seminar tutor)
Karel Pýcha (seminar tutor)
Lukáš Ševc (seminar tutor)
Jan Samek (seminar tutor)
Matúš Bárány (seminar tutor)
Matej Opálený (seminar tutor)
Bc. Boris Lukačovič (seminar tutor)
Juraj Osuský (seminar tutor)
Peter Rakšány (seminar tutor)
Bc. Martin Tvarožek (seminar tutor)
Iva Kasprzaková (seminar tutor)
Bc. et Bc. Jakub Rádl (seminar tutor)
Bc. Samuel Malec (seminar tutor)
Bc. Pavol Trnavský (seminar tutor)
Tomáš Hutňan (seminar tutor)
Bc. Tomáš Marek (seminar tutor)
Jozef Sabo (seminar tutor)
Jana Jarošová (seminar tutor)
Robin Drozd (seminar tutor)
Anna Tomalová (seminar tutor)
Ivan Hrabčák (seminar tutor)
Patrik Novák (seminar tutor)
Sebastian Vaško Da Silva (seminar tutor)
Martin Sedlák (seminar tutor)
Peter Hazlinger (seminar tutor)
Danny Ryška (seminar tutor)
Šimon Jelínek (seminar tutor)
Ella Gyurkovská (seminar tutor)
Pavla Bártová (seminar tutor)
Guaranteed by
prof. Ing. Tomáš Vojnar, Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics
Contact Person: prof. Ing. Tomáš Vojnar, Ph.D.
Supplier department: Department of Computer Systems and Communications – Faculty of Informatics
Prerequisites (in Czech)
! IB113 Intro to Programming & Algs && !NOW( IB113 Intro to Programming & Algs )
Předmět je určen primárně studentům informatických programů. Ostatním studentům je doporučeno zapsat si předmět IB113.
Course Enrolment Limitations
The course is only offered to the students of the study fields the course is directly associated with.
fields of study / plans the course is directly associated with
there are 6 fields of study the course is directly associated with, display
Abstract
The course is an introduction to programming and algorithmic style of thinking.
Learning outcomes
At the end of the course students should be able to: understand and apply basic constructs of programming languages (e.g., conditions, loops, functions, basic data types); write and debug a program in Python; use basic data types and structures (strings, lists, dictionaries); describe several basic algorithms; describe main conventions and recommended programming style.
Key topics
  • The course shows the basic elements of imperative programming and algorithmic thinking using the high-level programming language Python as an example.
  • Basic notions of imperative programming languages: variables and their semantics, expressions and statements, branching, cycles; subroutines (functions), passing parameters (calling functions), pure functions, predicates.
  • Numerical computation, basic data types, using the random generator.
  • Data structures, ADT, lists, strings, multidimensional arrays, sets, dictionaries, the basic of using objects to create user-defined data structures.
  • The basics of testing and debugging, preconditions and postconditions, type annotation.
  • Examples of basic algorithms: greatest common divisor, prime numbers, sorting algorithms, searching.
  • The efficiency of algorithms, the basics of complexity, the complexity of basic data structures operations.
  • Recursion and its specifics in the imperative paradigm, tail recursion; using recursion to work with tree data structures and to solve constraint satisfaction problems (the basics of the backtracking technique).
  • Interaction with the environment (I/O), turtle graphics, bitmap graphics, text processing.
  • Program design, programming styles and conventions, readability and maintainability of code, documentation and comments.
Study resources and literature
    recommended literature
  • PELÁNEK, Radek. Programátorská cvičebnice: algoritmy v příkladech. Brno: Computer Press, 2012, 175 pp. ISBN 978-80-251-3751-2. info
  • GUZDIAL, Mark and Barbara ERICSON. Introduction to computing & programming in Python : a multimedia approach. 2nd ed. Upper Saddle River [N.J.]: Prentice Hall, 2010, xxiii, 401. ISBN 9780136060239. info
  • ZELLE, John M. Python programming : an introduction to computer science. Wilsonville: Franklin, Beedle &Associates, 2004, xiv, 514. ISBN 1887902996. info
Approaches, practices, and methods used in teaching
lectures, programming seminars, homeworks (programming)
Method of verifying learning outcomes and course completion requirements
Assesment consists of 3 parts: homeworks, mid-term and final programming tests, final written test.
Language of instruction
Czech
Follow-Up Courses
Further Comments
The course is taught annually.
The course is taught every week.
Listed among pre-requisites of other courses
The course is also listed under the following terms Autumn 2009, Autumn 2010, Autumn 2011, Autumn 2012, Autumn 2013, Autumn 2014, Autumn 2015, Autumn 2016, Autumn 2017, Autumn 2018, Autumn 2019, Autumn 2020, Autumn 2021, Autumn 2022, Autumn 2023, Autumn 2024, Autumn 2025.
  • Enrolment Statistics (recent)
  • Permalink: https://is.muni.cz/course/fi/autumn2026/IB111