MINISTRY OF SCIENCE AND HIGHER EDUCATION OF THE REPUBLIC OF

KAZAKHSTAN
INTERNATIONAL UNIVERSITY OF INFORMATIONAL TECHNOLOGIES
Department of Mathematical and computer modeling
Discipline: Discrete mathematics
for group of educational programs: IT-2204, 2205,2206
Option 1
Task 1. [40p] Functions. One-to one and onto functions. Give examples.
Task 2. [30p] Task 1For a graph represented by the following incidence matrix, determine the
adjacency matrix and dwaw the graph of it

less than 20} and C={z| z is positive integer numbers less than 15 divisible by 3}.Find (A ⊕ B)
Task 3. [30p] Let A={x| x is positive numbers no more than 10} and B={y| y is prime numbers

⋂ C.

Head of MCM Department Ydyrys A. Zh.

Compiled by Asubai A.O.
Protocol №3 from November 9, 2023.
 MINISTRY OF SCIENCE AND HIGHER EDUCATION OF THE REPUBLIC OF
KAZAKHSTAN
INTERNATIONAL UNIVERSITY OF INFORMATIONAL TECHNOLOGIES
Department of Mathematical and computer modeling
Discipline: Discrete mathematics
for group of educational programs: IT-2204, 2205,2206
Option 2
Task 1. [40p] Logical operations, Boolean functions, Zhegalkin polynomials.
Tuples, binary relations, set mappings.
Task 2. [30p] For a graph represented by the following incidence matrix, determine the
adjacency matrix and dwaw the graph of it

Task 3. [30p] Rewrite the statement so that negations appear only within predicates (that is, so
that no negation is outside a quantifier or an expression involving logical connectives).
¬[∀x(∃z∀yP(x,y,z)∧∃z∀yP(x,y,z))∧(∃x∃y¬(Q(x,y) ↔ Q(y,x)))]

Head of MCM Department Ydyrys A. Zh.

Compiled by Asubai A.O.
Protocol №3 from November 9, 2023.
 MINISTRY OF SCIENCE AND HIGHER EDUCATION OF THE REPUBLIC OF
KAZAKHSTAN
INTERNATIONAL UNIVERSITY OF INFORMATIONAL TECHNOLOGIES
Department of Mathematical and computer modeling
Discipline: Discrete mathematics
for group of educational programs: IT-2204, 2205,2206
Option 3
Task 1. [40p] Elements of combinatorial analysis. Combinations with repetitions.
Combinatorial formulas.
Task 2. [30p] For a graph represented by the following incidence matrix, determine the
adjacency matrix and dwaw the graph of it

Task 3. [30p] Find the values of the Boolean function represented by F (x, y) = x → y ∨ ¬ (x
∧ y)

Head of MCM Department Ydyrys A. Zh.

Compiled by Asubai A.O.
Protocol №3 from November 9, 2023.
 MINISTRY OF SCIENCE AND HIGHER EDUCATION OF THE REPUBLIC OF
KAZAKHSTAN
INTERNATIONAL UNIVERSITY OF INFORMATIONAL TECHNOLOGIES
Department of Mathematical and computer modeling
Discipline: Discrete mathematics
for group of educational programs: IT-2204, 2205,2206
Option 4
Task 1. [40p] Sets, operations on sets, methods of defining sets.
Task 2. [30p] For a graph represented by the following incidence matrix, determine the
adjacency matrix and dwaw the graph of it

Task 3. [30p] Rewrite the statement so that negations appear only within predicates (that is, so
that no negation is outside a quantifier or an expression involving logical connectives).
¬[∃x(∀z∀yP(x,y,z)→∃z∀yP(x,y,z))↔(∀x∃y(Q(x,y) → Q(y,x)))]

Head of MCM Department Ydyrys A. Zh.

Compiled by Asubai A.O.
Protocol №3 from November 9, 2023.
MINISTRY OF SCIENCE AND HIGHER EDUCATION OF THE REPUBLIC OF
KAZAKHSTAN
 INTERNATIONAL UNIVERSITY OF INFORMATIONAL TECHNOLOGIES
Department of Mathematical and computer modeling
Discipline: Discrete mathematics
for group of educational programs: IT-2204, 2205,2206
Option 5
Task 1. [40p] Graphs. Representing graphs. Give examples.
Task 2. [30p] Rewrite the statement so that negations appear only within predicates (that is, so
that no negation is outside a quantifier or an expression involving logical connectives).
¬[∀x(∃z∀yP(x,y,z)∧∃z∀yP(x,y,z))→(∃x∃y¬(Q(x,y) ↔ Q(y,x)))]
Task 3.[30p] Find the values of the Boolean function represented by F (x, y, z) = x ↔ y ∨ ¬x ∧
y

Head of MCM Department Ydyrys A. Zh.

Compiled by Asubai A.O.
Protocol №3 from November 9, 2023.
MINISTRY OF SCIENCE AND HIGHER EDUCATION OF THE REPUBLIC OF
KAZAKHSTAN
INTERNATIONAL UNIVERSITY OF INFORMATIONAL TECHNOLOGIES
 Department of Mathematical and computer modeling
Discipline: Discrete mathematics
for group of educational programs: IT-2204, 2205,2206
Option 6
Task 1. [40p] Basic counting principles. The inclusion-exclusion principle. The Pigeonhole
Principle.
Task 2. [30p] Let the graphs G1(X, E) and G2(Y, E) shown in the figure below. Determine
whether the given graphs are isomorphic.

than 10 and less than 20} and D={ t| t is numbers that are multiples of 3 less than 20}.Find (A ⋂
Task 3. [30p] Let A={x| x is even numbers no more than 15} and B={y| y is odd numbers more

B) ⊕ D.

Head of MCM Department Ydyrys A. Zh.

Compiled by Asubai A.O.
Protocol №3 from November 9, 2023.
MINISTRY OF SCIENCE AND HIGHER EDUCATION OF THE REPUBLIC OF
KAZAKHSTAN
INTERNATIONAL UNIVERSITY OF INFORMATIONAL TECHNOLOGIES
Department of Mathematical and computer modeling
Discipline: Discrete mathematics
 for group of educational programs: IT-2204, 2205,2206
Option 7
Task 1. [40p] Sets, operations on sets, methods of defining sets.
Task 2. [30p] Find the values of the Boolean function represented by F (x, y, z) = ¬(¬y ∨ x ∧
y)
Task 3. [30p] Given a graph G(V, E), where V = {v1,v2,v3,v4,v5}; E(v1) = {v1,v3,v5}; E(v2) = ∅;
E(v3) = {v1,v2,v5}; E(v4) = {v1}; E(v5) = {v1,v2,v3,v4,v5}.
a. Construct a digraph (orgraph) of G(V,E)
b. Construct an adjacency matrix.
c. Define a graph using a binary relation.

Head of MCM Department Ydyrys A. Zh.

Compiled by Asubai A.O.
Protocol №3 from November 9, 2023.
MINISTRY OF SCIENCE AND HIGHER EDUCATION OF THE REPUBLIC OF
KAZAKHSTAN
INTERNATIONAL UNIVERSITY OF INFORMATIONAL TECHNOLOGIES
Department of Mathematical and computer modeling
Discipline: Discrete mathematics
 for group of educational programs: IT-2204, 2205,2206
Option 8
Task 1. [40p] Basic counting principles. The inclusion-exclusion principle. The Pigeonhole
Principle. Give examples.
Task 2. [30p] The orgraph G(V, E) is given, with vertices V ={A, B, C, D, F, H} and edges E
(A)= (B, H), E (B) = (C, D, H) E(C) = (F, A), E(D)=(H), E(F)=(F, A, D), E(H)=(B). Construct
the incidence matrix and draw its graph.

than 10 and less than 20} and D={ t| t is numbers that are multiples of 3 less than 20}.Find (A ⋂
Task 3. [30p] Let A={x| x is even numbers no more than 15} and B={y| y is odd numbers more

B) ⊕ D.

Head of MCM Department Ydyrys A. Zh.

Compiled by Asubai A.O.
Protocol №3 from November 9, 2023.
MINISTRY OF SCIENCE AND HIGHER EDUCATION OF THE REPUBLIC OF
KAZAKHSTAN
INTERNATIONAL UNIVERSITY OF INFORMATIONAL TECHNOLOGIES
Department of Mathematical and computer modeling
Discipline: Discrete mathematics
for group of educational programs: IT-2204, 2205,2206
 Option 9
Task 1. [40p] Elements of combinatorial analysis. Combinations with repetitions.
Task 2. [30p] Rewrite the statement so that negations appear only within predicates (that is, so
that no negation is outside a quantifier or an expression involving logical connectives).
¬[∀x (∀yP(x,y) ∧ ∃yG(x,y)) ∧ (∃x∃y¬(Q(x,y) ↔ Q(y,x)))]
Task 3. [30p] Find the values of the Boolean function represented by F (x, y, z) = x ↔ y ∨ ¬x ∧
y

Head of MCM Department Ydyrys A. Zh.

Compiled by Asubai A.O.
Protocol №3 from November 9, 2023.
MINISTRY OF SCIENCE AND HIGHER EDUCATION OF THE REPUBLIC OF
KAZAKHSTAN
INTERNATIONAL UNIVERSITY OF INFORMATIONAL TECHNOLOGIES
Department of Mathematical and computer modeling
Discipline: Discrete mathematics
for group of educational programs: IT-2204, 2205,2206
 Option 10
Task 1. [40p] Graph theory. Vertices, routes, chains, cycles.
Task 2. [30p] Task 3. [20p] Let A={x| x is positive numbers no more than 10} and B={y| y is

3}.Find (A ⊕ B) ⋂ C.
prime numbers less than 20} and C={z| z is positive integer numbers less than 15 divisible by

Task 3. [30p] Rewrite the statement so that negations appear only within predicates (that is, so
that no negation is outside a quantifier or an expression involving logical connectives).
¬[∃x(∀z∀yP(x,y,z)→∃z∀yP(x,y,z))↔(∀x∃y(Q(x,y) → Q(y,x)))]

Head of MCM Department Ydyrys A. Zh.

Compiled by Asubai A.O.
Protocol №3 from November 9, 2023.