Academic year 2018/2019 |
Supervisor: | doc. PaedDr. Dalibor Martišek, Ph.D. | |||
Supervising institute: | ÚM | |||
Teaching language: | Czech | |||
Aims of the course unit: | ||||
Elementary programme techniques. Use of graphic programmes. | ||||
Learning outcomes and competences: | ||||
Students will be able to programme elementary types of mathematic and technical problems. | ||||
Prerequisites: | ||||
Basic knowledge of computer control. | ||||
Course contents: | ||||
The course familiarises students with Computer language PASCAL implemented in the environment Borland DELPHI – constants and variables, procedures, functions, cycles, elementary data types. Also dealt with is array, list, front, LIFO-structure. Sorted array, matrixes, Gauss elimination. Elementary text works. Recursive procedures and functions and their use. | ||||
Teaching methods and criteria: | ||||
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. | ||||
Controlled participation in lessons: | ||||
Missed lessons may be compensated for via a written test. | ||||
Type of course unit: | ||||
Computer-assisted exercise | 13 × 2 hrs. | compulsory | ||
Course curriculum: | ||||
Computer-assisted exercise | 1) Borland Delphi Environment, Project, Unit, Forms. Objects, their properties and events. Program branches, cycles. 2) Sums and product of numeric series. 3-4) Maximum and minimum of numeric sequences, sorting of numeric sequences, string sequence and its sorting according to English and Czech alphabet. 5) Records multivariate date arrays, matrix sum and product. 6) Gauss elimination, determinant of matrix 7) Record date type. Reading, editing and writing of extern text file 8) Elements of databases. 9) Binary files, date compression and de-compression by method of RLE 10) Data structures – front, container, binary tree 11) Recursive procedures and functions 12) Rounding errors and their behaviour in technical calculations, numeric series convergence. 13,14) Semester work processing Presence in the seminar is obligatory. |
|||
Literature - fundamental: | ||||
1. Virius, M.: Programování v C# od základů k profesionálnímu použití. Grada, 2021 |
The study programmes with the given course: | |||||||||
Programme | Study form | Branch | Spec. | Final classification | Course-unit credits | Obligation | Level | Year | Semester |
B3A-P | full-time study | B-MAI Mathematical Engineering | -- | Cr | 0 | Elective (voluntary) | 1 | 2 | W |
Faculty of Mechanical Engineering
Brno University of Technology
Technická 2896/2
616 69 Brno
Czech Republic
+420 541 14n nnn
+420 726 81n nnn – GSM Telef. O2
+420 604 07n nnn – GSM T-mobile
Operator: nnnn = 1111