PB071 Principles of low-level programming

Faculty of Informatics
Spring 2023
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).
Teacher(s)
doc. RNDr. Petr Švenda, Ph.D. (lecturer)
Mgr. Roman Lacko (seminar tutor)
Mgr. Luděk Bártek, Ph.D. (seminar tutor)
Bc. Patrik Bašo (seminar tutor)
Bc. Martin Bendel (seminar tutor)
Bc. Adéla Bierská (seminar tutor)
Bc. Martin Cmiel (seminar tutor)
Bc. Tamara Čierniková (seminar tutor)
Michal Duda (seminar tutor)
Bc. Juraj Fiala (seminar tutor)
Bc. Matej Focko (seminar tutor)
Bc. Jan Glos (seminar tutor)
Mgr. Samuel Gorta (seminar tutor)
Bc. Kristína Hanicová (seminar tutor)
Bc. Veronika Hanulíková (seminar tutor)
Aleš Horna (seminar tutor)
Bc. Lubomír Hrbáček (seminar tutor)
Miroslav Jaroš (seminar tutor)
Bc. Tomáš Jaroš (seminar tutor)
Mgr. Jan Jedelský (seminar tutor)
Bc. Martin Jediný (seminar tutor)
Mgr. Vojtěch Jelínek (seminar tutor)
Bc. Tomáš Jusko (seminar tutor)
Mgr. Petr Kadlec (seminar tutor)
Ing. Bc. Michaela Kecskésová (seminar tutor)
Matej Kučera (seminar tutor)
Oliver Leško (seminar tutor)
Bc. Juraj Marcin (seminar tutor)
Bc. Ota Mikušek (seminar tutor)
Adam Mydla (seminar tutor)
Mgr. Patrick Ondika (seminar tutor)
Miroslav Patlevič (seminar tutor)
Bc. Bruno Petrus (seminar tutor)
Bc. Daniel Rozehnal (seminar tutor)
RNDr. Lukáš Ručka (seminar tutor)
Mgr. Radoslav Sabol (seminar tutor)
Bc. Jindřich Sedláček (seminar tutor)
Mgr. Bc. Roman Solař (seminar tutor)
Bc. Michal Šoltis (seminar tutor)
Štěpán Šonovský (seminar tutor)
Bc. Dávid Šutor (seminar tutor)
Mgr. Ing. Bc. Přemysl Till (seminar tutor)
Mgr. Denis Varga (seminar tutor)
Bc. Filip Bartek (assistant)
Pavol Biačko (assistant)
Bc. Jiří Buchta (assistant)
Boris Hajduk (assistant)
Bc. Patrik Horák (assistant)
Bc. Jakub Judiny (assistant)
Mgr. Jakub Bartolomej Košuth (assistant)
Bc. Tomáš Menšík (assistant)
Bc. Ondřej Metelka (assistant)
Mgr. Imrich Nagy (assistant)
Bc. Adam Parák (assistant)
Bc. Lukáš Poul (assistant)
Mgr. Peter Stanko (assistant)
Vít Špunda (assistant)
David Štorek (assistant)
RNDr. Martin Ukrop, Ph.D. (assistant)
Bc. Jan Zatloukal (assistant)
Guaranteed by
doc. RNDr. Petr Švenda, Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics
Supplier department: Department of Computer Systems and Communications – Faculty of Informatics
Timetable
Mon 13. 2. to Mon 15. 5. Mon 16:00–17:50 D2, Mon 16:00–17:50 D1
  • Timetable of Seminar Groups:
