Course detail
Programming Seminar
FIT-IPSAcad. year: 2021/2022
Dynamic memory allocation, pointer and reference data type. Activation record and recursion. Compilation, binary program invocation. Implementation of state automata. Implementation of algorithms for regular expressions. Program synchronization. Principles of threads and processes. Selected synchronization issues. Introduction to message passing interface. Problematics of page faults and related performance effects.
Language of instruction
Number of ECTS credits
Mode of study
Guarantor
Department
Learning outcomes of the course unit
- The student is able to explain the problems of program execution, she/he can explain dynamic memory allocation.
- Student can use state automata in program control.
- Student manages the application of regular expressions.
- Student manages implementation of parallel programs.
- The student is able to identify a decrease in program performance due to memory accesses.
Prerequisites
Co-requisites
Planned learning activities and teaching methods
Assesment methods and criteria linked to learning outcomes
- Evaluation of the two home assignments (max 35 points)
- Evaluation of the two home assignments (max 30 points)
Course curriculum
Work placements
Aims
Specification of controlled education, way of implementation and compensation for absences
Recommended optional programme components
Prerequisites and corequisites
Basic literature
Recommended reading
Drepper, D.: What Every Programmer Should Know About Memory, 2007.
Kernighan and Ritchie. The C Programming Language, 2nd edition. Chapter A. Storage Allocator for C maloc and free. 1989.
Maged M. Michael. Scalable lock-free dynamic memory allocation. In Proc. of PLDI'04. doi: 10.1145/996841.996848
Michael, M.M.: Scalable lock-free dynamic memory allocation. 2004. In Proc. of PLDI'04. doi: 10.1145/996841.996848
Classification of course in study plans
Type of course unit
Seminar
Teacher / Lecturer
Syllabus
- Pointers, dynamic memory allocation.
- Stack frames, recursion.
- Compilation and debugging of programs.
- --
- Demonstration and solution of a given task.
- Finite automata, POSIX regular expressions.
- Synchronization of processes.
- Deadlock.
- --
- Demonstration and solution of a given task.
- Page tables.
- Demand paging and cache in relation to performance.
- Demonstration and solution of a given task.
Project
Teacher / Lecturer