Course detail

Programming Methods II

FSI-0S2Acad. year: 2020/2021

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

Mode of study

Not applicable.

Guarantor

doc. PaedDr. Dalibor Martišek, Ph.D.

Department

Institute of Mathematics (ÚM)

Learning outcomes of the course unit

Students will be able to solve more complicated mathematical and technical problems.

Prerequisites

Basic programming techniques and their implementation in Borland Delphi

Co-requisites

Not applicable.

Planned learning activities and teaching methods

The course is taught through exercises which are focused on practical topics presented in lectures.

Assesment methods and criteria linked to learning outcomes

Course-unit credit is awarded on condition of having worked out semester work and programmed elementary algorithm.

Course curriculum

Not applicable.

Work placements

Not applicable.

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.

Specification of controlled education, way of implementation and compensation for absences

Missed lessons may be compensated for via a written test.

Recommended optional programme components

Not applicable.

Prerequisites and corequisites

Not applicable.

Basic literature

Martišek, D.: Algoritmizace a programování, Brno 2004, elektronická učebnice

Recommended reading

Not applicable.

Classification of course in study plans

  • Programme B3A-P Bachelor's

    branch B-MAI , 3 year of study, winter semester, elective

Type of course unit

 

Computer-assisted exercise

26 hod., compulsory

Teacher / Lecturer

doc. PaedDr. Dalibor Martišek, Ph.D.

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.