638-2024/01 – Computer Technology II (PT2)

Gurantor departmentDepartment of Automation and Computing in IndustryCredits4
Subject guarantorIng. Pavel Švec, Ph.D.Subject version guarantorIng. Pavel Švec, Ph.D.
Study levelundergraduate or graduateRequirementCompulsory
Study languageCzech
Year of introduction2019/2020Year of cancellation
Intended for the facultiesFMTIntended for study typesBachelor
Instruction secured by
LoginNameTuitorTeacher giving lectures
FRI05 doc. Ing. Robert Frischer, Ph.D.
HEG30 doc. Ing. Milan Heger, CSc.
MEN096 Ing. Martin Menšík
SLA0116 Ing. Jaroslav Sláčala
SPA0034 Ing. et Ing. Hana Špačková
SVE05 Ing. Pavel Švec, Ph.D.
Extent of instruction for forms of study
Form of studyWay of compl.Extent
Full-time Credit and Examination 1+2
Combined Credit and Examination 12+0

Subject aims expressed by acquired skills and competences

Student will be able to - analyze basic computer’s tasks; - apply the basic data and control structures in the concept of the solution; - build the algorithm of the solution; - transform the algorithm to the computer program .

Teaching methods

Project work


The objective of the course is familiarize students with principles, classification of complexity and validity of algorithms, familiarize with control a data structures of programme languages and abstract data types.

Compulsory literature:

[1] HEGER, M.: Počítačová technika II. Studijní opora k předmětu. 2010 [2] HEROUT, P.: Učebnice jazyka C. 1. díl, 5. vyd. České Budějovice: Kopp, 2008, 271 s. ISBN 978-80-7232-351-7 [3] HEROUT, P.: Učebnice jazyka C. 2. díl, 3. vyd. České Budějovice: Kopp, 2007, s. 272-437, ISBN 978-80-7232-329-6 [4] KNUTH, D. E.: The art of computer programming. Vol. 1, Fundamental algorithms. 3rd ed. Boston: AddisonWesley, 1997, 650 s. ISBN 0-201-89683-4

Recommended literature:

[1] WIRTH, N.: Algorithms + Data Structures = Programs. 1976. Prentice Hall. ISBN: 0130224189

Way of continuous check of knowledge in the course of semester

Individual tasks, tests.


Další požadavky na studenta

Study of compulsory literature, participation in seminars.


Subject has no prerequisities.


Subject has no co-requisities.

Subject syllabus:

First Properties of algorithms, notations and description algorithms. Second Problem solving techniques. Design and implementation of algorithms. 3rd Principles of high level programming languages. Symbols and separators, constants, identifiers. 4th Variables, representation of numbers, labels. 5th Expressions and statements. 6th Text files, standard input / output, binary files. 7th The concept of data. Simple data types. Structured data types. 8th Structured programming. The control structures. The block structure, scope. 9th Procedures and functions and their parameters. 10th Recursive procedures and functions, and direct and indirect recursion. 11th Pointers and dynamic variables. Linked structures, lists and trees. 12th Basic sorting methods and their efficiency. 13th Basic search methods, applications. 14th Debugging and program documentation.

Conditions for subject completion

Full-time form (validity from: 2019/2020 Winter semester)
Task nameType of taskMax. number of points
(act. for subtasks)
Min. number of points
Credit and Examination Credit and Examination 100  51
        Credit Credit  
        Examination Examination  
Mandatory attendence parzicipation:

Show history

Occurrence in study plans

Academic yearProgrammeField of studySpec.FormStudy language Tut. centreYearWSType of duty
2019/2020 (B0488A270001) Quality Management and Control of Industrial Systems (S03) Computer Control Systems in Industry P Czech Ostrava 2 Compulsory study plan
2019/2020 (B0488A270001) Quality Management and Control of Industrial Systems (S03) Computer Control Systems in Industry K Czech Ostrava 2 Compulsory study plan

Occurrence in special blocks

Block nameAcademic yearForm of studyStudy language YearWSType of blockBlock owner