714-0286/02 – Computer Technics and Algorithms (BcVTA)
| Gurantor department | Department of Mathematics and Descriptive Geometry | Credits | 2 |
| Subject guarantor | RNDr. Břetislav Krček, CSc. | Subject version guarantor | RNDr. Břetislav Krček, CSc. |
| Study level | undergraduate or graduate | Requirement | Compulsory |
| Year | 2 | Semester | summer |
| | Study language | Czech |
| Year of introduction | 1999/2000 | Year of cancellation | 2019/2020 |
| Intended for the faculties | FAST | Intended for study types | Bachelor |
Subject aims expressed by acquired skills and competences
The main goal of the course is to acquaint with basic principles of problem solving using computers, to acquaint with basic abstract data types and to master their implementation and exploitation. The students shall gain knowledge and skills necessary for algorithm design, coding in a programming language (Delphi) and debugging.
Teaching methods
Tutorials
Other activities
Summary
Algorithmization: algorithms, basic operational structures , block diagrams.
Hardware and software, operating system. Delphi: constants, standard types,
variables, declaration and definition.
Basic commands, input, output and structured commands. Types defined by users,
array. String and commands for strings. Procedures and functions, declaration,
value and variable parameters.
Compulsory literature:
Recommended literature:
Wirth, N., Jensen, K.: PASCAL - User Manual and Report,
ISO Pascal Standard. Springer-Verlag 1991. ISBN 0-540-97649-3
Way of continuous check of knowledge in the course of semester
Předmět končí klasifikovaným zápočtem. Všechny body pro hodnocení lze proto získat za absolvování konzultací a za výsledky testů (1.test 30 bodů, 2.test 40 bodů, u každého testu je možný jeden opravný termín).
E-learning
Other requirements
.............................................
Prerequisities
Subject has no prerequisities.
Co-requisities
Subject has no co-requisities.
Subject syllabus:
Syllabus of subject
1. Algorithmization
1.1. Algorithm and its attributes, flow diagrams language, elementary algorithms
creating, basic data types.
1.2. Loops, basic control structures, structured programming principles.
1.3. Arrays, one-dimensional arrays algorithms, sort algorithms.
2. Delphi
2.1. Integrated development environment, program’s structure, data types.
2.2. Expressions and statements.
2.3. Structured data types.
2.4. Procedures and functions.
2.5. Files.
Syllabus of consultations:
1. Algorithm. Flow diagrams language. Simple algorithms creating.
Algorithms with loops. Array. Integer and real data types.
2. Subprograms (procedures and functions). Programs with matrixes. Files.
Conditions for subject completion
Occurrence in study plans
Occurrence in special blocks
Assessment of instruction