Mathematical Optimisation
This course explores topics closely related to one or more goals of the United Nations 2030 Agenda for Sustainable Development (SDGs). Subjects: The scope of integer and combinatorial optimization, Linear programming, Network flow problems, Integer Programming, Combinatorial optimization, Heuristic algorithms, Relaxation techniques, Dynamic programming, Introducing python and Gurobi for optimisation. Goals: capability of formulating a […]
Databases 1
Databases 1 introduces students to the fundamental principles of designing, creating, and managing relational databases. Students will acquire the knowledge and skills necessary for effectively storing, retrieving, and manipulating data using SQL, and will learn to design data structures in accordance with normalization principles.
Mathematics 2
The aim of this module is to deepen and broaden the knowledge of mathematics. The course will cover the following topics: Integral calculus of functions of one variable, Continuity of functions of several variables, Differential calculus of functions of several variables, Integral calculus of functions of several variables, Elements of algebra, including matrix calculus and […]
Coding Theory
Contents: – basic concepts in coding theory – algebraic methods for the construction of error correcting codes – Hamming codes – Linear codes – Binary Golay codes – Cyclic codes Prerequisits: mathematical background (groups, vector spaces, finite fields)
Data Programing
The rigorous “Data Programming” course teaches students how to use the tidyverse approach to efficiently analyze data using the R programming language. This method is renowned for being effective in the manipulation and analysis of data. Students will gain proficiency with the tidyverse package suite during the course, with an emphasis on modeling, data manipulation, […]
Algebraic Graph Theory
Main part of the course is the study of symmetries of graphs, and in particular graph families having high degree of symmetry such as vertex-transitive graphs, edge-transitive graphs, arc-transitive graphs and Cayley graphs. The method for counting the number of non-isomorphic graphs with a given number of vertices will be explained. Four standard graph products […]
