Course details

Programming Seminar

IPS Acad. year 2020/2021 Winter semester 2 credits

Current academic year

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.

Guarantor

Smrčka Aleš, Ing., Ph.D. (DITS)

Course coordinator

Rogalewicz Adam, doc. Mgr., Ph.D. (DITS)

Language of instruction

Czech, English

Completion

Credit

Time span

  • 20 hrs seminar
  • 6 hrs projects

Assessment points

  • 100 pts numeric exercises

Department

Department of Intelligent Systems (UITS)

Instructor

Peringer Petr, Dr. Ing. (DITS)
Rogalewicz Adam, doc. Mgr., Ph.D. (DITS)
Smrčka Aleš, Ing., Ph.D. (DITS)

Subject specific learning outcomes and competences

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

Learning objectives

The goal of the course is to provide a different point of view to key principles of programming and operating systems. In particular, with respect to the abstraction of algorithms and formal automata and models, to reach the connection of theoretic and practical knowledge of a given topic.

Why is the course taught

The goal of the course is to complement knowledge of students with the topics of software programming which have not been thoroughly described in other programming courses. The problems are mostly demonstrated using practical examples and exercises.

Prerequisite knowledge and skills

Programming in C language. Fundamentals of algorithmization. Basic synchronization primitives. Computer architecture.

Study literature

  • A. Kumar, A. K. Verma. A Novel Algorithm for the Conversion of Parallel Regular Expressions to Non-deterministic Finite Automata. 2014. doi: 10.1.1.403.6706
  • 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
  • Drepper, D.: What Every Programmer Should Know About Memory, 2007.

Syllabus of seminars

  1. Pointers, dynamic memory allocation.
  2. Stack frames, recursion.
  3. Compilation and debugging of programs.
  4. --
  5. Demonstration and solution of a given task.
  6. Finite automata, POSIX regular expressions.
  7. Synchronization of processes.
  8. Deadlock.
  9. --
  10. Demonstration and solution of a given task.
  11. Page tables.
  12. Demand paging and cache in relation to performance.
  13. Demonstration and solution of a given task.

Progress assessment

  • Evaluation of the two home assignments (max 35 points)
  • Evaluation of the two home assignments (max 30 points)


Exam prerequisites:
The minimal total score of 50 points gained during a semester and 5 points for each of home assignments.

Exam prerequisites

The minimal total score of 50 points gained during a semester and 5 points for each of home assignments.

Course inclusion in study plans

  • Programme BIT, 2nd year of study, Elective
  • Programme IT-BC-3, field BIT, 2nd year of study, Elective
Back to top