This course is designed to introduce students to the techniques, algorithms, and reasoning processes involved in the study of discrete mathematical structures. Students will be introduced to set theory, deductive and inductive reasoning, elementary counting techniques, ordering, functional and equivalence relations, graphs, and trees. The aim is to give them knowledge and skills that would enable to use the basic methods of discrete mathematics in subsequent courses, in the design and analysis of algorithms, computability theory, software engineering, and computer systems.
The grading allocation is designed as follows:
The final ranking for the course will turn out by summarising the student’s individual results of quizzes, tests and exam (maximum sum of points is 100) and the final grade will be as follows:
S.Lipschutz and M.Lipson. Schaum's Outline of Discrete Mathematics, McGraw Hill 2007, Revised 3rd edition
K. H. Rosen. Discrete Mathematics and Its Applications, WCB/McGraw Hill, 7th edition
L. Lovász, J. Pelikán, K. Vesztergombi. Discrete mathematics: elementary and beyond. Springer 2003
R. Palm. Diskreetse matemaatika elemendid. Tartu Ülikooli Kirjastus, Tartu, 2003. Avalik koopia TÜ Raamatukogust