654-3012/01 – Programming of Information Systems (-)
| Gurantor department | Department of Industrial Systems Management | Credits | 5 |
| Subject guarantor | Ing. Ondřej Grycz, Ph.D. | Subject version guarantor | Ing. Ondřej Grycz, Ph.D. |
| Study level | undergraduate or graduate | Requirement | Compulsory |
| Year | 1 | Semester | summer |
| | Study language | Czech |
| Year of introduction | 2022/2023 | Year of cancellation | |
| Intended for the faculties | FMT | Intended for study types | Follow-up Master |
Subject aims expressed by acquired skills and competences
Student will understand:
- the principles of IS programming;
- the complex data structures and their usage;
- the comprehensive algorithms, process synchronizations, multithread programming.
Student will be able to create the basic programs for graphical user interface in Windows.
Teaching methods
Lectures
Individual consultations
Tutorials
Summary
Course gives basis of programming of information systems in workspace of
operation system Windows. It explains technique of event diving programming,
system of sending messages a basic concept of multiple threading programs. In
second part it is explained basic data structures with corresponding algorithms.
Compulsory literature:
Recommended literature:
Additional study materials
Way of continuous check of knowledge in the course of semester
Written and oral exam.
E-learning
Other requirements
Study of compulsory literature, participation in seminars.
Prerequisities
Subject has no prerequisities.
Co-requisities
Subject has no co-requisities.
Subject syllabus:
1. The architecture of programs for Windows, server and client program architecture in Windows, messages.
2. Widows API, the main window and the message loop.
3. The object program for Windows, event handling.
4. Elements and components, dialogs and features of control at Windows API.
5. The special features of Win32programs, system registry, threads, exceptions, structured exception.
6. The principle of calling system service, dynamic libraries, dynamic library call.
7. The component technology.
8. The dynamic memory allocation.
9. Data structures, static, dynamic, homogeneous, heterogeneous.
10. The constructor, the selector. Dynamic structures, lists - one-way, two-way, circular, two-way list. Stack. Use the stack: backtracking algorithms, recursion.
11. Passages of a binary tree. Recursive and non-recursive passages algorithms writing. Implementation of some operations on the tree (equivalence structures, equivalence of two trees, copy, destruction, number of leaves, height, find the longest path from the root to the leaf. Sequential search in a file, a field list. Binary search. Binary search trees. Recursive and non-recursive version operations of the BVS.
12.Tables with direct access, the principle index-sequence search. Hash-table. Characteristics and design of the hash (hash) function. Evaluation of search methods.
13. Sorting, basic concepts: stability, naturalness, time and space complexity of sorting algorithms. To sort by multiple keys, shift without moving items. Classification principles of the sort. Ordering on the principle of choice - Bubble-sort and its variants, Heap sort. Ordering fields on the principle of insertion.
14. The principle of sorting sequential files. 3 and 4 tape sorting method sequential files - direct and natural. Recursion, the principles of typical recursive algorithms; transfer between recursive and no recursive registration algorithm, Tower of Hanoi, 8 queens, horses’ road, recursion in graphics.
Conditions for subject completion
Occurrence in study plans
Occurrence in special blocks
Assessment of instruction
Předmět neobsahuje žádné hodnocení.