Course: Discrete Mathematics

« Back
Course title Discrete Mathematics
Course code UMKM/ADIM
Organizational form of instruction Lecture + Lesson
Level of course Master
Year of study not specified
Semester Winter
Number of ECTS credits 3
Language of instruction English
Status of course Compulsory
Form of instruction Face-to-face
Work placements This is not an internship
Recommended optional programme components None
Course availability The course is available to visiting students
Lecturer(s)
  • Zahrádka Jaromír, RNDr. Ph.D.
Course content
Numeration systems, numeration in the floating point, standard IEEE. Congruence and its aplications. Mathematical logic, disjunctive and conjunctive forms. Boolean algebra. Combinatorics, the binomial and multinomial theorem. Sets, principle of inclusion-exclusion. Undirected and directed graphs. Paths and circuits in the graph. Metric of graph, searching for the shortest or optimum way. Trees, spanning tree, cryptography, Kruskal's algorithm. Graphs coloring. Numerical methods for solving linear and nonlinear equations and systems. Numerical methods for calculating derivations, partial derivations and particular integrals. Numerical solving of differential equations.

Learning activities and teaching methods
Monologic (reading, lecture, briefing), Methods of individual activities, Projection, Skills training
  • unspecified - 39 hours per semester
Learning outcomes
To follow up with the previous mathematical and mathematic-economical courses and acquaint the students with the topics of mathematical sets and logic, graphs theory and numerical methods with the view to economics and informatics.
Students will be able to solve basic as well as follow-up applied problems in the area of mathematical sets, logic, theory of graphs and numerical methods by the use of EXCEL programming environment.
Prerequisites
Basic mathematical knowns and skills of the mathematics of the middle schools, subjests of mathematics of the bachelor study and EXCEL programing language.

Assessment methods and criteria
Home assignment evaluation, Student performance assessment, Work-related product analysis

Assignment - two successful written exams and six semestr projects.
Recommended literature
  • Feil, Todd. Essential discrete mathematics for computer science. Upper Saddle River: Pearson Education, 2003. ISBN 0-13-018661-9.
  • Goodaire, Edgar G. Discrete mathematics with graph theory. Upper Saddle River: Prentice Hall, 2002. ISBN 0-13-092000-2.
  • Leader, J. J. Numericel Analysis and Scientific Computation. Boston, 2004. ISBN 0-321-2233-7.


Study plans that include the course
Faculty Study plan (Version) Branch of study Category Recommended year of study Recommended semester
Faculty of Economics and Administration Regional and Information Management (2013) Economy 1 Winter