FPF:UIN1066 Chapters in Discrete Mathemati - Course Information
UIN1066 Chapters in Discrete Mathematics II
Faculty of Philosophy and Science in OpavaSummer 2011
- 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)
- UIN1065 Chapters in Discrete Mathemati
- 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. Integer functions. Removal of the round and ceiling operators in inequalities. Floor/ceiling sums and recurrences. The binary operation mod and its applications.
2. Binomické koeficienty, základní vztahy a možnosti úprav. Zobecnění na celočíselný a reálný obor. Sumy a rekurence s binomickými koeficienty.
3. Generating functions. An example - Fibonacci numbers. Composite generating functions - sums, products, summation, difference, integral, derivation, convolution.
4. Manipulation with generating functions. Applications of generating functions in evaluation of sums and recurrences. Application examples.
- 1. Integer functions. Removal of the round and ceiling operators in inequalities. Floor/ceiling sums and recurrences. The binary operation mod and its applications.
- Literature
- Assessment methods
- Written exam
- Language of instruction
- Czech
- Further Comments
- The course can also be completed outside the examination period.
- Enrolment Statistics (Summer 2011, recent)
- Permalink: https://is.slu.cz/course/fpf/summer2011/UIN1066