DISCRETE MATHEMATICS FINAL EXAM

Name Surname: Faculty Number:

1. The relation 𝑅 defined on integers is Solution:

(0,0) ∉ 𝑅, it is not reflexive.
If 𝑥. 𝑦 ≥ 2 then (𝑥, 𝑦) ∈ 𝑅. If 𝑥. 𝑦 ≥ 2 then 𝑦. 𝑥 ≥ 2. It is symmetric.
●Reflexive, ●Symmetric, ●Antisymmetric, ●Transitive, ●Partial (2,1) ∈ 𝑅, (1,2) ∈ 𝑅 and 1 ≠ 2, not antisymmetric.
Order Relation, ●Equivalence Relation 𝑥. 𝑧 ≥ 2, while 𝑥. 𝑦 ≥ 2, 𝑦. 𝑧 ≥ 2, it is transitive.
Not reflexive then not partial order relation.
How many of the above properties holds for R? Not reflexive then not equivalence relation.
Answer: 2
2. The following digraph belongs to a relation R defined on Solution:
{1,2,3,4,5}.
●Reflexive, ●Symmetric, (1,1) ∉ 𝑅, it is not reflexive.
●Antisymmetric, (1,3) ∈ 𝑅, (3,1) ∉ 𝑅 It is not symmetric.
●Transitive, ●Partial At most one directed edge, it is antisymmetric.
Order Relation, (1,3) ∈ 𝑅, (3,5) ∈ 𝑅, (1,5) ∉ 𝑅, Not transitive.
●Equivalence Relation Not reflexive then not partial order relation.
Not reflexive then not equivalence relation.
How many of the above properties holds for R?
Answer: 1

3. The relation 𝑅 defined on integers is Solution:

3 divides 𝑘 + 2𝑘. (𝑘, 𝑘) ∈ 𝑅, 𝑅 is Reflexive.
𝑅 = {(𝑥, 𝑦): 3 divides 𝑥 + 2𝑦}. 𝑥 + 2𝑦 = 3𝑘 ⟹ 𝑦 + 3𝑥 = 3𝑚. 𝑅 is symmetric.
Which of the following is FALSE about 𝑅. (2,8) ∈ 𝑅, (8,2) ∈ 𝑅, 2 ≠ 8. 𝑅 is not antisymmetric
If 3 divides 𝑥 + 2𝑦 and 𝑦 + 2𝑧 then 3 divides
𝑥 + 2𝑧. 𝑅 is Transitive
Answer: “𝑅 is Antisymmetric” is FALSE.

4. If Solution:
𝑝⇔𝑞≡𝑇
¬𝑝 ⟹ 𝑟 ≡ 𝐹 𝑝 ≡ 𝐹, 𝑟 ≡ 𝐹, 𝑞 ≡ 𝐹
then which of the following is FALSE?
¬𝑞 ⟺ 𝑟: 𝑇 ⟺ 𝐹 ≡ 𝐹

5. Which of the following is equivalent to Solution: (𝑇 ∧ 𝑝) ∧ (𝐹 ∧ 𝑝) ∨ (¬𝑝 ∨ 𝐹)

(𝑝) ∧ (𝐹) ∨ (¬𝑝 )
(𝑇 ∧ 𝑝) ∧ (𝐹 ∧ 𝑝) ∨ (¬𝑝 ∨ 𝐹).
(𝑝 ∧ 𝐹) ∨ (¬𝑝 )
(𝐹) ∨ (¬𝑝 )
¬𝑝

6. Which of the following is true for the sequence Solution:

𝑎𝑛 = −3𝑎𝑛−1 + 4𝑎𝑛−2
𝑎𝑛 = 2(−4)𝑛 + 3.
7.
What is the output of the
algorithm?

Solution:

Returns the number of terms that are greater than

the previous term.

8. When three friends are seated in a restaurant, the hostess asks Solution:
them: “Does everyone want coffee?” Ali says: “I do not know.”
Berk then says: “I do not know.” Finally, Cenk says: “No, not If Ali did not want coffee, then he would know that
everyone wants coffee.” The hostess comes back and gives coffee the answer to the hostess’s question was “no.”
to the friends who want it. Accordingly, who wants coffee? Therefore the hostess and the remaining friends
know that Ali did want coffee. Similarly, the Berk
must want coffee. When Cenk said “no,” the
hostess knows that Cenk does not want coffee.

9. Solution:
 There are parallel edges in G.
 G is a simple Graph  There are parallel edges for {𝑓, ℎ}(T)
 There are loops in G.  G is not a simple Graph(F)
 G is a weighted graph.  There are no loops in G.(F)
 G is a complete graph.  G is not a weighted graph. (F)
 G is a bipartite graph.  G is not a complete graph. (F)
 G is not a bipartite graph. (F)

