Discrete Mathematics 510-IS1-1MDY-25
Course profile: General Academic
Form of study: Full-time studies
Course type: Basic
Field of science: natural sciences
Discipline of science: mathematics/informatics
Year/semester of study: 1 / 2
Prerequisites (sequential system of courses and exams): Items introducing: Elements of Logic and Set Theory, Linear Algebra with Analytic Geometry, Mathematical Analysis 1,
ECTS credits: 5
Balance of student workload:
Class attendance:
- lecture 30h
- exercise classes 30h
Course preparation:
- lecture 5h
- exercise classes 15h
Literature familiarization: 5h
Preparation for tests: 21h
Preparation for the exam: 11h
Test duration: 4,5h
Exam duration: 2h
The total number of hours of exams and tests: 6,5h
Individual consultation with the teacher: 1,5h
Student workload:
- that requires direct interaction with the teacher: 68h, 2,7 ECTS
- that does not require direct interaction with the teacher: 57h, 2,3 ECTS
Type of course
Mode
Requirements
Prerequisites
Course coordinators
Learning outcomes
The student has the necessary skills to model computer science problems using combinatorial and graph structures within the field of discrete mathematics. KP6_WG1
They utilise Dijkstra's algorithm, as well as methods for encoding and decoding the Prüfer code, as effective tools for solving optimisation and structural problems in discrete mathematics. KP6_WG3:
They can apply mathematical analysis tools to determine general formulas for recursively defined sequences, using the characteristic equation method and generating functions for this purpose. KP6_UW2
The student uses the apparatus of mathematical logic to formally describe discrete structures and applies the principle of mathematical induction (including strong induction) as a proof tool. KP6_UW4
The student can analyse the operation of Dijkstra's algorithm and Eulerian procedures and use them to investigate graph properties, such as determining the number and form of the shortest paths. KP6_UW6
Assessment criteria
Form of assessment: class tests and the final exam.
Bibliography
Bibliography:
1. Kenneth H. Rosen, Handbook of discrete and combinatorial mathematics (Discrete mathematics and its applications - 1st Edition), CRC Press.
2. Ralph P. Grimaldi, Discrete and combinatorial mathematics: An applied introduction, 2nd Edition.
3. Kenneth A. Ross, Charles R.B. Wright, Discrete mathematics, 5th Edition
Additional bibliography:
1. Cordelia Hall , John O’Donnell, Discrete Mathematics Using a Computer , Springer London, 2000
2. A. K. Agarwal, Bruce C. Berndt, Christian F. Krattenthaler, Gary L. Mullen, K. Ramachandra, Michel Waldschmidt, Number Theory and Discrete Mathematics, Hindustan Book Agency Gurgaon, 2002
Additional information
Additional information (registration calendar, class conductors, localization and schedules of classes), might be available in the USOSweb system: