Discrete MathematicsSillabus

Fənn kodu

IF-17122y-EN

Kredit

5

Tələbənin iş yükü

90

Semestr

Payız semestri

Akademik il

2

Fənnin tipi

Məcburi

Təhsil forması

Əyani

Tədris dili

İngilis

Auditoriyadaxili saatlar

a) 30 hours – lectures; b) 30 hours – seminars

Auditoriyadan kənar saatlar

a) 45 hours – Student Independent Work (SIW); b) 45 hours – Guided Student Independent Work (GSIW)

The course aims to develop students’ theoretical knowledge and analytical skills in the fundamental concepts and methods of discrete mathematics. The course covers mathematical logic and predicate logic, sets and relations, Boolean algebra, fundamentals of combinatorics, and graph theory. The principles of properly formulating mathematical concepts, logically analyzing propositions, and applying various proof techniques are examined. Boolean functions, their decompositions, completeness and closure concepts, multivalued functions, operations on graphs, paths and chains in graphs, connectivity, and other fundamental graph concepts are studied. The application of discrete mathematics methods in computing technologies, automata theory, coding, information transmission and processing, and the development of algorithms and optimal software solutions is considered. Particular attention is given to the application of graph theory in network security and cyber forensics. The course is designed to develop students’ ability to analyze mathematical texts, construct logical arguments, apply theoretical knowledge to practical problems, and model computational and information security problems using discrete structures.

• mühazirə
• seminar
• təqdimatlar

Təlim nəticəsi əlavə edilməyib.

1. 1.
   Elements of Combinatorics. Cartesian Product. Boolean SetsMühazirə

   This topic introduces the fundamental concepts and elements of combinatorics, counting principles for finite sets, and methods for solving combinatorial problems. The concept of the Cartesian product, construction of the Cartesian product of sets, and its fundamental properties are examined. The concept of Boolean sets, their structure, and applications in discrete mathematics are also studied.

2. 2.
   Concept of a Relation. Binary Relation. Equivalence RelationMühazirə

   This topic examines the concept of a relation and the mathematical representation of relationships between elements of sets. The concept of a binary relation, its methods of representation, and fundamental properties are considered. Equivalence relations, their properties of reflexivity, symmetry, and transitivity, as well as the principles of partitioning a set into equivalence classes, are also studied.

3. 3.
   Functions. Composition of Functions. Cardinality of a SetMühazirə

   This topic introduces the concept of a function, including its domain and range. The main types and methods of representing functions, as well as the construction and fundamental properties of function composition, are examined. The concept of the cardinality of a set, methods for determining and comparing the cardinalities of finite and infinite sets, are also studied.

4. 4.
   Basic Logical Operations and Their ApplicationsMühazirə

   This topic examines the fundamental concepts and logical operations of mathematical logic. The meaning, truth tables, and fundamental properties of negation, conjunction, disjunction, implication, and equivalence are studied. The construction and analysis of logical expressions and their applications to solving various practical problems are also considered.

5. 5.
   Concept of a Formula. Dual Function. Principle of DualityMühazirə

   This topic introduces the concept of a logical formula, its structure, and fundamental properties. The concept of a dual function and its relationship with logical functions are examined. The principle of duality, construction of dual forms of logical expressions, and applications of this principle in Boolean algebra are also studied.

6. 6.
   . Identification and Assessment of the Situation in Emergency Situations. 2 (Practical Session)Mühazirə

   Identification and assessment of the engineering situation. Determination of the boundaries of destruction and fire zones. Problem solving.

7. 7.
   Decomposition of Boolean Functions with Respect to Variables. Perfect Normal Forms. Zhegalkin PolynomialMühazirə

   This topic examines methods for decomposing Boolean functions with respect to variables and their fundamental properties. The principles of representing Boolean functions in perfect disjunctive normal form (PDNF) and perfect conjunctive normal form (PCNF) are studied. The concept of the Zhegalkin polynomial, algebraic normal representation of Boolean functions, and methods for constructing Zhegalkin polynomials are also examined.

8. 8.
   Group Theory. Concepts of Ring and FieldMühazirə

   This topic introduces the fundamental concepts of algebraic structures. The concept of a group, fundamental properties of group operations, identity and inverse elements are examined. The concepts of rings and fields, their fundamental properties, and the differences between them are explained. The role of group, ring, and field structures in discrete mathematics and other applied fields is also considered.

9. 9.
   Modular Arithmetic. Residue Class (Zₘ)Mühazirə

   This topic examines the fundamental principles of modular arithmetic and the concept of congruence. Addition, subtraction, multiplication, and exponentiation modulo an integer are considered. The concept of the residue class (Zₘ), the structure of residue classes, and the principles of performing algebraic operations on them are also studied.

10. 10.
    Certain Arithmetic Functions.Mühazirə

    This topic examines fundamental arithmetic functions used in number theory and their properties. Euler’s totient function and fundamental concepts related to modular arithmetic are considered.

11. 11.
    Finite Cyclic Groups. Primitive Elements. Discrete Logarithm ProblemMühazirə

    This topic examines finite cyclic groups, their structure, and fundamental properties. The order of a group, order of an element, and the concept of a generator are considered. The concept of primitive elements and their role in finite cyclic groups are explained. The mathematical nature of the discrete logarithm problem, its computational complexity, and its role in the security of cryptographic systems are also studied.

12. 12.
    Finite Fields. Prime and Extension Finite FieldsMühazirə

    This topic examines the concept of a finite field, its structure, and fundamental properties. The construction of prime finite fields and the principles of performing basic algebraic operations on their elements are considered. The structure of extension finite fields, their relationship with prime finite fields, and their fundamental properties are explained. Applications of finite fields in coding, cryptography, and other computational fields are also examined.

13. 13.
    Construction of Finite Fields.Mühazirə

    This topic examines the principles of constructing finite fields and their applications in cryptography. The structure of prime and extension finite fields, the construction of extension fields using irreducible polynomials, and algebraic operations on field elements are considered.

14. 14.
    Primitive PolynomialsMühazirə

    This topic introduces the concept of primitive polynomials, their relationship with finite fields, and their fundamental properties. The differences between irreducible and primitive polynomials, principles for identifying primitive polynomials, and their role in the construction of finite fields are considered. Applications of primitive polynomials in generating pseudorandom sequences, coding, and cryptographic systems are also studied.

15. 15.
    Elements of Graph Theory. Dijkstra’s AlgorithmMühazirə

    This topic examines the fundamental concepts and elements of graph theory. The concepts of graphs, vertices, edges, directed and undirected graphs, weighted and unweighted graphs, as well as paths and connectivity in graphs, are considered. The operating principle of Dijkstra’s algorithm and its application to finding the shortest paths from a given source vertex to other vertices in weighted graphs are explained. The main stages of the algorithm and its conditions of application are also examined.

1. R. N. Mammadov, Higher Mathematics Course I, Maarif, 1999.
2. A. B. Aliyev, A. Huseynov, Mathematics, Baku, 2005.
3. M. Shahverdiyev, E. Mammadhasanov, N. Sharifov, Mathematics, Baku, 2015.