Discrete mathematics 1000-711MAD
Counting methods: induction, recursive equation solving, finite sums, asymptotics.
Combinatorial objects: permutations, graphs, trees, words.
Set theory: sets, functions, relations (including orders and equivalence relations), cardinality.
Type of course
Admission to the exam based on homeworks, final assessment based on tests and writing exam.
Information on level of this course, year of study and semester when the course unit is delivered, types and amount of class hours - can be found in course structure diagrams of apropriate study programmes. This course is related to the following study programmes:
Additional information (registration calendar, class conductors, localization and schedules of classes), might be available in the USOSweb system: