FI:PB071 Principles of low-level prog.

PB071 Principles of low-level programming

Faculty of Informatics
Spring 2020

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)

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 17. 2. to Fri 15. 5. Mon 12:00–13:50 D2, Mon 12:00–13:50 D1

Timetable of Seminar Groups:

PB071/01: Mon 17. 2. to Fri 15. 5. Tue 12:00–13:50 A219, L. Bártek
PB071/02: Mon 17. 2. to Fri 15. 5. Wed 12:00–13:50 B130, T. Kancko, J. Novosad
PB071/03: Mon 17. 2. to Fri 15. 5. Tue 14:00–15:50 B117, L. Ručka, V. Škaroupka
PB071/04: Mon 17. 2. to Fri 15. 5. Wed 12:00–13:50 B117, P. Andicsová, L. Ručka
PB071/05: Mon 17. 2. to Fri 15. 5. Mon 14:00–15:50 B130, S. Gorta, M. Jaroš
PB071/06: Mon 17. 2. to Fri 15. 5. Thu 14:00–15:50 B117, S. Boboň, R. Lacko, J. Popeláš
PB071/07: Mon 17. 2. to Fri 15. 5. Wed 14:00–15:50 B117, R. Bechera, R. Lacko
PB071/08: Mon 17. 2. to Fri 15. 5. Tue 18:00–19:50 A219, M. Focko, P. Stanko
PB071/09: Mon 17. 2. to Fri 15. 5. Wed 16:00–17:50 B117, J. Košuth, A. Považanec
PB071/10: Mon 17. 2. to Fri 15. 5. Thu 10:00–11:50 B117, A. Dufka, I. Mitruk
PB071/11: Mon 17. 2. to Fri 15. 5. Mon 16:00–17:50 A219, V. Jelínek, M. Piatka
PB071/12: Mon 17. 2. to Fri 15. 5. Tue 16:00–17:50 B117, Z. Fridrich, R. Chrenšť
PB071/13: Mon 17. 2. to Fri 15. 5. Fri 8:00–9:50 B116, S. Galovičová, P. Navrátil
PB071/14: Mon 17. 2. to Fri 15. 5. Tue 10:00–11:50 A215, P. Kadlec, L. Kurčík
PB071/15: Mon 17. 2. to Fri 15. 5. Tue 18:00–19:50 B117, S. Obuch, J. Rosecký
PB071/16: Mon 17. 2. to Fri 15. 5. Wed 14:00–15:50 A215, J. Mikušinec, I. Nagy
PB071/17: Mon 17. 2. to Fri 15. 5. Thu 14:00–15:50 B116, R. Chrenšť, I. Nagy
PB071/18: Mon 17. 2. to Fri 15. 5. Mon 14:00–15:50 A219, Š. Balážik, D. Varga
PB071/19: Mon 17. 2. to Fri 15. 5. Mon 18:00–19:50 B117, M. Řeháček, O. Svetlík
PB071/20: Mon 17. 2. to Fri 15. 5. Thu 18:00–19:50 A215, Ľ. Halama, R. Solař
PB071/21: Mon 17. 2. to Fri 15. 5. Tue 10:00–11:50 B117, A. Ivora, R. Solař
PB071/22: Mon 17. 2. to Fri 15. 5. Tue 16:00–17:50 A219, R. Sabol, S. Soták
PB071/23: Mon 17. 2. to Fri 15. 5. Tue 8:00–9:50 A219, P. Kadlec, D. Zaťovič
PB071/24: Mon 17. 2. to Fri 15. 5. Fri 10:00–11:50 A219, J. Hanko
PB071/25: Mon 17. 2. to Fri 15. 5. Mon 18:00–19:50 A219, M. Kropuch
PB071/26: Mon 17. 2. to Fri 15. 5. Thu 16:00–17:50 B116, S. Gorta
PB071/27: Mon 17. 2. to Fri 15. 5. Thu 16:00–17:50 B117, O. Borýsek
PB071/28: Mon 17. 2. to Fri 15. 5. Thu 16:00–17:50 A215, M. Bendel
PB071/29: Mon 17. 2. to Fri 15. 5. Mon 16:00–17:50 B116, I. Krumlová
PB071/30: Mon 17. 2. to Fri 15. 5. Wed 18:00–19:50 B311, T. Kancko
PB071/31: Mon 17. 2. to Fri 15. 5. Wed 18:00–19:50 B117, Ľ. Halama, A. Považanec
PB071/32: Mon 17. 2. to Fri 15. 5. Fri 10:00–11:50 B117, I. Mitruk
PB071/33: Mon 17. 2. to Fri 15. 5. Wed 8:00–9:50 A215, M. Pavlík
PB071/34: Mon 17. 2. to Fri 15. 5. Fri 12:00–13:50 A219, A. Ivora
PB071/35: Mon 17. 2. to Fri 15. 5. Thu 18:00–19:50 B117, J. Dovjak, E. Moravec
PB071/36: Mon 17. 2. to Fri 15. 5. Tue 8:00–9:50 B117, A. Štěpánek
PB071/37: Mon 17. 2. to Fri 15. 5. Fri 8:00–9:50 B117, R. Chrenšť
PB071/38: Mon 17. 2. to Fri 15. 5. Wed 8:00–9:50 A219, R. Sabol
PB071/39: Mon 17. 2. to Fri 15. 5. Thu 10:00–11:50 A215, T. Buriánek
PB071/40: Mon 17. 2. to Fri 15. 5. Thu 12:00–13:50 B117, O. Pavlica

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

