FPF:UINA513 Combinatorial Algorithms - Course Information

UINA513 Combinatorial Algorithms

Extent and Intensity

2/0/0. 4 credit(s). Type of Completion: zk (examination).

Teacher(s)

RNDr. Radka Poláková, Ph.D. (lecturer)

Guaranteed by

RNDr. Radka Poláková, Ph.D.
Institute of Computer Science – Faculty of Philosophy and Science in Opava

Timetable

Thu 18:55–20:30 PED1

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 (programme FPF, CompSci-np)

Language of instruction

Czech

• Enrolment Statistics (Winter 2023, recent)
  
• Permalink: https://is.slu.cz/course/fpf/winter2023/UINA513