FPF:UIN3032 Algorithms in Discrete Mathema - Course Information
UIN3032 Algorithms in Discrete Mathematics I
Faculty of Philosophy and Science in OpavaWinter 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 offered to students of any study field.
- Language of instruction
- Czech
- Further Comments
- The course can also be completed outside the examination period.
- Enrolment Statistics (Winter 1999, recent)
- Permalink: https://is.slu.cz/course/fpf/winter1999/UIN3032