Course detail
Programming Methods
FSI-0S2 Acad. year: 2023/2024 Winter semester
The course deals with the use of elementary program techniques in complex algorithms: string valuation; infix, prefix, postfix, binary tree. Also discussed is software modelling of optical phenomena. The course familiarises students also with: Geometric self-similarity, Hausdorff dimension. Statistic self-similarity, nature figures modelling. Elements of software measurement of Hausdorff dimension.
Language of instruction
Czech
Number of ECTS credits
2
Supervisor
Department
Entry knowledge
Basic programming techniques and their implementation in Borland Delphi
Rules for evaluation and completion of the course
Course-unit credit is awarded on condition of having worked out semester work and programmed elementary algorithm.
Missed lessons may be compensated for via a written test.
Aims
Students will be made familiar with practical principles in construction of greater programs. They will realize the meaning of mathematical theory in programming selected practical problems.
Students will be able to solve more complicated mathematical and technical problems.
The study programmes with the given course
Programme B-MAI-P: Mathematical Engineering, Bachelor's, elective
Type of course unit
Computer-assisted exercise
26 hours, compulsory
Syllabus
1) Data structures; front, container, binary tree,
2) Infix, prefix, postfix, arithmetic expression valuation
3-4) Mathematical function processing, valuation of general mathematical expression.
5) Iteration systems and methods their construction
6) Attractors, random walk method
7) Control selection method and inverse orbit method
8) Textures application
9) Light reflection software modelling
10-11) Light refraction software modelling
12) Global representation methods; ray tracing
13,14) Semester work processing.
Presence in the seminar is obligatory.