The aim of the Mathematical modelling course is to build on the basic knowledge and understanding of the concepts of mathematical analysis and linear algebra to advanced concepts, demonstrate their use in modelling in computer science, mathematics and other sciences and develop the basic methods for calculating the resulting models.

To successfully pass this course, the student has to complete 3 homework assignments (deadlines at the ends of months March, April, and May), one group project (in May), and pass a theoretical exam at the end of the semester.

- nosilec: Neža Mramor-Kosta
- nosilec: Žiga Virk
- nosilec: Aljaž Zalar

The goal of the subject Computer

technologies is to introduce to students of computer science and informatics

the physical and technological fundamentals for operating and manufacturing

computers, quantitative treatment of some relevant examples from the area of

solid state physics, as well as the introduction of the application of physics

laws in the technology of fabrication of microelectronic, monolithic circuits

which are basic elements of computers. One of the aims of the subject is also

the introduction of quantum mechanics which becomes increasingly important

physical theory in computer science.

Course practicalities: Lectures and individual reading. Two colloquia (or a written exam), seminar work, oral exam. Lecture notes, exercise book and a list of examination questions are available.

Prerequisites: elementary classical physics, basic linear algebra and calculus.

- nosilec: Rok Žitko

The course covers basic concepts and principles underlying modern programming languages. We focus on understanding from the point of view of a programmer, although due attention is paid also to the theoretical principles that enable design of programming languages.

- Introduction and arithmetical expressions
- A commmand-based programming language
- Proving correctness of programs
- Lambda calculus
- Declarative programming and algebraic datatypes
- Recursive types and recursion
- Polymorphism and type inference
- Abstraction: signatures, modules, and functors
- Logic programming & logic constraint programming
- Records and objects

- nosilec: Andrej Bauer