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 tutorial:
At first the flow diagrams (FD) are mainly used for algorithms creating and notation, but from the very beginning the Delphi (D) notation is also applied.
1. Algorithm. Flow diagrams language. FD: Simple algorithms creating.
D: Integer and real data types.
2. FD: Algorithms with loops. D: Integrated development environment,
transcription of selected statements and control structures from FD.
3. FD: Algorithms with loops. D: Simple data types (ordinal types and real)
and their using in programs.
4. FD: Array (one-dimensional). D: input and output statements
5. FD: Rectangular method for numerical calculation of integral.
D: Program for integral calculation. 1st individual program task.
6. FD: Arrays and nested loops. D: Structured data types.
7. FD: 1st test. D: Other numerical methods for integral calculation.
8. FD: Algorithms with arrays (sort algorithms). D: Programs with matrixes.
9. (Only D since this moment)
Subprograms (functions). 2nd individual program task.
10. Subprograms (procedures), program block structure.
11. Text file. Strings. Text information processing.
12. Files, types of files, files processing. Programs with subprograms.
13. 2nd test. Individual programs elaborating.
14. Reserve, individual work, tests repairing.
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 tutorial:
At first the flow diagrams (FD) are mainly used for algorithms creating and notation, but from the very beginning the Delphi (D) notation is also applied.
1. Algorithm. Flow diagrams language. FD: Simple algorithms creating.
D: Integer and real data types.
2. FD: Algorithms with loops. D: Integrated development environment,
transcription of selected statements and control structures from FD.
3. FD: Algorithms with loops. D: Simple data types (ordinal types and real)
and their using in programs.
4. FD: Array (one-dimensional). D: input and output statements
5. FD: Rectangular method for numerical calculation of integral.
D: Program for integral calculation. 1st individual program task.
6. FD: Arrays and nested loops. D: Structured data types.
7. FD: 1st test. D: Other numerical methods for integral calculation.
8. FD: Algorithms with arrays (sort algorithms). D: Programs with matrixes.
9. (Only D since this moment)
Subprograms (functions). 2nd individual program task.
10. Subprograms (procedures), program block structure.
11. Text file. Strings. Text information processing.
12. Files, types of files, files processing. Programs with subprograms.
13. 2nd test. Individual programs elaborating.
14. Reserve, individual work, tests repairing.