Discrete Mathematics for Precise Computational Methods

How are algorithms structured? Why does encryption work? How do computers make logical decisions?

The Discrete Mathematics course introduces:

• sets, relations, propositions and Boolean algebra;

• combinatorial structures and elementary automata;

• the foundations of logic, coding and digital algorithms.

This is not merely abstract theory: it provides a language for artificial intelligence. The course develops algorithmic thinking and connects mathematical concepts with practical AI and energy applications.