Skip to main content
Skip header
Close

Searching

Algorithms II

Type of study Bachelor
Language of instruction English
Code 460-2003/05
Abbreviation ALG II
Course title Algorithms II
Credits 5
Coordinating department Department of Computer Science
Course coordinator doc. Mgr. Jiří Dvorský, Ph.D.

Osnova předmětu

Transform and conquer strategy. Data presorting. Gaussian elimination. AVL trees.
Representation change. Heap and heapsort. Horner's rule. Binary exponentation.
Problem reduction strategy. Reduction to graph problems.
Space-time trade-offs. Hashing. B-trees.
Dynamic programming. Knapsack problem. Floyd algortihm.
Greedy algorithms. Prim's, Dijkstra's algorithms. Huffman coding.
Iterative improvement strategy. Simplex methods.
Coping with the limitation of algorithm power. P, NP and NP-complete problems.
Backtracking. Eight queens problem.
Approximation algorithms for NP-hard problems.

Computer seminars
Gaussian elimination. AVL trees.
Implementation of heap and heapsort.
Hash tables.
B-trees.
Dynamic programming. Floyd algortihm.
Greedy algorithms. Prim's, Dijkstra's algorithms.
Huffman coding.
Simplex methods.
Backtracking. Eight queens problem.
Approximation algorithms for NP-hard problems.

Povinná literatura

LEVITIN, Anany. Introduction to the Design and Analysis of Algorithms. 3rd ed. Boston: Pearson, 2012. ISBN 978-0-13-231681-1 .
CORMEN, Thomas H. Introduction to algorithms. 2nd ed. Cambridge, Mass.: MIT Press, 2001. ISBN 02-620-3293-7.
SEDGEWICK, Robert. Algorithms in C. 3rd ed. Reading, Mass: Addison-Wesley, 1998. ISBN 978-020-1350-883 .

Advised literature

STROUSTRUP, Bjarne. The C++ programming language. Fourth edition. Upper Saddle River, NJ: Addison-Wesley, 2013. ISBN 978-0321563842 .
SCHILDT, Herbert. Teach yourself C++. 3rd ed. Berkeley: Osborne McGraw-Hill, 1998. ISBN 978-0078823923 .


back to search page