PB071/01: Fri 17. 2. to Fri 12. 5. Fri 10:00–11:50 B011, L. Bártek
PB071/02: Tue 14. 2. to Tue 9. 5. Tue 18:00–19:50 B011, M. Bendel
PB071/03: Tue 14. 2. to Tue 9. 5. Tue 18:00–19:50 A215, A. Bierská, V. Hanulíková
PB071/04: Thu 16. 2. to Thu 11. 5. Thu 18:00–19:50 B311, A. Bierská, L. Hrbáček
PB071/05: Wed 15. 2. to Wed 10. 5. Wed 12:00–13:50 A219, S. Gorta, Š. Šonovský
PB071/06: Wed 15. 2. to Wed 10. 5. Wed 16:00–17:50 A219, S. Gorta, M. Kecskésová
PB071/07: Thu 16. 2. to Thu 11. 5. Thu 16:00–17:50 A219, T. Čierniková, K. Hanicová
PB071/08: Thu 16. 2. to Thu 11. 5. Thu 18:00–19:50 A219, K. Hanicová, M. Šoltis
PB071/09: Mon 13. 2. to Mon 15. 5. Mon 18:00–19:50 A219, M. Jaroš
PB071/10: Tue 14. 2. to Tue 9. 5. Tue 14:00–15:50 B130, M. Cmiel, V. Jelínek
PB071/11: Mon 13. 2. to Mon 15. 5. Mon 18:00–19:50 B011, V. Jelínek, M. Patlevič
PB071/12: Thu 16. 2. to Thu 11. 5. Thu 16:00–17:50 B011, J. Jedelský, P. Kadlec
PB071/13: Tue 14. 2. to Tue 9. 5. Tue 8:00–9:50 B011, T. Jaroš, R. Lacko
PB071/14: Tue 14. 2. to Tue 9. 5. Tue 8:00–9:50 B130, J. Glos, J. Marcin
PB071/15: Thu 16. 2. to Thu 11. 5. Thu 8:00–9:50 B011, M. Duda, L. Ručka
PB071/16: Wed 15. 2. to Wed 10. 5. Wed 12:00–13:50 B011, A. Horna, L. Ručka
PB071/17: Thu 16. 2. to Thu 11. 5. Thu 10:00–11:50 A219, M. Jediný, R. Sabol
PB071/18: Wed 15. 2. to Wed 10. 5. Wed 12:00–13:50 B130, P. Ondika, R. Sabol
PB071/19: Tue 14. 2. to Tue 9. 5. Tue 10:00–11:50 B011, M. Kučera, D. Šutor
PB071/20: Fri 17. 2. to Fri 12. 5. Fri 12:00–13:50 A215, P. Till
PB071/21: Thu 16. 2. to Thu 11. 5. Thu 16:00–17:50 B116, D. Varga
PB071/22: Wed 15. 2. to Wed 10. 5. Wed 18:00–19:50 B011, J. Fiala, A. Mydla
PB071/23: Fri 17. 2. to Fri 12. 5. Fri 8:00–9:50 B130, M. Focko
PB071/24: Thu 16. 2. to Thu 11. 5. Thu 10:00–11:50 B011, P. Bašo
PB071/25: Fri 17. 2. to Fri 12. 5. Fri 8:00–9:50 B011, O. Mikušek
PB071/26: Tue 14. 2. to Tue 9. 5. Tue 16:00–17:50 B011, T. Jusko
PB071/27: Wed 15. 2. to Wed 10. 5. Wed 10:00–11:50 A219, T. Jusko
PB071/28: Wed 15. 2. to Wed 10. 5. Wed 14:00–15:50 A219, J. Fiala, A. Mydla
PB071/29: Tue 14. 2. to Tue 9. 5. Tue 16:00–17:50 C416, O. Leško
PB071/30: Wed 15. 2. to Wed 10. 5. Wed 18:00–19:50 B411, O. Leško
PB071/31: Tue 14. 2. to Tue 9. 5. Tue 12:00–13:50 B130, B. Petrus
PB071/32: Tue 14. 2. to Tue 9. 5. Tue 16:00–17:50 B311, D. Rozehnal
PB071/33: Tue 14. 2. to Tue 9. 5. Tue 12:00–13:50 B011, J. Sedláček
PB071/34: Wed 15. 2. to Wed 10. 5. Wed 14:00–15:50 B130, T. Jaroš
PB071/35: Wed 15. 2. to Wed 10. 5. Wed 10:00–11:50 B130, M. Duda, P. Kadlec, záložní skupina
PB071/36: Wed 15. 2. to Wed 10. 5. Wed 16:00–17:50 B011, M. Cmiel, R. Solař, záložní skupina
PB071/37: Wed 15. 2. to Wed 10. 5. Wed 8:00–9:50 A219, M. Focko, záložní skupina
Prerequisites
Students are expected to have the basic knowledge of algorithmization in Python or another procedural language. Students are also required to have user experience with Unix/Linux OS, as homework is submitted and tested on a Unix/Linux server.
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
At the end of the course students should be able to:
Understand and use basic C syntax according to ANSI and ISO/IEC norms.
Decompose given problem and perform practical implementation.
Use modern development tools (IDE, debugger, version control...).
Understand basic C functions for POSIX system.
Annotate source code with possibility to automatically generate documentation. Understand and practically use documentation for existing functions.
Use and follow programming best practices.
Compile programs both under Unix/Linux and Windows.
Learning outcomes
After a course completion, the student will be able to:
- write non-trivial programs in C language;
- use basic development tools including IDE, debugger, versioning system and dynamic analysis of memory use;
- understand code execution on the level of CPU and memory;
- use dynamic allocation and apply correct deallocation where necessary;
- write programs with an application of good programming practices;
Syllabus
  • Historical background of the C language. Its relation to the Unix OS.
  • C compilers under Unix and MS-DOS/MS-Windows, integrated development environment, debugger, version control. Good programming practices, testing.
  • Data types, constants, declarations, expressions. Assignment expressions and statements.
  • Basic program structure. Preprocessor statements. Comments. Control structures. Relational expressions. Elementary I/O operations.
  • Arrays and pointers. Functions. Calling by value, passing arguments by pointer.
  • User defined data types. Dynamic memory allocation.
  • I/O in details. Using files. Wide characters.
  • Strings and string manipulation. Standard C library according to ANSI and ISO/IEC standards. Calling Unix core services. Further Unix libraries for C. POSIX C Library. Implementation on Windows.
  • Safe and defensive programming.
  • Automated and manual testing.
