FPF:UIN3032 Algorithms in Discrete Mathema - Course Information
UIN3032 Algorithms in Discrete Mathematics I
Faculty of Philosophy and Science in OpavaSummer 1999
- Extent and Intensity
- 0/0. 0 credit(s). Type of Completion: zk (examination).
- Guaranteed by
- Institute of Computer Science – Faculty of Philosophy and Science in Opava
- Prerequisites (in Czech)
- UINA331 Non-Sequential Computations || UIN3031 Non-Sequential Computations
- 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)
- Informatika a výpočetní technika (programme FPF, M7504)
- Computer Science and Technology (programme FPF, N1801 Inf)
- Mathematical Methods in Economics (programme MU, B1101)
- Language of instruction
- Czech
- Further Comments
- The course can also be completed outside the examination period.
- Enrolment Statistics (Summer 1999, recent)
- Permalink: https://is.slu.cz/course/fpf/summer1999/UIN3032