Subjects

Your browser does not support JavaScript, or its support is disabled. Some features may not be available.

Discrete Models and Algorithms - NSZI067 (Informatika nMgr. - zaměření Diskrétní modely a algoritmy)

Title:	Diskrétní modely a algoritmy
Guaranteed by:	Student Affairs Department (32-STUD)
Faculty:	Faculty of Mathematics and Physics
Actual:	from 2021
Semester:	both
E-Credits:	0
Hours per week, examination:	0/0, STEX [HT]
Capacity:	unlimited
Min. number of students:	unlimited
4EU+:	no
Virtual mobility / capacity:	no
State of the course:	taught
Language:	Czech
Teaching methods:	full-time
Teaching methods:	full-time
Note:	can be fulfilled in the future no points awarded for fulfilment you can enroll for the course in winter and in summer semester

Opinion survey results Examination dates WS schedule SS schedule Noticeboard

Order	Course title
Topic 1 (TO1) select 2
1	Introduction to complexity and computability
2	Data structures
Topic 2 (TO2) select 3
3	Combinatorics and graph theory
4	Probabilistic methods and combinatorial enumeration
5	Polyhedral optimisation
6	Graph algorithms
7	Combinatorial and computational geometry
8	Structures in Computer Science
9	Topology in Computer Science and Combinatorics
10	Category theory in Computer Science
11	Number theory in Computer Science
12	Nonlinear programming
13	Discrete optimisation processes
14	Multiobjective and integer programming
15	Parametric programming and interval methods

Requirements to the exam - Czech

Last update: Mgr. Dina Novotná Obeidová (19.08.2021)

Státní závěrečná zkouška

Student dostane pět otázek, dvě ze společného základu (jednu z~Úvodu do složitosti a~vyčíslitelnosti a~jednu z~Datových struktur) a~po jedné ze tří studentem zvolených zkušebních okruhů. Alespoň dva z~těchto zkušebních okruhů musejí náležet do zvoleného studentova zaměření, jeden zkušební okruh může být z~jiného zaměření.