Filter:
Faculty:
---
Institute of the History of Charles University and Archive of Charles University
Center for Theoretical Study
Environment Centre
Centre for Knowledge and Technology Transfer
Charles University
Catholic Theological Faculty
Protestant Theological Faculty
Hussite Theological Faculty
Faculty of Law
First Faculty of Medicine
Second Faculty of Medicine
Third Faculty of Medicine
Faculty of Medicine in Pilsen
Faculty of Medicine in Hradec Králové
Faculty of Pharmacy in Hradec Králové
Faculty of Arts
Faculty of Science
Faculty of Mathematics and Physics
Faculty of Education
Faculty of Social Sciences
Faculty of Physical Education and Sport
Faculty of Humanities
Institute for Language and Preparatory Studies
Central Library of Charles University
Centre for Economic Research and Graduate Education
Rectorate
Class:
---
Mg k průpravné zkoušce, 2.+3. ročník (B)
DS, matematické a počítačové modelování (DF11)
DS, fyzika plazmatu a ionizovaných prostředí (DF2)
DS, fyzika povrchů a rozhraní (DF5)
DS, geofyzika (DF7)
DS, meteorologie a klimatologie (DF8)
DS, teoretická informatika (DI1)
DS, softwarové systémy (DI2)
DS, matematická lingvistika (DI3)
DS, diskrétní modely a algoritmy (DI4)
DS, algebra, teorie čísel a matematická logika (DM1)
DS, geom. a topologie, gl. analýza a ob. struktury (DM2)
DS, matematická analýza (DM3)
DS, ekonometrie a operační výzkum (DM5)
DS, vědecko - technické výpočty (DM6)
DS, obecné otázky matematiky a informatiky (DM8)
Pravděp. a statistika, ekonometrie a fin. mat. (DM9)
Mg nepovinně volitelné (F)
Informatika Bc. (IB)
Informatika Mgr. - volitelný (IM)
Informatika Mgr. - učitelské studium informatiky (IMU)
Informatika Mgr. - Teoretická informatika (IM1)
Informatika Mgr. - Softwarové systémy (IM2)
Informatika Mgr. - Matematická lingvistika (IM3)
Informatika Mgr. - Diskrétní modely a algoritmy (IM4)
Kombinatorická geometrie a geom. algorit (KG)
M Bc. DGZV (MBDG)
M Bc. DGZV > Povinné (MBDGP)
M Bc. DGZV > Doporučené volitelné (MBDGV)
M Bc. DGZV > 1. ročník (MBDG1)
M Bc. DGZV > 2. ročník (MBDG2)
M Bc. FM (MBFM)
M Bc. FM > Povinné (MBFMP)
M Bc. FM > Povinně volitelné (MBFMPV)
M Bc. FM > Doporučené volitelné (MBFMV)
M Bc. FM > 1. ročník (MBFM1)
M Bc. FM > 2. ročník (MBFM2)
M Bc. MMIB (MBIB)
M Bc. MMIB > Povinné (MBIBP)
M Bc. MMIB > Povinně volitelné (MBIBPV)
M Bc. MMIB > Doporučené volitelné (MBIBV)
M Bc. MMIB > 1. ročník (MBIB1)
M Bc. MMIB > 2. ročník (MBIB2)
M Bc. MMIT (MBIT)
M Bc. MMIT > Povinné (MBITP)
M Bc. MMIT > Povinně volitelné (MBITPV)
M Bc. MMIT > Doporučené volitelné (MBITV)
M Bc. MMIT > 1. ročník (MBIT1)
M Bc. MMIT > 2. ročník (MBIT2)
M Bc. MOD (MBMO)
M Bc. MOD > Povinné (MBMOP)
M Bc. MOD > Povinně volitelné (MBMOPV)
M Bc. MOD > Volitelné (MBMOV)
M Bc. OM (MBOM)
M Bc. OM > Zaměření MA (MBOMMA)
M Bc. OM > Zaměření MSTR (MBOMMS)
M Bc. OM > Zaměření NUMMOD (MBOMNM)
M Bc. OM > Povinné (MBOMP)
M Bc. OM > Povinně volitelné (MBOMPV)
M Bc. OM > Zaměření STOCH (MBOMSO)
M Bc. OM > Doporučené volitelné (MBOMV)
M Bc. OM > 1. ročník (MBOM1)
M Bc. OM > 2. ročník (MBOM2)
M Bc. MZV (MBUM)
M Bc. MZV > Povinné (MBUMP)
M Bc. MZV > Doporučené volitelné (MBUMV)
Mat. logika a teorie množin (ML)
M Mgr. FPM (MMFP)
M Mgr. FPM > Povinné (MMFPP)
M Mgr. FPM > Povinně volitelné (MMFPPV)
M Mgr. FPM > Volitelné (MMFPV)
M Mgr. MMIB (MMIB)
M Mgr. MMIB > Povinné (MMIBP)
M Mgr. MMIB > Povinně volitelné (MMIBPV)
M Mgr. MMIB > Volitelné (MMIBV)
M Mgr. MA (MMMA)
M Mgr. MA > Povinné (MMMAP)
M Mgr. MA > Povinně volitelné (MMMAPV)
M Mgr. MA > Volitelné (MMMAV)
M Mgr. MOD (MMMO)
M Mgr. MOD > Povinné (MMMOP)
M Mgr. MOD > Povinně volitelné (MMMOPV)
M Mgr. MOD > Volitelné (MMMOV)
M Mgr. NVM (MMNM)
M Mgr. NVM > Povinné (MMNMP)
M Mgr. NVM > Povinně volitelné (MMNMPV)
M Mgr. NVM > Volitelné (MMNMV)
M Mgr. PMSE (MMPM)
M Mgr. PMSE > Povinné (MMPMP)
M Mgr. PMSE > Povinně volitelné (MMPMPV)
M Mgr. PMSE > Volitelné (MMPMV)
M Mgr. MSTR (MMST)
M Mgr. MSTR > Povinné (MMSTP)
M Mgr. MSTR > Povinně volitelné (MMSTPV)
M Mgr. MSTR > Volitelné (MMSTV)
Mat. modelování (MOD)
Obecná topologie a teorie kategorií (TTK)
Učitelství matematiky (UM)
Code
Title
Semester
Hours per week, examination
Department
Faculty
Cyclical teaching
Virtual mobility
Capacity
4EU+
NAIL002
Neural Networks
winter
winter s.:4/2, C+Ex
[HT]
32-KTIML
11320
no
no
no
NAIL013
Applications of Neural Networks Theory
summer
summer s.:2/0, Ex
[HT]
32-KTIML
11320
no
no
no
NAIL015
Neural Networks Implementation 2
summer
summer s.:2/2, C+Ex
[HT]
32-KTIML
11320
no
no
no
NAIL021
Boolean Functions and Their Applications
winter
winter s.:2/0, Ex
[HT]
32-KTIML
11320
no
no
no
NAIL022
Methods of Logic Programming
winter
winter s.:2/0, Ex
[HT]
32-KTIML
11320
no
no
no
NAIL025
Evolutionary Algorithms 1
winter
winter s.:2/2, C+Ex
[HT]
32-KTIML
11320
no
no
no
NAIL028
Introduction to Robotics
winter
winter s.:2/2, C+Ex
[HT]
32-KTIML
11320
no
no
no
NAIL029
Machine Learning
summer
summer s.:2/0, Ex
[HT]
32-KTIML
11320
no
no
no
NAIL060
Neural Networks Implementation 1
winter
winter s.:2/2, C+Ex
[HT]
32-KTIML
11320
no
no
no
NAIL065
Evolutionary Robotics
summer
summer s.:2/1, C+Ex
[HT]
32-KSVI
11320
no
no
no
NAIL068
Human-like Artificial Agents
summer
summer s.:2/2, C+Ex
[HT]
32-KSVI
11320
no
no
no
NAIL069
Artificial Intelligence 1
winter
winter s.:2/1, C+Ex
[HT]
32-KTIML
11320
no
no
no
NAIL070
Artificial Intelligence 2
summer
summer s.:2/0, Ex
[HT]
32-KTIML
11320
no
no
no
NAIL071
Planning and Scheduling
summer
summer s.:2/0, Ex
[HT]
32-KTIML
11320
no
no
no
NAIL076
Logic Programming 1
winter
winter s.:2/0, Ex
[HT]
32-KTIML
11320
no
no
no
NAIL077
Logic Programming 2
summer
summer s.:2/0, Ex
[HT]
32-KTIML
11320
no
no
no
NAIL078
Lambda Calculus and Functional Programming 1
winter
winter s.:2/1, C+Ex
[HT]
32-KTIML
11320
no
no
no
NAIL079
Lambda Calculus and Functional Programming 2
summer
summer s.:2/1, C+Ex
[HT]
32-KTIML
11320
no
no
no
NAIL086
Evolutionary Algorithms 2
summer
summer s.:2/2, C+Ex
[HT]
32-KTIML
11320
no
no
no
NAIL104
Probabilistic graphical models
winter
winter s.:2/0, Ex
[HT]
32-KTIML
11320
no
no
no
NAIL106
Multiagent Systems
summer
summer s.:2/2, C+Ex
[HT]
32-KTIML
11320
no
no
no
NAIL108
Mobile Robotics
summer
summer s.:1/1, MC
[HT]
32-KTIML
11320
no
no
no
NAIL116
Social networks and their analysis
winter
winter s.:2/2, C+Ex
[HT]
32-KTIML
11320
no
no
no
NAIL133
Human-like Artificial Agents
summer
summer s.:1/2, C+Ex
[HT]
32-KSVI
11320
no
no
no
NDBI023
Data Mining
summer
summer s.:2/2, C+Ex
[HT]
32-KTIML
11320
no
no
no
NDMI007
Combinatorial Algorithms
summer
summer s.:2/2, C+Ex
[HT]
32-KAM
11320
no
no
no
NDMI010
Graph Algorithms
winter
winter s.:2/0, Ex
[HT]
32-KAM
11320
no
no
no
NDMI025
Randomized Algorithms
summer
summer s.:2/2, C+Ex
[HT]
32-IUUK
11320
no
no
no
NDMX025
Randomized Algorithms
summer
summer s.:2/2, C+Ex
[HT]
32-STUD
11320
no
no
no
NMAI060
Probabilistic Methods
winter
winter s.:2/0, Ex
[HT]
32-KSI
11320
no
no
no
NMAI061
Methods of Mathematical Statistics
summer
summer s.:2/1, C+Ex
[HT]
32-KSI
11320
no
no
no
NMAI064
Mathematical Structures
summer
summer s.:2/2, C+Ex
[HT]
32-KAM
11320
no
no
no
NOPT042
Constraint Programming
winter
winter s.:2/2, C+Ex
[HT]
32-KTIML
11320
no
no
no
NOPT059
Large-scale optimization: Exact methods
summer
summer s.:2/2, C+Ex
[HT]
32-KTIML
11320
no
no
no
NOPT061
Large-scale optimization: Metaheuristics
summer
summer s.:2/2, C+Ex
[HT]
32-KTIML
11320
no
no
no
NTIN017
Parallel Algorithms
summer
summer s.:2/0, Ex
[HT]
32-KSVI
11320
no
no
no
NTIN022
Probabilistic Techniques
winter
winter s.:2/2, C+Ex
[HT]
32-IUUK
11320
no
no
no
NTIN063
Complexity
summer
summer s.:2/1, C+Ex
[HT]
32-KTIML
11320
no
no
no
NTIN064
Computability
summer
summer s.:2/0, Ex
[HT]
32-KTIML
11320
no
no
no
NTIN065
Computability 2
summer
summer s.:2/0, Ex
[HT]
32-KTIML
11320
no
no
no
NTIN066
Data Structures 1
both
2/2, C+Ex
[HT]
32-KTIML
11320
no
no
no
NTIN067
Data Structures 2
summer
summer s.:2/0, Ex
[HT]
32-KTIML
11320
no
no
no
NTIN073
Recursion
winter
winter s.:2/0, Ex
[HT]
32-KTIML
11320
no
no
no
NTIN074
Recursion 2
summer
summer s.:2/1, C+Ex
[HT]
32-KTIML
11320
no
no
no
NTIN081
Computational complexity and interactive protocols
summer
summer s.:2/0, Ex
[HT]
32-IUUK
11320
no
no
no
NTIN082
Nonuniform computational models
summer
summer s.:2/0, Ex
[HT]
32-IUUK
11320
no
no
no
NTIN084
Bioinformatics Algorithms
winter
winter s.:2/2, C+Ex
[HT]
32-KSVI
11320
no
no
no
NTIN085
Selected Topics in Computational Complexity I
winter
winter s.:2/1, C+Ex
[HT]
32-IUUK
11320
no
no
no
NTIN086
Selected Topics in Computational Complexity II
summer
summer s.:2/1, C+Ex
[HT]
32-IUUK
11320
no
no
no
NTIN087
String Algorithms
winter
winter s.:2/0, Ex
[HT]
32-KSVI
11320
no
no
no
NTIN096
Pseudo-Boolean Optimization
summer
summer s.:2/0, Ex
[HT]
32-KTIML
11320
no
no
no
NTIN097
Hypercube structures
winter
winter s.:2/0, Ex
[HT]
32-KTIML
11320
no
no
no
NTIN099
Algorithms for knowledge representation
summer
summer s.:2/0, Ex
[HT]
32-KTIML
11320
no
no
no
NTIN103
Introduction to Parameterized Algorithms
winter
winter s.:2/2, C+Ex
[HT]
32-IUUK
11320
no
no
no
NTIN106
Implementation of algorithms and data structures
winter
winter s.:0/2, C
[HT]
32-KTIML
11320
no
no
no
NTIN110
Selected Topics in Data Structures
winter
winter s.:2/0, Ex
[HT]
32-KAM
11320
no
no
no
NTIN114
Streaming algorithms for Big Data
winter
winter s.:2/0, Ex
[HT]
32-IUUK
11320
no
no
no