The subject is devoted to design, analysis and verification
of algorithms with emphasis on finding of efficient algorithms
from the point of view of computational complexity. The aim
of the course is to learn different techniques commonly used
in the design of algorithms, such as dynamic programming,
greedy algorithms, and some metheds used for a searching in
a state space. The use of these techniques is illustrated on
many problems from different areas of computer science.
Povinná literatura
- Skiena, S. S., Revilla, M. A.: Programming Challenges: The Programming Contest Training Manual,
Springer, 2003.
- Cormen, T. H., Leiserson, R. L., Rivest, R. L., Stein, C.: Introduction to Algorithms, MIT Press 2001.
- Dasgupta, S., Papadimitriou, C., Vazirani, U.: Algorithms, McGraw-Hill, 2006.
Doporučená literatura
- Skiena, S. S.: The Algorithm Design Manual, Springer, 1998.
- Knuth, D. E.: The Art of Computer Programming, Volumes 1-3, (2nd edition),
Addison-Wesley Professional, 1998.
- Graham, R. L., Knuth, D. E., Patashnik, O.: Concrete Mathematics: A Foundation for
Computer Science, Addison-Wesley Professional, 1994.
- Sedgewick, R.: Algorithms in C (3rd edition), Addison-Wesley Professional, 1997.