INMBPUDP Introduction to Programming

School of Business Administration in Karvina
Winter 2023
Extent and Intensity
1/2/0. 6 credit(s). Type of Completion: zk (examination).
Ing. Radomír Perzina, Ph.D. (lecturer)
Guaranteed by
Ing. Radomír Perzina, Ph.D.
Department of Informatics and Mathematics - School of Business Administration in Karvina
Contact Person: Ing. Jan Górecki, Ph.D.
Thu 9:45–10:30 AULA
  • Timetable of Seminar Groups:
INMBPUDP/01: Thu 8:05–9:40 B308, R. Perzina
They are not
Course Enrolment Limitations
The course is only offered to the students of the study fields the course is directly associated with.

The capacity limit for the course is 200 student(s).
Current registration and enrolment status: enrolled: 118/200, only registered: 0/200
fields of study / plans the course is directly associated with
Course objectives
The course Introduction to Programming is entry into a structured programming with sequential execution of commands. Students will learn how to correctly use data types (both standard and user-defined types), cycles, procedures, functions and abstract data structures.
  • 1. Historical development of computer architecture and programming languages. Compiled and interpreted translation of the source code. Algorithms. General principles of algorithm. Programming languages. Structured and Object Programming
    2. Types of data and their representation. The standard data types. Functions for working with data. Definition of user functions. The development environment Microsoft Visual Studio
    3. Limits of the use of standard data types. User-defined data types. Set and record
    4. Communication of program with the environment. Formatted input and output. The specific problems of various programming languages
    5. Logical operators. IF - ELSE statements, program branching. Cycles. Conditional end of the cycle
    6. Macros. Procedures and functions. Global and local variables. Parameters called by value and reference
    7. Binary and text files. Reading data from files. Writing data to a file
    8. Block - Declaration and command part. Globality and locality. Optimization of source code
    9. Advanced source code optimization methods
    10. Datatype pointer. Properties of dynamic variables
    11. Singly and doubly linked list. Creating and searching in the list. Sorting of the list
    12. Queue. Stack. Working with tables
    13. Balanced binary tree. Left and right rotation
    required literature
  • SEDGEWICK, R., WAYNE, K. Algorithms. Boston: Addison-Wesley Professional, 2011. ISBN 978-0321573513. info
  • WIRTH, N. Algoritmy a štruktúry údajov. Bratislava, ALFA, 1990. ISBN 80-05-00153-3. info
    recommended literature
  • HORTON, I. Ivor Horton´s Beginning Visual C++. New Jersey: WROX, 2014. ISBN 978-1118845714. info
  • CORMEN, T. H., LEISERSON, C. E., RIVEST, R. L., STEIN, C. Introduction to Algorithms. Cambridge: The MIT Press, 2009. ISBN 978-0262033848. info
  • PARTSKHALADZE, G. Technologie programování. Karviná: SU OPF, 2005. ISBN 9788072483167. info
  • TOPFER, P. Algoritmy a programování. Praha, Prometheus, 2002. ISBN 80-85849-83-6. info
Language of instruction
Further comments (probably available only in Czech)
The course can also be completed outside the examination period.
Teacher's information
Attendance in seminars 70 %, ongoing test, individual solving of tasks, retrieval and processing of resources on the Internet, processing of foreign sources and preparation for solving team tasks in seminars.
The course is also listed under the following terms Winter 2015, Winter 2016, Winter 2017, Winter 2018, Winter 2019, Winter 2020, Winter 2021, Winter 2022.
  • Enrolment Statistics (recent)
  • Permalink: