FPF:UIN1065 Chapters in Discrete Mathemati - Course Information
UIN1065 Chapters in Discrete Mathematics I
Faculty of Philosophy and Science in OpavaWinter 2008
- Extent and Intensity
- 2/0/0. 3 credit(s). Type of Completion: z (credit).
- Teacher(s)
- doc. Ing. Petr Sosík, Dr. (lecturer)
- Guaranteed by
- doc. Ing. Petr Sosík, Dr.
Institute of Computer Science – Faculty of Philosophy and Science in Opava - Prerequisites (in Czech)
- MU10132 || MU10216 || MU10232
- Course Enrolment Limitations
- The course is also offered to the students of the fields other than those the course is directly associated with.
- fields of study / plans the course is directly associated with
- Computer Science and Technology (programme FPF, B1801 Inf)
- Computer Science and Technology (programme FPF, M1801 Inf)
- Computer Science and Technology (programme FPF, N1801 Inf)
- Secondary School Teacher Training in Computer Science (programme FPF, M7504)
- Secondary school teacher training in general subjects with specialization in Computer Science (programme FPF, M7504)
- Course objectives
- The course offers an introduction to a sequence of elegant methods of discrete mathematics which are useful, among others, when: (a) evaluating time and space complexity of recursive algorithms (b) analysing the behavior of algorithms calculating with real numbers (c) analysing algorithms of artificial intelligence (d) examining reliability of algorithms.
- Syllabus
- 1. Recurrent problems: the concept of recurrence, closed form and a proof of its correctness. Sample problems: Hanoi towers, lines in the plane, Josephus problem and its generalization. Repertoire method.
2. Manipulation with sums: notation and transformation of indices, allowed re-arrangements, Iverson notation. Associative, commutative and distributive law.
3. Multiple sums, dependent and independent indices. Simplification of multiple sums. Generalized associative, commutative and distributive law.
4. Sums and recurrences: mutual transformations of sums and recurrences, the summation factor method, the perturbation method.
5. Operations of difference a summation as a discrete parallel of differencial and integral calculus. Their applications in evaluation of sums and recurences.
- 1. Recurrent problems: the concept of recurrence, closed form and a proof of its correctness. Sample problems: Hanoi towers, lines in the plane, Josephus problem and its generalization. Repertoire method.
- Literature
- Assessment methods
- Oral exam
- Language of instruction
- Czech
- Further Comments
- The course can also be completed outside the examination period.
- Enrolment Statistics (Winter 2008, recent)
- Permalink: https://is.slu.cz/course/fpf/winter2008/UIN1065