PB111 Principles of Low-level Programming

Faculty of Informatics
Spring 2026
Extent and Intensity
2/2/1. 4 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).
In-person direct teaching
Teacher(s)
RNDr. Petr Ročkai, Ph.D. (lecturer)
Mgr. Adam Matoušek (assistant)
Jiří Pastrňák (assistant)
Bc. Vladimír Uhlík (seminar tutor)
Jozef Sabo (seminar tutor)
Pavol Trnavský (seminar tutor)
RNDr. Samuel Pastva, Ph.D. (seminar tutor)
Bc. Matej Korž (seminar tutor)
Bc. Tomáš Rohlínek (seminar tutor)
Karel Čermák (seminar tutor)
Bc. et Bc. Jakub Rádl (seminar tutor)
RNDr. Lukáš Ručka (seminar tutor)
Bc. Samuel Malec (seminar tutor)
Peter Rakšány (seminar tutor)
Martin Cimbál (seminar tutor)
Robin Drozd (seminar tutor)
Samuel Filip (seminar tutor)
Filip Horňák (seminar tutor)
Ivan Hrabčák (seminar tutor)
Filip Chrobok (seminar tutor)
Ján Kováč (seminar tutor)
Filip Kovalík (seminar tutor)
Ondrej Kubáň (seminar tutor)
Mgr. Lukáš Másilko (seminar tutor)
Jakub Matula (seminar tutor)
Matej Opálený (seminar tutor)
Karel Pýcha (seminar tutor)
Jan Samek (seminar tutor)
Matej Slivka (seminar tutor)
Lukáš Ševc (seminar tutor)
Martin Šmilňák (seminar tutor)
Anna Tomalová (seminar tutor)
Kristián Koribský (assistant)
Guaranteed by
RNDr. Petr Ročkai, Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics
Supplier department: Department of Computer Systems and Communications – Faculty of Informatics
Timetable
Wed 18. 2. to Wed 13. 5. Wed 16:00–17:50 FAST/R229
  • Timetable of Seminar Groups:
PB111/01: Mon 16. 2. to Mon 11. 5. Mon 10:00–11:50 A219, L. Ručka
PB111/02: Wed 18. 2. to Wed 13. 5. Wed 8:00–9:50 C121, L. Ručka
PB111/02_nahrada: Wed 18. 2. to Wed 13. 5. Wed 8:00–9:50 C121, L. Ručka
PB111/03: Tue 17. 2. to Tue 12. 5. Tue 8:00–9:50 A219, S. Pastva
PB111/04: Thu 19. 2. to Thu 14. 5. Thu 10:00–11:50 A219, V. Uhlík
PB111/05: Mon 16. 2. to Mon 11. 5. Mon 16:00–17:50 A219, J. Rádl
PB111/06: Tue 17. 2. to Tue 12. 5. Tue 14:00–15:50 A219, J. Rádl
PB111/07: Mon 16. 2. to Mon 11. 5. Mon 16:00–17:50 C122, T. Rohlínek
PB111/08: Mon 16. 2. to Mon 11. 5. Mon 12:00–13:50 C122, T. Rohlínek
PB111/09: Tue 17. 2. to Tue 12. 5. Tue 12:00–13:50 A219, P. Trnavský
PB111/10: Thu 19. 2. to Thu 14. 5. Thu 14:00–15:50 A219, J. Samek
PB111/11: Thu 19. 2. to Thu 14. 5. Thu 18:00–19:50 C122, M. Korž
PB111/11_nahrada: Thu 19. 2. to Thu 14. 5. Thu 18:00–19:50 C122, M. Korž
PB111/12: Tue 17. 2. to Tue 12. 5. Tue 16:00–17:50 A219, S. Malec
PB111/13: Mon 16. 2. to Mon 11. 5. Mon 14:00–15:50 C122, P. Rakšány
PB111/14: Mon 16. 2. to Mon 11. 5. Mon 18:00–19:50 A219, J. Sabo
PB111/15: Wed 18. 2. to Wed 13. 5. Wed 12:00–13:50 A219, K. Čermák
PB111/16: Thu 19. 2. to Thu 14. 5. Thu 8:00–9:50 C121, L. Ševc
PB111/16_nahrada: Thu 19. 2. to Thu 14. 5. Thu 8:00–9:50 C121, L. Ševc
PB111/17: Fri 20. 2. to Fri 15. 5. Fri 8:00–9:50 C121, M. Cimbál
PB111/17_nahrada: Fri 20. 2. to Fri 15. 5. Fri 8:00–9:50 C121, M. Cimbál
PB111/18: Wed 18. 2. to Wed 13. 5. Wed 18:00–19:50 A219, K. Pýcha
PB111/19: Mon 16. 2. to Mon 11. 5. Mon 14:00–15:50 A219, M. Slivka
PB111/20: Mon 16. 2. to Mon 11. 5. Mon 18:00–19:50 C121, F. Chrobok
PB111/21: Tue 17. 2. to Tue 12. 5. Tue 10:00–11:50 A219, S. Filip
PB111/22: Mon 16. 2. to Mon 11. 5. Mon 8:00–9:50 C121, A. Tomalová
PB111/23: Tue 17. 2. to Tue 12. 5. Tue 18:00–19:50 A219, O. Kubáň
PB111/24: Thu 19. 2. to Thu 14. 5. Thu 18:00–19:50 A219, R. Drozd
PB111/25: Thu 19. 2. to Thu 14. 5. Thu 8:00–9:50 C122, I. Hrabčák
PB111/25_nahrada: Thu 19. 2. to Thu 14. 5. Thu 8:00–9:50 C122, I. Hrabčák
PB111/26: Fri 20. 2. to Fri 15. 5. Fri 8:00–9:50 S405, M. Opálený
PB111/26_nahrada: Fri 20. 2. to Fri 15. 5. Fri 8:00–9:50 S405, M. Opálený
PB111/27: Tue 17. 2. to Tue 12. 5. Tue 10:00–11:50 C121, F. Horňák
PB111/27_nahrada: Tue 17. 2. to Tue 12. 5. Tue 10:00–11:50 C121, F. Horňák
PB111/28: Wed 18. 2. to Wed 13. 5. Wed 12:00–13:50 C122, F. Kovalík
PB111/28_nahrada: Wed 18. 2. to Wed 13. 5. Wed 12:00–13:50 C122, F. Kovalík
PB111/29: Wed 18. 2. to Wed 13. 5. Wed 14:00–15:50 C121, M. Šmilňák
PB111/29_nahrada: Wed 18. 2. to Wed 13. 5. Wed 14:00–15:50 C121, M. Šmilňák
PB111/30: Wed 18. 2. to Wed 13. 5. Wed 8:00–9:50 C122, J. Kováč
PB111/30_nahrada: Wed 18. 2. to Wed 13. 5. Wed 8:00–9:50 C122, J. Kováč
PB111/31: Thu 19. 2. to Thu 14. 5. Thu 14:00–15:50 C122, J. Matula
PB111/31_nahrada: Thu 19. 2. to Thu 14. 5. Thu 14:00–15:50 C122, J. Matula
PB111/32: Tue 24. 3. 8:00–9:50 C121, Tue 21. 4. 8:00–9:50 C121, Tue 19. 5. 8:00–9:50 C121, L. Másilko
PB111/33_nahrada: Fri 10. 4. 10:00–11:50 A219
PB111/34_nahrada: Fri 10. 4. 10:00–11:50 C121
PB111/35_nahrada: Fri 10. 4. 12:00–13:50 A219
PB111/36_nahrada: Fri 10. 4. 12:00–13:50 C121
PB111/37_nahrada: Fri 10. 4. 14:00–15:50 C121
PB111/38_nahrada: Fri 10. 4. 14:00–15:50 C122
Prerequisites
IB111 Foundations of Programming && PB151 Computer Systems
Ability to apply basic elements of programming – control flow, data definitions, abstraction, decomposition, recursion.
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 38 fields of study the course is directly associated with, display
Abstract
Familiarize students with computational resource of a computer, learn about their relationship with more abstract notions of computation and, in particular, gain detailed knowledge about key abstractions and their implementation: variables, branching and looping, subroutines and their invocation, parameter passing, return values, layout of data in memory – arrays, records, dynamic allocation. Further expand the ability to decompose computational problems and build more complex abstractions out of the aforementioned building blocks.
Learning outcomes
Students will be, after completing this course, able to:
• name and describe basic abstractions used in programming
• describe their implementation using elementary computational machinery
• write simplified versions of standard subroutines for memory and data manipulation
• write a simple program in C.
Key topics
  • Block 1: Model of computation
    1. abstract machine,
    2. local variables, structured control flow,
    3. subroutines and their invocation,
    4. pointers.
  • Block 2: Using and Organizing Memory
    5. arrays, indices,
    6. record types (structures), linked lists,
    7. lifetime, resources,
    8. allocation of array elements.
  • Block 3: Data representation, data structures
    9. sets and dictionaries,
    10. byte arrays, value representation,
    11. dynamic memory, graphs
    12. data representation of a program.
Approaches, practices, and methods used in teaching
lecture, weekly programming exercises, seminars, 3 assignment sets
Method of verifying learning outcomes and course completion requirements
Semester work (by individual choice): active participation in seminars + weekly programming exercises + 3 sets of more complex assignments + 3 midterm programming tests. Graded in four-week blocks. Exam: programming test using a school computer without internet access.
Language of instruction
Czech
Follow-Up Courses
Further Comments
Study Materials
The course is taught annually.
Listed among pre-requisites of other courses
The course is also listed under the following terms Spring 2024, Spring 2025.
  • Enrolment Statistics (recent)
  • Permalink: https://is.muni.cz/course/fi/spring2026/PB111