FI:PB071 Principles of low-level prog.

PB071 Principles of low-level programming

Faculty of Informatics
Spring 2019

Extent and Intensity

2/2. 4 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).

Teacher(s)

Guaranteed by

doc. RNDr. Eva Hladká, Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics
Supplier department: Department of Computer Systems and Communications – Faculty of Informatics

Timetable

Mon 18. 2. to Mon 13. 5. Mon 12:00–13:50 D1, Mon 12:00–13:50 D3

Timetable of Seminar Groups:

PB071/01: Tue 19. 2. to Tue 14. 5. Tue 10:00–11:50 B130, L. Bártek, N. Slivka
PB071/02: Thu 21. 2. to Thu 16. 5. Thu 10:00–11:50 A219, L. Bártek, V. Jelínek
PB071/03: Thu 21. 2. to Thu 16. 5. Thu 10:00–11:50 A215, M. Pulec, S. Soták
PB071/04: Wed 20. 2. to Wed 15. 5. Wed 12:00–13:50 B117, L. Kurčík, I. Mitruk
PB071/05: Wed 20. 2. to Wed 15. 5. Wed 18:00–19:50 A219, M. Dugáček, M. Zima
PB071/06: Wed 20. 2. to Wed 15. 5. Wed 16:00–17:50 A219, D. Stuchlík, M. Zima
PB071/07: Tue 19. 2. to Tue 14. 5. Tue 16:00–17:50 A219, M. Jaroš, R. Sabol
PB071/08: Wed 20. 2. to Wed 15. 5. Wed 18:00–19:50 B130, M. Jaroš, E. Moravec
PB071/09: Fri 12:00–13:50 A219, S. Galovičová, P. Navrátil
PB071/10: Wed 20. 2. to Wed 15. 5. Wed 8:00–9:50 B130, P. Navrátil, O. Pavlica
PB071/11: Wed 20. 2. to Wed 15. 5. Wed 10:00–11:50 A219, M. Cambel, O. Šebek
PB071/12: Wed 20. 2. to Wed 15. 5. Wed 8:00–9:50 A219, A. Dufka, I. Nagy
PB071/13: Mon 18. 2. to Mon 13. 5. Mon 18:00–19:50 A215, Z. Fridrich, P. Šimovec
PB071/14: Thu 21. 2. to Thu 16. 5. Thu 12:00–13:50 B117, M. Bendel, D. Varga
PB071/15: Mon 18. 2. to Mon 13. 5. Mon 16:00–17:50 A219, L. Ručka, M. Řeháček
PB071/16: Wed 20. 2. to Wed 15. 5. Wed 14:00–15:50 A219, M. Řeháček, L. Zaoral
PB071/17: Mon 18. 2. to Mon 13. 5. Mon 14:00–15:50 A219, J. Dovjak, M. Pulec
PB071/18: Mon 18. 2. to Mon 13. 5. Mon 18:00–19:50 A219, M. Dujava, L. Korenčik
PB071/19: Thu 21. 2. to Thu 16. 5. Thu 8:00–9:50 A219, A. Ivora, D. Jochec
PB071/20: Tue 19. 2. to Tue 14. 5. Tue 18:00–19:50 A219, O. Borýsek, D. Jochec
PB071/21: Tue 19. 2. to Tue 14. 5. Tue 10:00–11:50 A219, M. Pavlík, R. Solař
PB071/22: Thu 21. 2. to Thu 16. 5. Thu 10:00–11:50 B311, R. Solař, P. Till
PB071/23: Mon 18. 2. to Mon 13. 5. Mon 16:00–17:50 B117, J. Hanko, S. Obuch
PB071/24: Thu 21. 2. to Thu 16. 5. Thu 12:00–13:50 B116, T. Kancko, S. Obuch
PB071/25: Mon 18. 2. to Mon 13. 5. Mon 16:00–17:50 B116, S. Gorta, R. Lacko
PB071/26: Tue 19. 2. to Tue 14. 5. Tue 12:00–13:50 A219, D. Dubravický, M. Kropuch, R. Lacko
PB071/27: Tue 19. 2. to Tue 14. 5. Tue 14:00–15:50 B130, I. Krumlová, M. Piatka
PB071/28: Thu 21. 2. to Thu 16. 5. Thu 18:00–19:50 A219, A. Hrinko, D. Varga
PB071/29: Fri 10:00–11:50 A215
PB071/30: Thu 21. 2. to Thu 16. 5. Thu 8:00–9:50 A215, A. Dufka, A. Považanec
PB071/31: Wed 20. 2. to Wed 15. 5. Wed 16:00–17:50 A215, R. Chrenšť, J. Weiser
PB071/32: Tue 19. 2. to Tue 14. 5. Tue 16:00–17:50 B117, J. Košuth, J. Weiser
PB071/33: Fri 10:00–11:50 A219, O. Charbulák, J. Novosad
PB071/34: Fri 8:00–9:50 A219, P. Stanko, A. Štěpánek
PB071/35: Thu 21. 2. to Thu 16. 5. Thu 16:00–17:50 A219, J. Mikušinec
PB071/36: Tue 19. 2. to Tue 14. 5. Tue 16:00–17:50 B130, A. Řechtáčková, P. Stanko
PB071/37: Tue 19. 2. to Tue 14. 5. Tue 14:00–15:50 A215, A. Zlámal
PB071/38: Mon 18. 2. to Mon 13. 5. Mon 14:00–15:50 A215, D. Zaťovič, A. Zlámal
PB071/39: Tue 19. 2. to Tue 14. 5. Tue 12:00–13:50 B130, T. Buriánek, P. Ročkai
PB071/40: Fri 12:00–13:50 B130, D. Meščaněnko, P. Ročkai

