Combinatorics and Discrete mathematics Basic Information M102 (2+2+0) - 6 ECTS credits Adoption and understanding of basic methods for counting elements of sets and multisets. Capability of solving reccurence relations and introducing the students to model with reccurences. Adoption of the concept of generating functions and understanding the methods for solving combinatorial problems with the help of generating functions. Overcoming the basic concepts of graph theory and knowing some of their applications. You can access the course content at the following link: PDF Teachers Instructor: Dr. Snježana Majstorović Ergotić, Associate Professor Basic literature D. Veljan, Kombinatorna i diskretna matematika, Algoritam, Zagreb 2001. J. Anderson, J. Bell, Discrete Mathematics with Combinatorics, Prentice hall, New York, 2000. J. Matoušek, J. Nešetril, Invitation to Discrete Mathematics, Oxford University Press, 1998. M. Cvitković, Kombinatorika : zbirka zadataka, Element, Zagreb, 1998. Additional literature Teaching materials The materials are available on the internal Teams channel of the course, through which all internal communication takes place. Students are required to register on the course’s Teams channel. The channel code for joining the course can be found in the schedule.