Elective courses for Computer Science
- (in Polish) Introduction to topological data analysis 1000-1M24TDA
- (in Polish) Data engineering 1000-2M23DE
- (in Polish) Tworzenie aplikacji z gwiazdką 1000-2M23TAG
- (in Polish) Zaawansowane programowanie sieciowe 1000-2M24ZPS
- (in Polish) Warsaw Mimotaurs II 1000-WMTAU2
- Set theory, independence proofs and the continuum hypothesis 1000-2M23STI
- Advanced aspects of computational complexity 1000-2M24ZAZ
- Advanced databases 1000-2N09ZBD
- Advanced functional programming 1000-2M11ZPF
- Advanced Java 1000-2M22ZJ
- Advanced topics in operating systems 1000-2N09ZSO
- Algorithmic aspects of game theory 1000-2M02AA
- Algorithmic Economics 1000-2M23ALE
- Algorithmic Model Theory 1000-2M24ATM
- Algorithmics 1000-2N00ALG
- Algorithms for genomic data analysis 1000-718ADG
- Artificial intelligence and expert systems 1000-2N00SID
- Auction theory 1000-2M13TAU
- Basic legal issues useful in programmer's life 1000-2M05ZP
- Big data mining and processing 1000-2M13DZD
- Big data processing and cluster computing 1000-218bPDD
- Blockchain programming 1000-2M24PZB
- Category theory in foundations of computer science 1000-2M10TKI
- Cloud technologies 1000-2M19TCH
- Combinatorics on words 1000-2M16KS
- Comparative genomics 1000-719GP2
- Computational geometry 1000-2M00GO
- Computer graphics 1000-135GK
- Convex optimization 1000-2M22OW
- Cryptography 2 1000-2M24KI2
- Cryptography I 1000-2M12KI1
- Cybersecurity Operations 1000-2M24OC
- Data mining 1000-2M03DM
- Deciding logical properties of statements and its complexity 1000-2M23ZWL
- Deep learning in life science 1000-2M23DLS
- Deep neural networks 1000-317bDNN
- Distributed systems 1000-217bSR
- Engineering Distributed Infrastructure 1000-2M20IRIO
- Entrepreneurship in a small company 1000-2M17PMF
- Explainable machine learning 1000-319bEML
- Extremal graph theory 1000-2M22ETG
- FinTech – financial technology 1000-2M17FT
- Functional programming 1000-2M24PFU
- Game-theoretic approach to social network analysis 1000-2M14TGS
- High performance computing 1000-218bHPC
- Implementation theory 1000-2M16TIM
- Infinite alphabets 1000-2M16AN
- Infinite automata 1000-2M22AN
- Information theory 1000-2N03TI
- Interdisciplinary team project 1000-720IPZ
- Introduction to computational biology 1000-2N03BO
- Introduction to Cybersecurity and Cryptography 1000-2M24WCK
- Introduction to data compression 1000-2N09KDW
- Introduction to electronic commerce 1000-2M09OTA
- Introduction to Zero Knowledge 1000-2M23IZK
- Lambda calculus 1000-2M02RL
- Languages, automata and computations II 1000-2M15ZTA
- Large-scale machine learning 1000-319bBML
- Lectures in modern computer science 1000-2M11WWI
- Logic and type theory 1000-2M13LTT
- Logic programming 1000-2N00PLO
- Logic programming and Prolog 1000-2M10PLO
- Machine learning 1000-2N09SUS
- Managing software projects 1000-2M08ZPI
- Microcontrollers programming 1000-2M08PMK
- Multiagent systems 1000-2M00SW
- Natural language processing 1000-318bNLP
- Network programming in functional languages 1000-2M24FPS
- Numerical methods 1000-2M24MNU
- Parameterized algorithms 1000-2M12APW
- Petri nets 1000-2M01SP
- Practical distributed systems 1000-2M21PRS
- Program Semantics and Verification 1000-2M24SWP
- Quantum Information 1000-2M22IKW
- Randomization in algorithms and computational geometry 1000-2M20RGO
- Reasoning in software systems 1000-2N09WSS
- Reasoning tools and methods 1000-2M16NMW
- Red-teaming, safety and explainability for artificial intelligence systems 1000-2M24RTS
- Reinforcement learning 1000-318bRL
- Robot control 1000-317bRC
- Selected problems in discrete mathematics 1000-2M07MD
- Selected Topics in Computational Geometry and Topology 1000-2M21GOT
- Selected topics in graph theory 1000-2M12WTG
- Shortest paths algorithms 1000-2M24ANS
- Sparsity 1000-2M12GRZ
- Statistical data analysis 2 1000-718SAD
- Text algorithms 1000-2N09ALT
- Theory of concurrency 1000-218bTW
- Transducers 1000-2M23PA
- Visual geometry 1000-2M09GOB
- Visual recognition 1000-318bVR