The course provides knowledge on design and analysis of algorithms for problems in the discrete mathematics domain. Include, fundamentals of discrete mathematics and algorithms; the basic methods for design algorithms (exhaustive, greedy, dynamic programming, random or approximate method...); mathematical tools for combinatorial optimization problems on finite sets of large structures; discrete mathematical structures related to graphs; on number theory and applied cryptography. After completing the course, students will have the basic knowledge and skills to do research and solve real-world problems with discrete object sets.