Design and Analysis of Algorithms
Code | Completion | Credits | Range | Language |
---|---|---|---|---|
128XNAA | Z | 1 | 1+1 | Czech |
- Lecturer:
- Jiří Demel
- Tutor:
- Jiří Demel
- Supervisor:
- Department of Applied Informatics
- Synopsis:
-
specification, proof of correctness, time and space complexity.
Basic data structures, sorting, selected graph algorithms.
P and NP problems.
- Requirements:
-
none
- Syllabus of lectures:
- Syllabus of tutorials:
- Study Objective:
-
Recognition of specifications of algorithmic problems. Proving of correctness of algorithms and their complexity.
- Study materials:
-
Kozen, D.: The Design and Analysys of Algorithms, Springer, 1991.
Aho, Hopcroft, Ullman, Design and analysys of Computer Algorithms, Addison-Wesley, 1974.
[3] J. Demel, Grafy a jejich aplikace, Academia, Praha, 2002
- Note:
- Time-table for winter semester 2011/2012:
-
06:00–08:0008:00–10:0010:00–12:0012:00–14:0014:00–16:0016:00–18:0018:00–20:0020:00–22:0022:00–24:00
Mon Tue Fri Thu Fri - Time-table for summer semester 2011/2012:
- Time-table is not available yet
- The course is a part of the following study plans: