The graduate is familiar with discrete approaches and techniques and discrete structures in computer science and in algorithmic modelling of practical phenomena. Depending on profilation, he or she has good knowledge in several of the areas: combinatoric (graph theory), probabilistic techniques and methods, discrete and computational geometry, algebraic and topological methods, number theory, linear and nonlinear programming, discrete optimization.

He or she is prepared for Ph.D. study and is in contact with the last results in the area and, ideally, make his or her own contribution. The graduate can work in academia or in practical areas applying algorithms and discrete modelling.