Literature
  • Kernighan, Brian W. - Ritchie, Dennis M. Programovací jazyk C. Brno: Computer Press, 2006. ISBN 80-251-0897-X
  • HEROUT, Pavel. Učebnice jazyka C. 3. upr. vyd. České Budějovice: KOPP, 1996, 269 s. ISBN 80-85828-21-9. info
  • HEROUT, Pavel. Učebnice jazyka C. České Budějovice: KOPP, 1998, 236 s. ISBN 80-85828-50-2. info
  • DRESSLER, Miroslav. Programovací jazyky GNU : volně šiřitelná programátorská prostředí : Fortran, jazyk C, Pascal, GRX, DJGPP, RHIDE, RSX, VESA, EMX, MAKE. 1. vyd. Praha: Computer Press, 1998, xix, 225. ISBN 8072260707. info
Bookmarks
https://is.muni.cz/ln/tag/FI:PB071!
Teaching methods
Teaching consists from theoretical lectures combined with the practical exercises and programming homework selected to practice topics from lectures.
Assessment methods
To be allowed to participate in final exam, a student student will undertake 6 programming homework (at least four of them for non-zero points) and participate in one final programming exercise consisting of test and practical programming exercise. 85 points are required to pass the course in addition to successful completion of requirements of practical exercises.
The students are working on given homework (usually finalized at home or in computer lab). Homework are awarded by point according to given criteria. Recommended finalization is exam, which is maintained as test questionnaire on computer. Precondition for undertake exam is to have awarded credit from practical exercises and autonomously programmed final assignment. Classification is based on points gathered from exercises, test questionnaire and final assignment. Participation on practical exercises is mandatory, unless teacher allows for exception (e.g., based on student exceptional knowledge of the subject).
Language of instruction
Czech
Follow-Up Courses
Further comments (probably available only in Czech)
Study Materials
The course is taught annually.
Listed among pre-requisites of other courses
Teacher's information
https://www.fi.muni.cz/pb071/
The course is also listed under the following terms Autumn 2002, Spring 2003, Spring 2004, Spring 2005, Spring 2006, Spring 2007, Spring 2008, Spring 2009, Spring 2010, Spring 2011, Autumn 2011, Spring 2012, Autumn 2012, Spring 2013, Autumn 2013, Spring 2014, Spring 2015, Spring 2016, Spring 2017, Spring 2018, Spring 2019, Spring 2020, Spring 2021, Spring 2022, Spring 2024, Spring 2025.
  • Enrolment Statistics (Spring 2023, recent)
  • Permalink: https://is.muni.cz/course/fi/spring2023/PB071