From:

YAI
Discrete Mathematics
Final
Past Exams
Exams Page
1 January 2019 2
2 May 2019 7
3

4
5

6
7

YAI
Wish you all the Best
Inspire
 January 11, 2019

IŞIK UNIVERSITY, MATH 142 FINAL EXAM

Duration: 1 hr. 30 min. Q1 Q2 Q3 Q4 Q5 Q6 Total:
Last Name: First Name: Student ID:
I pledge my honor that I have not violated the
Signature:
honor code during this examination.

Q1. (a) (10 pts) Let A, B and C be sets.

Prove that if, for all x, x ∈ A → (x ∈ B → x ∈ C), then A ∩ B ⊆ C. (Hint: Use
logical equivalences)

√
(b) (10 pts) Prove that if n = ab, where a and b are positive integers, then a ≤ n
√
or b ≤ n.

YAI
Q2. Let R be the relation on the set of ordered pairs of positive integers such that
 
(a, b), (c, d) ∈ R if and only if a + d = b + c.

(a) (15 pts) Show that R is an equivalence relation.

(b) (10 pts) What is the equivalence class of (1, 2) with respect to equivalence
relation R? (Hint: Write three or more members of the equivalence class of (1, 2)
and then determine the common property that each member have)

YAI
Q3. . Let R be the relation on the set {1, 2, 3, 4} represented by the matrix
 

1 0 1 1 
 
 1 1 1 1 
 
 
 0 0 1 0 


 
0 0 1 1

(a) (10 pts) Find the matrix representing

i. R ii. R ◦ R

(b) (8 pts) Determine whether the relation R is reflexive, symmetric, antisymettric

and/ or transitive. (Give your reasons)

YAI
Q4. (a) (8 pts) Is it possible to draw a graph with 6 vertices having degrees 2,2,3,3,3
and 4? If your answer is yes, then draw such a graph, otherwise give reasons
why your answer is no.

(b) (6 pts) Show that the graph G given below is bipartite.

(c) (6 pts) Which of these graphs are trees? Explain your reasons at the below of
each graph.

i. ii. iii.

YAI
 n(n − 1)
Q5. (10 pts) Use mathematical induction to show that a complete graph Kn has
2
edges for n ≥ 1.

Q6. (7 pts) Let {an } be a sequence satisfying recurrence relation an = 2nan−1 , n ≥ 1

and a0 = 1. Find an explicit formula (closed formula) for an .

YAI
 May 27, 2019

IŞIK UNIVERSITY, MATH 142 FINAL EXAM

Duration: 105 min. Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Total:
Last Name: First Name: Student ID:
I pledge my honor that I have not violated the
Signature:
honor code during this examination.

Q1. Let R and S be relations on the set {1, 2, 3, 4} represented by following directed graphs:

(a) (8 pts) Find the matrix representation of R, S, R ∩ S and R ∪ S.

(Note: In matrix representation, use the members of {1, 2, 3, 4} with an increasing order as it
is given)

(b) (8 pts) Find the elements of the relation S ◦ R.

YAI
Q2. Let R be the relation on the set of natural numbers defined as follows:

R = {(x, y) | x2 − y 2 is divisible by 3}

(a) (10 pts) Show that R is an equivalence relation.

(b) (8 pts) List eight elements in the equivalence classes [0]R and [1]R .

(c) (4 pts) Are there any more equivalence classes? Explain your reasons.

YAI
Q3. (10 pts) Prove or disprove that “if x and y are real numbers such that x + y ≥ 100,
then x ≥ 50 or y ≥ 50.”

Q4. (10 pts) Prove or disprove that “if R and S are transitive relations, then the relation R ∪ S is
transitive.”

YAI
Q5. (a) (10 pts) A graph with 21 edges has seven vertices of degree 1, three of degree 2, seven of
degree 3 and the rest of degree 4. How many vertices does it have?

(b) (8 pts) What is the maximum number of leaves that 5-ary tree with height 4 can have?

Q6. (10 pts) For which values of m and n, a complete bipartite graph Km,n is a tree?

YAI
Q7. Seven women and nine men are on the faculty in the mathematics department at a school.

(a) (7 pts) How many ways are there to select a committee of five members of the department
if at least one woman must be on the committee?

(b) (7 pts) How many ways are there to select a committee of five members of the department
if at least one woman and at least one man must be on the committee?

YAI
Q8. (Bonus Question) (10 pts) Show that in a simple graph with at least two vertices there must
be two vertices that have the same degree. (Hint: Apply Pigeonhole Principle)

YAI