Algorithms

Course guarantor:

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.

Requirements:

Use of MATLAB, or MATHEMATICA , or high-level language, such as C++ required. Understanding of z-transform solution for difference equations, fundamentals of numerical mathematics.

Syllabus of lectures:

Syllabus of tutorials:

Study Objective:

Knowledge of theoretical principles of algorithms combined with a good engineering ability to make own algorithms and to implement them in MATLAB environment.

Study materials:

R. L. Graham, D. E. Knuth, O. Patashnik: Concrete Mathematics, Addison - Wesley Publishing Company, Inc., 2004; R. Sedgewick: Algorithms, Addison - Wesley Publishing Company, Inc., 1983; R. E. Blahut: Fast Algorithms for Digital Signal Processing, Addison - Wesley Publishing Company, Inc., 1985.

Note:

Further information:

No time-table has been prepared for this course

The course is a part of the following study plans: