Facultative courses for 3-5th grade Computer Science (course group defined by Faculty of Mathematics, Informatics, and Mechanics)
|
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 can no longer withdraw it) 
- you are registered (and you cannot unregister)
Use one of the "i" icons below for additional information.
2024Z - Winter semester 2024/25 2024L - Summer semester 2024/25 2025Z - Winter semester 2025/26 2025L - Summer semester 2025/26 (there could be semester, trimester or one-year classes) |
Actions | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 2024Z | 2024L | 2025Z | 2025L | |||||||
| 1000-2M22ALG | n/a | n/a |
 
|
n/a |
Classes
Winter semester 2025/26
Groups
Brief description
(in Polish) Wykład opisuje związki pomiędzy logiką a automatami skończonymi. Punktem wyjścia jest klasyczne twierdzenie, że automaty skończone opisują dokładnie te języki, które można zdefiniować w logice monadycznej drugiego rzędu. Wykład omawia daleko idące rozszerzenia tego twierdzenia, dotyczące przede wszystkim obiektów nieskończonych, takich jak nieskończone słowa czy drzewa. Ważną rolę w teorii odgrywają pewne gry matematyczne, przede wszystkim tzw. gry parzystości, w których rozgrywka jest nieskończona. |
|
||||
| 1000-2M23DE | n/a |
|
n/a | n/a |
Classes
Summer semester 2024/25
Groups
Brief description
Overview of the data processing pipeline; collection and storage of raw data; processing, cleaning, and storage of processed data; scaling tools for the data processing system. |
|
||||
| 1000-2M23STI | n/a | n/a | n/a |
|
Classes
Summer semester 2025/26
Groups
Brief description
No brief description found, go to course home page to get more information.
|
|
||||
| 1000-2N09ZBD | n/a |
|
n/a |
|
Classes
Summer semester 2024/25
Groups
Brief description
The course will cover various issues which have not fit into the basic database course. Furthermore, the database research domain is so huge that it would not fit into any basic course. The subjects of lectures will be relational database tuning, object-relational mapping, columnar data store, NOSQL stores (key-value, wide-column, document, graph), advanced server programming and distributed databases. |
|
||||
| 1000-2M11ZPF | n/a |
|
n/a |
|
Classes
Summer semester 2024/25
Groups
Brief description
The lecture aims to present central issues in modern functional programming in languages such as Haskell, Coq, Idris, especially focusing on usung types for program specification and verification. |
|
||||
| 1000-2N09ZSO | n/a |
|
n/a |
|
Classes
Summer semester 2024/25
Groups
Brief description
The course it is highly recommended for students who plan to attend Master Seminar on Distributed Systems, which is partly devoted to operating systems and in particular distributed operating systems. The course will have a form of lectures and labs. We plan to view in detail the structure of a specific operating system. The chosen case study is Linux which is modern operating system, popular in the Faculty of Mathematics, Computer Science and Mechanics, University of Warsaw, often used as server platform, but also on desktops, mobiles, as embedded system. Source code of Linux is freely available which gives a unique opportunity to analyze in detail used algorithms, data structures, and also to run experiments and do research in the area of operating systems. |
|
||||
| 1000-2M02AA | n/a |
|
n/a | n/a |
Classes
Summer semester 2024/25
Groups
- (from 2025-10-01) (in Polish) Grupa przedmiotów obieralnych dla informatyki magisterskiej- specjalność Automaty, logika, złożoność
Brief description
Game theory was initiated by von Neumann and Morgenstern as a mathematical theory of rational behaviour. A game comprises description of possible moves and payoffs for each of the players. Typically, each player searches for a strategy maximizing her payoff. The rational behaviour of players is well described by the concept of Nash equilibrium. |
|
||||
| 1000-2M24ATM |
|
n/a | n/a | n/a |
Classes
Winter semester 2024/25
Groups
Brief description
The lecture connects elements of structural graph theory, parameterised algorithms, and finite model theory. The main theme are algorithmic results called “algorithmic meta-theorems”, which express that entire families of computation problems can be solved efficiently on inputs enjoying specific structural properties. Typically we will consider graph problems for graphs of a particular form. For instance, every computational problem that can be expressed as a first-order sentence can be solved in linear time, on all planar graphs, or all graphs with maximum degree bounded by a fixed constant. This result can be extended to other graph classes (including nowhere dense graph classes, and monadically stable graph classes), and other logics. Note: Course given in English |
|
||||
| 1000-2N00ALG | n/a |
|
n/a |
|
Classes
Summer semester 2024/25
Groups
- (from 2025-10-01) (in Polish) Grupa przedmiotów obowiązkowych dla informatyki magisterskiej-specjalność Algorytmika
- (from 2025-10-01) (in Polish) Grupa przedmiotów obowiązkowych dla informatyki magisterskiej-specjalność Ekonomia algorytmiczna
- (from 2025-10-01) (in Polish) Grupa przedmiotów obieralnych dla informatyki magisterskiej - specjalność Kryptografia
Brief description
The course is a continuation of the course "Algorithms and data structures". The aim is to make students acquainted with the methods of constructions of efficient algorithms for various combinatorial problems. Prerequisities: Algorithms and data structures |
|
||||
| 1000-2N00SID | n/a |
|
n/a |
|
Classes
Summer semester 2024/25
Groups
Brief description
The course is focused on using intelligent methods for solving problems that are difficult or impractical to solve with other methods. Accordingly, we discuss, among the others, various approaches based on heuristics, approximations, randomized, as well as deductive and inductive schemes of reasoning, often designed by analogy to the human way of problem solving. The main topics include also intelligent search through large spaces of states and solutions, intelligent game strategies, reasoning in logic and logical foundations of planning, foundations of machine learning in relation to artificial intelligence, foundations of modeling of uncertainty, as well as various specialized applications. |
|
||||
| 1000-2M13TAU |
|
n/a |
|
n/a |
Classes
Winter semester 2024/25
Groups
Brief description
Auctions are a widely used mechanisms for resource exchange and allocation, that finds application in real world (e.g. internet auctions) as well as computational applications (e.g. resource allocation in multi-agent systems and eCommerce). Which auctions are best for the seller and which for the buyers? What is the impact of knowledge of others' valuations? How bad is collusion? Is it hard to determine the winner when bundles of several interdependent objects are being sold? Does it depend on the bidding language? The aim of this course is to introduce and present the basic issues and problems of arising in auctions and to deepen their understanding via game theory and computational complexity theory. |
|
||||
| 1000-2M05ZP | n/a |
|
n/a |
|
Classes
Summer semester 2024/25
Groups
Brief description
(in Polish) Kurs podstaw prawa, skupiony na zagadnieniach powiązanych z informatyką. Od podstaw prawa cywilnego, przez własność intelektualną, umowy sprzedaży praw i umowy licencyjne, po odpowiedzialność, prawo karne i ochronę danych osobowych. Kurs zdecydowanie praktyczny, dużo przykładów, dużo przypadków z życia wziętych. |
|
||||
| 1000-2M13DZD |
|
n/a |
|
n/a |
Classes
Winter semester 2024/25
Groups
Brief description
The subject consolidates both theoretical and practical knowledge about machine learning and data mining methods in applications related to large, heterogeneous, distributed and dynamically growing data. We discuss problems concerning reliability and quality of data in tasks of teaching effective models for classification, prediction and related applications as well as maintaining the effectiveness of such models applied as components of larger IT systems. We refer to a wide range of practical sources and shapes of data, in particular machine-generated data. We cover a wide range of practical tasks in machine learning and data analysis, e.g. anomaly detection or recognition of similarities. Based on practical examples, we discuss the full life cycle of data and information in processing and analysis systems, including properly integrated solutions based on machine learning and data analysis. |
|
||||
| 1000-2M24PZB | n/a |
|
n/a | n/a |
Classes
Summer semester 2024/25
Groups
Brief description
(in Polish) Przedmiot koncentruje się na aplikacjach technologii blockchainowej z pominięciem teorii, która wymagałaby szczegółowego rozważania założeń i dowodzenia twierdzeń. Wykład jest przede wszystkim przygotowaniem do laboratorium. Laboratorium jest obowiązkowe i przygotowuje do zaliczenia projektu. |
|
||||
| 1000-2M10TKI |
|
n/a |
|
n/a |
Classes
Winter semester 2024/25
Groups
Brief description
Universal algebra and category theory are by now two classical areas of mathematics that offer abstract concepts, methods and results which have been widely adopted in foundations of computer science and by now form the standard language to deal with, among others, modelling, design, and systematic construction of complex software systems. The course recalls basic concepts of universal algebra and introduces the language of category theory, limited to the most elementary and important notions and related results. We hint at least at the possible appliocations of the categorical language in various areas of computer science, for instance in type theory and in foundations of algebraic specifications. The course will consists of lectures and tutorials, in practice without a strict separation between them. It will be offered in English, but it may be carried out in Polish in case only Polish-speaking studants register. |
|
||||
| 1000-2M12TGK | n/a | n/a | n/a |
|
Classes
Summer semester 2025/26
Groups
Brief description
Coalitional Game Theory is an actively expanding subfield of game theory. Coalitional games are used to model all these real-world situations where there exists potential synergy among participating agents. Applications of coalitional game theory span from economics and political sciences to medicine and computer science (electronic commerce, multi-agent systems). |
|
||||
| 1000-2M16KS | n/a | n/a | n/a |
|
Classes
Summer semester 2025/26
Groups
Brief description
Combinatorics of words is a study of properties of words understood as in formal languages. |
|
||||
| 1000-2M24ZAZ | n/a |
|
n/a |
|
Classes
Summer semester 2024/25
Groups
Brief description
Complexity theory classifies problems according to their difficulty and explains why some problems are too hard to be solved by good algorithms. This lecture is a continuation of the “Computational complexity” course. We will discuss classic topics of complexity theory that did not fit into that course. |
|
||||
| 1000-2M00GO |
|
n/a |
|
n/a |
Classes
Winter semester 2024/25
Groups
Brief description
Analysis of selected problems of computational geometry and methods which solve them (sweep line, divide and conquer, prune and search, duality etc.). Theory and applications. |
|
||||
| 1000-2M09OTW | n/a | n/a | n/a |
|
Classes
Summer semester 2025/26
Groups
- (from 2025-10-01) Courses for PhD students in Computer Science
Brief description
Computational social choice theory (ComSoc) is the field at the intersection of computer science, economics and social sciences that studies the aggregation of individual preferences toward a collective choice. For example, a large part of the theory consists in analyzing voting rules (e.g., rules that can be used for electing a president), but the theory also studies rules (protocols/algorihtms) that can be used for making other public decisions: for example, for electing committees, choosing projects for funding in participatory budgeting, maching students to schools based on their preferences, or for allocating items/resources. |
|
||||
| 1000-135GK |
|
n/a |
|
n/a |
Classes
Winter semester 2024/25
Groups
Brief description
Our aim is to introduce the students to basic algorithms and data structures used in computer graphics. These include basic raster graphics algorithms, two- and three-dimensional geometry, elements of computational geometry, geometric modelling, visibility algorithms and illumination models. |
|
||||
| 1000-2M22OW | n/a | n/a | n/a |
|
Classes
Summer semester 2025/26
Groups
- (from 2025-10-01) Courses for PhD students in Computer Science
- (from 2025-10-01) (in Polish) Grupa przedmiotów obieralnych dla informatyki magisterskiej - specjalność Algorytmika
Brief description
This is an introduction to convex optimization, giving an overview of the landscape of convex optimization problems, and covering the most important convex optimization algorithms and lower bounds, as well as convex modelling techniques. The lab sessions cover convex modelling using modern software and implementation of selected convex optimization algorithms. |
|
||||
| 1000-2M24KI2 | n/a |
|
n/a |
|
Classes
Summer semester 2024/25
Groups
Brief description
The course "Cryptography 2" is a follow-up to the course "Cryptography 1" taught in the winter semester. Passing it (or the course "Cryptography" taught by S. Dziembowski in earlier years) is required to attend this course. Compared to "Cryptography 1", this course is more theoretical and focuses on the latest developments in cryptography (often those that have not yet entered practical use) and formal proofs. The main criterion for the selection of topics taught is scientific curiosity. The subject will be mainly conducted using a blackboard (no slides). |
|
||||
| 1000-2M12KI1 |
|
n/a |
|
n/a |
Classes
Winter semester 2024/25
Groups
Brief description
The course provides an introduction to modern cryptography, focusing on the CS foundations of the field. We present the most essential cryptographic techniques used today to secure digital communications. Particular emphasis is placed on formal security analysis and understanding its assumptions. The last few lectures are devoted to an introduction to more advanced aspects of cryptography. These topics will be deepened in the subject "Cryptography 2", to which the subject "Cryptography 1" is an introduction. |
|
||||
| 1000-2M24OC | n/a |
|
n/a |
|
Classes
Summer semester 2024/25
Groups
Brief description
Participants will learn how SOC works, what are its tasks, processes, and component teams. In addition, the relationships between SOC and other departments of the company will be presented. The tools used in SOC, current trends in the organization of work in the field of cybersecurity operations, ways to automate tasks for both the analyst, IR and vulnerability management will be described. The issues of risk management in the field of cybersecurity operations will be presented. in the 2024L cycle, independent classes according to prepared scenarios without a set date |
|
||||
| 1000-2M03DM | n/a |
|
n/a |
|
Classes
Summer semester 2024/25
Groups
Brief description
Presentation of the main issues in the field of data mining and the methods to resolve them. Discussion about the efficient implementation on large collections of data for basic problems, such as associative rules, data preparation, discretization of real value attributes, decision tree. Presentation of modern computation techniques such as parallel processing, evolutionary computation, using standard heuristic databases or specially constructed data structures. |
|
||||
| 1000-2M23ZWL | n/a | n/a | n/a |
|
Classes
Summer semester 2025/26
Groups
- (from 2025-10-01) Courses for PhD students in Computer Science
Brief description
The lecture presents the state-of-the art knowledge concerning the way a dictionary of symbols one can construct statements from (i.e. quantifiers, connectives, relations and function symbols) impacts the complexity of the satisfiability and provability problems. |
|
||||
| 1000-2M20IRIO |
|
n/a |
|
n/a |
Classes
Winter semester 2024/25
Groups
Brief description
The course takes an engineer’s perspective on building the complex set of systems and services that together provide the public cloud. The cloud infrastructure is a complex distributed system with unique requirements: high availability, massive scale and having deep software stacks. We plan to show how these requirements influence the key design decisions (communication, scalability, resource management, data management) and reliability engineering (monitoring, testing). The course will be delivered by Google engineers whose day-to-day work involves designing, building and maintaining cloud infrastructure. In contrast to teaching specific cloud technologies, our goal is to rather show principles driving the design of large-scale distributed systems. We plan to illustrate these principles using specific systems developed by your lecturers. |
|
||||
| 1000-2M17PMF | n/a |
|
n/a |
|
Classes
Summer semester 2024/25
Groups
Brief description
(in Polish) Celem przedmiotu jest zaprezentowanie słuchaczom najważniejszych informacji dotyczących przedsiębiorczości, w szczególności procesu poszukiwania i operacjonalizacji szans rynkowych, tworzenia koncepcji biznesu, zakładania nowych przedsiębiorstw i zarządzania nimi na pierwszych etapach rozwoju. Przedstawiane podczas wykładów zagadnienia zostaną przeanalizowane na przykładach, a następnie praktycznie wykorzystane na ćwiczeniach. |
|
||||
| 1000-2M22ETG | n/a |
|
n/a | n/a |
Classes
Summer semester 2024/25
Groups
- (from 2025-10-01) (in Polish) Grupa przedmiotów obieralnych dla informatyki magisterskiej - specjalność Algorytmika
Brief description
The course gives an introduction to extremal graph theory, a branch of graph theory which studies how global parameters of a graph, such as its edge density or chromatic number, can influence its local substructures (for instance, how many edges can a graph on n vertices have without containing a triangle). After introducing the basic results and tools of the subject, the course will focus on the celebrated Szeméredi regularity lemma and its applications, and in the last part of the lecture we will introduce modern and interesting theory of graph limits. Note: Course is given in English. |
|
||||
