Obligatory courses for 1st grade 2nd stage Computer Science (course group defined by Faculty of Mathematics, Informatics, and Mechanics)
Course group schedules
|
Key
If course is offered then a registration cart will be displayed.
- you are not logged in 
- currently you are not allowed to register 
- you are allowed to register 
- you are allowed to unregister (or withdraw application) 
- you applied for registration (and you cannot widrdraw this application) 
- you are registered (and you cannot unregister)
Use one of the "i" icons below for additional information.
2023Z - Winter semester 2023/24 2023L - Summer semester 2023/24 2024Z - Winter semester 2024/25 2024L - Summer semester 2024/25 (there could be semester, trimester or one-year classes) |
Actions | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 2023Z | 2023L | 2024Z | 2024L | |||||||
| 1000-217bIII |
 
|
n/a |
|
n/a |
Classes
Winter semester 2023/24
Groups
Brief description
The classes are a platform where students present ideas of potential business. The students’ presentations are complemented by lectures concerning the legal and economical issues related to running a business in informatics. |
|
||||
| 1000-217bLOG | n/a |
|
n/a |
|
Classes
Summer semester 2023/24
Groups
Brief description
Introduction to propositional logic and first-order logic: element of model theory, elements of proof theory, role in computer science. Other logics important in computer science. |
|
||||
| 1000-217bMRJ |
|
n/a |
|
n/a |
Classes
Winter semester 2023/24
Groups
Brief description
An overview of fundamental problems and techniques of interpreter and compiler construction. The central topics of the course are methods and tools of semantic analysis of programs as well as code generation and optimisation for various platforms (JVM, LLVM, assembly). The course builds upon knnowledge and abilities from the course "Programming Languages and Paradigms" (or an equivalent course). Completing the course should enable students to create a compiler for a simple programming language. |
|
||||
| 1000-218bZO |
|
n/a |
|
n/a |
Classes
Winter semester 2023/24
Groups
Brief description
Complexity theory is complementary to algorithmics. While algorithmics provides efficient solutions of computational problems, complexity theory explains why some problems are too hard to be solved by good algorithms, and classifies problems according to their difficulty. It also evaluates various features that may enhance the traditional model of computation, like randomness, parallelism, interaction, or quantum effects. |
|
||||
