After successful completion of the course, students are able to describe various algorithms that are used in discrete mathematics, to carry out a run time analysis, to establish proofs of correctness, and to solve different types of reccurrence relations.
Basic algorithms and data structures, basic geometric algorithms, analysis and cost estimates of algorithms
Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2009).
Introduction to Algorithms (3rd ed.).
MIT Press and McGraw-Hill.
ISBN 0-262-03384-4.
