638-3012/05 – Programming of Information Systems (-)

Gurantor departmentDepartment of Automation and Computing in IndustryCredits5
Subject guarantordoc. Ing. Ivo Špička, Ph.D.Subject version guarantordoc. Ing. Ivo Špička, Ph.D.
Study levelundergraduate or graduateRequirementCompulsory
Year1Semestersummer
Study languageCzech
Year of introduction2019/2020Year of cancellation
Intended for the facultiesFMTIntended for study typesFollow-up Master
Instruction secured by
LoginNameTuitorTeacher giving lectures
FRI0022 Ing. Michal Fridrich, MBA
S1I28 doc. Ing. Ivo Špička, Ph.D.
Extent of instruction for forms of study
Form of studyWay of compl.Extent
Full-time Credit and Examination 3+2
Part-time Credit and Examination 16+0

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:

PETZOLD, CH. Programming Microsoft® Windows® with C#. Redmond: Microsoft Press, 2002. ISBN 0735613702. PHILIP, C. a J. IVERSON, 2017. Fundamentals of C# Programming for Information Systems: Black & White Version. Danvers: Prospect Press. ISBN 978-1-943153-17-6.

Recommended literature:

GUCKENHEIMER, S. a N. LOJE. Agile software engineering with Visual studio: from concept to continuous feedback. Upper Saddle River, NJ: Addison-Wesley, 2012. ISBN 978-0-321-68585-8.

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

Part-time form (validity from: 2018/2019 Winter semester)
Task nameType of taskMax. number of points
(act. for subtasks)
Min. number of pointsMax. počet pokusů
Credit and Examination Credit and Examination 100 (100) 51
        Credit Credit 30  15
        Examination Examination 70  36 3
Mandatory attendence participation: Participation in seminars, preparation of the project

Show history

Conditions for subject completion and attendance at the exercises within ISP:

Show history

Occurrence in study plans

Academic yearProgrammeBranch/spec.Spec.ZaměřeníFormStudy language Tut. centreYearWSType of duty
2021/2022 (N0413A270002) Quality Management and Control of Industrial Systems (S03) Intelligent Control Systems in Industry PI P Czech Ostrava 1 Compulsory study plan
2021/2022 (N0413A270002) Quality Management and Control of Industrial Systems (S03) Intelligent Control Systems in Industry PI K Czech Ostrava 1 Compulsory study plan
2020/2021 (N0413A270002) Quality Management and Control of Industrial Systems (S03) Intelligent Control Systems in Industry PI K Czech Ostrava 1 Compulsory study plan
2020/2021 (N0413A270002) Quality Management and Control of Industrial Systems (S03) Intelligent Control Systems in Industry PI P Czech Ostrava 1 Compulsory study plan
2019/2020 (N0413A270002) Quality Management and Control of Industrial Systems (S03) Intelligent Control Systems in Industry PI P Czech Ostrava 1 Compulsory study plan
2019/2020 (N0413A270002) Quality Management and Control of Industrial Systems (S03) Intelligent Control Systems in Industry PI K Czech Ostrava 1 Compulsory study plan

Occurrence in special blocks

Block nameAcademic yearForm of studyStudy language YearWSType of blockBlock owner

Assessment of instruction



2019/2020 Summer