Image Processing and Analysis (programme FI, N-VIZ)
Applied Informatics (programme FI, B-AP)
Bioinformatics and systems biology (programme FI, N-UIZD)
Bioinformatics (programme FI, B-AP)
Computer Games Development (programme FI, N-VIZ_A)
Computer Graphics and Visualisation (programme FI, N-VIZ_A)
Computer Networks and Communications (programme FI, N-PSKB_A)
Cybersecurity Management (programme FI, N-RSSS_A)
Economic Information Systems (programme ESF, B-SI)
Formal analysis of computer systems (programme FI, N-TEI)
Graphic design (programme FI, N-VIZ)
Graphic Design (programme FI, N-VIZ_A)
Hardware Systems (programme FI, N-PSKB_A)
Hardware systems (programme FI, N-PSKB)
Image Processing and Analysis (programme FI, N-VIZ_A)
Information security (programme FI, N-PSKB)
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)
Informatics (programme FI, B-INF) (2)
Public Administration Informatics (programme FI, B-AP)
Informatics in education (programme FI, B-IVV) (2)
Information Security (programme FI, N-PSKB_A)
Quantum and Other Nonclassical Computational Models (programme FI, N-TEI)
Mathematical Informatics (programme FI, B-IN)
Parallel and Distributed Systems (programme FI, B-IN)
Computer graphics and visualisation (programme FI, N-VIZ)
Computer Graphics and Image Processing (programme FI, B-IN)
Computer Networks and Communication (programme FI, B-IN)
Computer Networks and Communications (programme FI, N-PSKB)
Computer Systems and Data Processing (programme FI, B-IN)
Principles of programming languages (programme FI, N-TEI)
Programming and development (programme FI, B-PVA)
Programmable Technical Structures (programme FI, B-IN)
Embedded Systems (programme FI, N-IN)
Cybersecurity management (programme FI, N-RSSS)
Services development management (programme FI, N-RSSS)
Software Systems Development Management (programme FI, N-RSSS)
Services Development Management (programme FI, N-RSSS_A)
Service Science, Management and Engineering (programme FI, N-AP)
Social Informatics (programme FI, B-AP)
Software Systems Development Management (programme FI, N-RSSS_A)
Software Systems (programme FI, N-PSKB_A)
Software systems (programme FI, N-PSKB)
Machine learning and artificial intelligence (programme FI, N-UIZD)
Teacher of Informatics and IT administrator (programme FI, N-UCI)
Informatics for secondary school teachers (programme FI, N-UCI) (2)
Artificial Intelligence and Natural Language Processing (programme FI, B-IN)
Computer Games Development (programme FI, N-VIZ)
Processing and analysis of large-scale data (programme FI, N-UIZD)
Natural language processing (programme FI, N-UIZD)

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

http://cecko.eu/public/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 2021, Spring 2022, Spring 2023, Spring 2024, Spring 2025.

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

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

PB071 Principles of low-level programming

Other applications