PB071 Principles of low-level programming

Faculty of Informatics
Spring 2021
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)
Patrícia Andicsová (seminar tutor)
Bc. Štěpán Balážik (seminar tutor)
Mgr. Luděk Bártek, Ph.D. (seminar tutor)
Richard Bechera (seminar tutor)
Martin Bendel (seminar tutor)
Stanislav Boboň (seminar tutor)
Ondřej Borýsek (seminar tutor)
Bc. Tomáš Buriánek (seminar tutor)
Ján Dovjak (seminar tutor)
Mgr. Antonín Dufka (seminar tutor)
Matej Focko (seminar tutor)
Bc. Zoltán Fridrich (seminar tutor)
Bc. Sandra Galovičová (seminar tutor)
Bc. Samuel Gorta (seminar tutor)
Ľuboslav Halama (seminar tutor)
Bc. Jakub Hanko (seminar tutor)
Bc. Roman Chrenšť (seminar tutor)
Adam Ivora (seminar tutor)
Miroslav Jaroš (seminar tutor)
Vojtěch Jelínek (seminar tutor)
Petr Kadlec (seminar tutor)
Tomáš Kancko (seminar tutor)
Mgr. Jakub Bartolomej Košuth (seminar tutor)
Matúš Kropuch (seminar tutor)
Bc. Ivana Krumlová (seminar tutor)
Bc. Lukáš Kurčík (seminar tutor)
Bc. Jozef Mikušinec (seminar tutor)
Ivan Mitruk (seminar tutor)
Erik Moravec (seminar tutor)
Bc. Imrich Nagy (seminar tutor)
Mgr. Peter Navrátil (seminar tutor)
Mgr. Jiří Novosad (seminar tutor)
Bc. Samuel Obuch (seminar tutor)
Ondřej Pavlica (seminar tutor)
Matěj Pavlík (seminar tutor)
Bc. Martin Piatka (seminar tutor)
Ján Popeláš (seminar tutor)
Adam Považanec (seminar tutor)
Mgr. Martin Pulec (seminar tutor)
Jonáš Rosecký (seminar tutor)
RNDr. Lukáš Ručka (seminar tutor)
Bc. Marko Řeháček (seminar tutor)
Bc. Radoslav Sabol (seminar tutor)
Roman Solař (seminar tutor)
Bc. Stanislav Soták (seminar tutor)
Mgr. Peter Stanko (seminar tutor)
Oliver Svetlík (seminar tutor)
Vojtěch Škaroupka (seminar tutor)
Adam Štěpánek (seminar tutor)
Bc. Denis Varga (seminar tutor)
Mgr. Jiří Weiser (seminar tutor)
Bc. Daniel Zaťovič (seminar tutor)
RNDr. Michal Zima (seminar tutor)
Patrick Ondika (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
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
there are 59 fields of study the course is directly associated with, display
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)
The course is taught annually.
The course is taught: every week.
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.
  • Enrolment Statistics (Spring 2021, recent)
  • Permalink: https://is.muni.cz/course/fi/spring2021/PB071