Prerequisites

IB001 Intro to Prog. using C || IB111 Foundations of Programming || IB999 Programming Test
Students are expected to have knowledge of algorithmization in Pascal or another procedural language. Students are also required to have user experience with Unix OS, as homework is submitted and tested on a Unix 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

Applied Informatics (programme FI, B-AP)
Bioinformatics (programme FI, B-AP)
Economic Information Systems (programme ESF, B-SI)
Informatics with another discipline (programme FI, B-EB)
Informatics with another discipline (programme FI, B-FY)
Informatics with another discipline (programme FI, B-GE)
Informatics with another discipline (programme FI, B-GK)
Informatics with another discipline (programme FI, B-CH)
Informatics with another discipline (programme FI, B-IO)
Informatics with another discipline (programme FI, B-MA)
Informatics with another discipline (programme FI, B-TV)
Public Administration Informatics (programme FI, B-AP)
Mathematical Informatics (programme FI, B-IN)
Parallel and Distributed Systems (programme FI, B-IN)
Computer Graphics and Image Processing (programme FI, B-IN)
Computer Networks and Communication (programme FI, B-IN)
Computer Systems and Data Processing (programme FI, B-IN)
Programmable Technical Structures (programme FI, B-IN)
Embedded Systems (programme FI, N-IN)
Service Science, Management and Engineering (programme FI, N-AP)
Social Informatics (programme FI, B-AP)
Artificial Intelligence and Natural Language Processing (programme FI, B-IN)

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 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. Advanced 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

During the whole semester, student will undertake 5 programming homework, one written tests and one final programming exercise. 95 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

PB161 C++ Programming

Further comments (probably available only in Czech)

Study Materials
The course is taught annually.

Listed among pre-requisites of other courses

IB113 Introduction to Programming and Algorithms
!NOW(IB111) && !IB111 && !PB162 && !PB161 && !PB071 && !IB001 && !program(B-INF) && !program(B-PVA) && !program(B-CS)
PB006 Principles of Programming Languages and OOP
(IB111 || NOW(IB111)) && (PB071 || PB111)
PB152cv Operating Systems - practicals
(PB153 || PB152) && (PB111 || PB071 || SOUHLAS)
PB173 Domain specific development
PB111 || PB071 || SOUHLAS
PB176 Basics of Quality and Managment of Source Code
PB006 || PB071 || now(PB071)

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 2020, Spring 2021, Spring 2022, Spring 2023, Spring 2024, Spring 2025.

Enrolment Statistics (Spring 2019, recent)
Permalink: https://is.muni.cz/course/fi/spring2019/PB071

FI:PB071 Principles of low-level prog. - Course Information

PB071 Principles of low-level programming

Other applications