Algorithms

Lecturer:

Tutor:

Supervisor:

Department of Applied Mathematics

Synopsis:

Students obtain fundamentals of model description, theory of finite-state automata and algorithms. Several numerical algorithms are explained and principles of their implementation are introduced. Models in MATLAB/Simulink. System modeling.

Requirements:

Linear algebra, basics of math analysis, basics of programming, MATLAB.

Syllabus of lectures:

Syllabus of tutorials:

Study Objective:

Algorithmization of mathematical problems and their solution by computers. Solution of problems in the field of discrete mathematics. Theoretical knowledge is verified in MATLAB.

Study materials:

Heath, M. J. Scientific Computing: An Introductory Survey, 2nd ed., McGraw-Hill, 2002.

Moler, C. Numerical Computing with MATLAB. SIAM, 2004.

Cormen, T. Introduction to Algorithms. 2nd edition. MIT Press / McGraw-Hill, 2002

Note:

Further information:

No time-table has been prepared for this course

The course is a part of the following study plans:

• BD nav.prez. 12/13 (compulsory course)