Basics of Algorithmization
Code | Completion | Credits | Range | Language |
---|---|---|---|---|
818ZALG | Z,ZK | 4 | 2P+2C | Czech |
- Garant předmětu:
- Lecturer:
- Tutor:
- Supervisor:
- Department of Software Engineering
- Synopsis:
-
This course is devoted to selected algorithms and methods for algorithm design. This course intruduces selected methods for the determination of the algorithm complexity.
- Requirements:
-
The „Basic of programming“ course
- Syllabus of lectures:
-
1. Algorithm
2. Data structures
3. Algorithm design methods
4. Recursion.
5. Ordering(sorting)
6. Balanced trees, optimal trees.
7. Seminumerical algorithms
- Syllabus of tutorials:
-
The sylabus of the excercises is the same as the sylabus of the lecture.
- Study Objective:
-
Knowledge:
Common algorithms (such as sorting) and common data structurs (such as the list, the tree, the hash table).
Ability:
Using the usual methods for algorithm design and in selected cases determining the algorithm complexity.
- Study materials:
-
Key references:[1] Virius, M.: Základy algoritmizace v C++. 3. vydání. Praha, ČVUT 2014. ISBN 978-80-01-05606-6 (in Czech).
Recommended references:
[1] Knuth, Donald E. The Art of the Computer Programming. Vol. 1, 2, 3. Addison-Wesley Professional 1998. ISBN: 0201485419
[2] Wirth, N. Algorithms + Data Structures = Programs. Prentice Hall 1975.
[3] Topfer, P. Algoritmy a programovací techniky. Praha, Prometheus 1995.
- Note:
- Further information:
- No time-table has been prepared for this course
- The course is a part of the following study plans:
-
- Applications of Informatics in Natural Sciences (compulsory course in the program)