PB111 Principles of low-level programming

Faculty of Informatics
Spring 2025
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 (seminar tutor)
Bc. Tomáš Pavlík (seminar tutor)
Bc. Vladimír Uhlík (seminar tutor)
Tomáš Waldsberger (seminar tutor)
Jozef Sabo (seminar tutor)
Pavol Trnavský (seminar tutor)
RNDr. Samuel Pastva, Ph.D. (seminar tutor)
Bc. Erik Sedlák (seminar tutor)
Matej Korž (seminar tutor)
Bc. Tomáš Rohlínek (seminar tutor)
Karel Čermák (seminar tutor)
Patrik Novák (seminar tutor)
Bc. Jakub Rádl (seminar tutor)
RNDr. Lukáš Ručka (seminar tutor)
Samuel Malec (seminar tutor)
Bc. Petr Kubica (seminar tutor)
Ing. Jan Král, Ph.D. (seminar tutor)
Jiří Pastrňák (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
Fri 21. 2. to Fri 16. 5. Fri 16:00–17:50 140
  • Timetable of Seminar Groups:
PB111/01: Mon 17. 2. to Mon 12. 5. Mon 16:00–17:50 C122, P. Ročkai
PB111/02: Tue 18. 2. to Tue 13. 5. Tue 10:00–11:50 C122, V. Uhlík
PB111/03: Wed 19. 2. to Wed 14. 5. Wed 8:00–9:50 C121, A. Matoušek
PB111/04: Thu 20. 2. to Thu 15. 5. Thu 8:00–9:50 C122; and Mon 19. 5. 8:00–9:50 C122, T. Waldsberger
PB111/05: Tue 18. 2. to Tue 13. 5. Tue 18:00–19:50 C121, J. Sabo
PB111/06: Thu 20. 2. to Thu 15. 5. Thu 14:00–15:50 C122; and Mon 19. 5. 14:00–15:50 C122, T. Pavlík
PB111/07: Wed 19. 2. to Wed 14. 5. Wed 14:00–15:50 C122, T. Pavlík
PB111/08: Mon 17. 2. to Mon 12. 5. Mon 12:00–13:50 C121, P. Trnavský
PB111/09: Mon 17. 2. to Mon 12. 5. Mon 18:00–19:50 C122, S. Pastva
PB111/10: Thu 20. 2. to Thu 15. 5. Thu 10:00–11:50 C122; and Mon 19. 5. 10:00–11:50 C122, J. Král
PB111/11: Tue 18. 2. to Tue 13. 5. Tue 8:00–9:50 C122, E. Sedlák
PB111/12: Wed 19. 2. to Wed 14. 5. Wed 18:00–19:50 C121, M. Korž
PB111/13: Mon 17. 2. to Mon 12. 5. Mon 10:00–11:50 C121, T. Rohlínek
PB111/14: Tue 18. 2. to Tue 13. 5. Tue 12:00–13:50 C121, T. Rohlínek
PB111/15: Wed 19. 2. to Wed 14. 5. Wed 12:00–13:50 C121, K. Čermák
PB111/16: Thu 20. 2. to Thu 15. 5. Thu 16:00–17:50 C122; and Mon 19. 5. 16:00–17:50 C122, L. Ručka
PB111/17: Mon 17. 2. to Mon 12. 5. Mon 8:00–9:50 C121, J. Rádl
PB111/18: Thu 20. 2. to Thu 15. 5. Thu 12:00–13:50 C121; and Mon 19. 5. 12:00–13:50 C121, P. Novák
PB111/19: Mon 17. 2. to Mon 12. 5. Mon 14:00–15:50 C122, S. Malec
PB111/20: Tue 18. 2. to Tue 13. 5. Tue 10:00–11:50 C121, P. Kubica
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
Course objectives
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.
Syllabus
  • Block 1: Model of computation
    1. abstract machine,
    2. automatic variables, structured control flow,
    3. subroutines and their invocation,
    4. address of a variable, array, record.

  • Block 2: Using and Organizing Memory
    5. flat memory, sorting and searching,
    6. linked lists in flat memory,
    7. dynamic allocation, bump allocator, malloc,
    8. first-fit allocator, free.

  • Block 3: Data Structures and Algorithms
    9. dynamic array, realloc,
    10. binary heap, priority queue,
    11. hash tables with fixed and variable-length keys,
    12. search trees.

Teaching methods
lecture, weekly programming exercises, seminars, 3 assignment sets
Assessment methods
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.
  • Enrolment Statistics (recent)
  • Permalink: https://is.muni.cz/course/fi/spring2025/PB111