How many of the above propositions are TRUE for G? Answer: 1

10. In which of the following arguments can the result be obtained Solution:
by using the “Addition” rule?
Alice is a mathematics major. Therefore, Alice is
either a mathematics major or a computer science
major.

11. In the following combinatorial circuit, find the Boolean Solution:

expressions for the output.
12. Solution:

not a simple path, a cycle, not a simple cycle

Determine whether the path (v2, v3, v4, v2, v6, v1, v2) is a simple
path, a cycle, a simple cycle.

13. How many of the following quantified statements are TRUE, Solution:
if the domain for all variables consists of all integers.?
∎ ∀𝑛 ∃𝑚 (𝑛2 < 𝑚) ∎ ∃𝑛 ∀𝑚 (𝑛 < 𝑚2 ) ∎ ∀𝑛 ∃𝑚 (𝑛2 < 𝑚) True
∎ ∃𝑛 ∀𝑚 (𝑛 < 𝑚2 ) True
∎ ∀𝑛 ∃𝑚 (𝑛 + 𝑚 = 0) ∎ ∃𝑛 ∀𝑚 (𝑛𝑚 = 𝑚)
∎ ∀𝑛 ∃𝑚 (𝑛 + 𝑚 = 0) True
∎ ∃𝑛 ∃𝑚 (𝑛2 + 𝑚2 = 5) ∎ ∃𝑛 ∀𝑚 (𝑛𝑚 = 𝑚) True
∎ ∃𝑛 ∃𝑚 (𝑛2 + 𝑚2 = 5) True
Answer: 5
14. If possible find an Euler cycle for the vertex 𝑎.

Solution:

𝑎, 𝑏, 𝑐, 𝑑, 𝑐, 𝑒, 𝑑, 𝑏, 𝑒, 𝑎, 𝑒, 𝑎

15.

Solution:

 (𝑎, 𝑏, 𝑐, 𝑑, 𝑒, 𝑓) = 8
 (𝑏, 𝑔, 𝑘, 𝑚) = 7
 (𝑖, 𝑘, 𝑚, 𝑒) = 7
How many of the following propositions are TRUE?  (𝑎, 𝑏, 𝑔, 𝑘, 𝑚) = 8
 The shortest path between 𝑎 and 𝑓 is 9.  (ℎ, 𝑖, 𝑘, 𝑚, 𝑒) = 9
 The shortest path between 𝑏 and 𝑚 is 7.
Answer: 3
 The shortest path between 𝑖 and e is 6.
 The shortest path between 𝑎 and 𝑚 is 8.
 The shortest path between ℎ and e is 9.
16. How many of the following propositions are TRUE for Solution:
the graph given in Question 15.  The graph contains a Hamiltonian Cycle.
 The graph contains a Hamiltonian Cycle.  The graph does not contain a Euler Cycle
 The graph contains a Euler Cycle. since 𝛿(𝑚) = 3.
 The graph is a bipartite Graph.  The graph is not a bipartite Graph.
 The graph is a complete Graph.  The graph is not a complete Graph.
 The graph is a simple Graph.
 The graph is a simple Graph.
Answer: 2

17. Considering the following propositions Solution:

a) 𝑝 b) 𝑠 → 𝑟 c) ¬𝑞 d) 𝑠 ∨ ¬𝑝  Apply Disjunctive Syllogism to d) and a)
i. Apply Disjunctive Syllogism to d) and a) 𝑠
ii. Apply Modus Ponens to b) and result of i.  Apply Modus Ponens to b) and previous result
iii. Apply Conjuction to c) and result of ii. 𝑟

What is the answer? iv. Apply Conjuction to c) and previous result

¬𝑞 ∧ 𝑟

18.
 A -------- consists of axioms, definitions, and undefined terms. Solution:
 A ------- is a proposition that is assumed to be true.
 A -------- creates a new concept in terms of existing ones. Lemma is not defined.
 A ------- is an argument that establishes the truth of a theorem..
 A ------- is a proposition that has been proved to be true.
Which of the following is not defined above?

19. for i = 1 to n Solution:

if ( func_𝑗(𝑖)) This pseudocode
return true determines which of ∃𝑥 ∀𝑦 ¬𝑃(𝑥, 𝑦)
return false the given quantified
func_𝑗(𝑖){ statement is true or
for j = 1 to n false?
if (𝑃(𝑑𝑖, 𝑑𝑗))
return false
return true
}

20. How many of the 6-bit sequences contain at most 2 zeros? Solution:
6! 6! 6!
+ + = 1 + 6 + 15 = 22
0! .6! 1! .5! 2! .4!