638-2024/01 – Computer Technology II (PT2)
| Gurantor department | Department of Automation and Computing in Industry | Credits | 4 |
| Subject guarantor | Ing. Pavel Švec, Ph.D. | Subject version guarantor | Ing. Pavel Švec, Ph.D. |
| Study level | undergraduate or graduate | Requirement | Compulsory |
| Year | 2 | Semester | summer |
| | Study language | Czech |
| Year of introduction | 2019/2020 | Year of cancellation | |
| Intended for the faculties | FMT | Intended for study types | Bachelor |
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
Lectures
Tutorials
Project work
Summary
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:
Recommended literature:
Way of continuous check of knowledge in the course of semester
Individual tasks, tests.
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:
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
Occurrence in study plans
Occurrence in special blocks
Assessment of instruction