HCMC UNIVERSITY OF FINAL EXAMINATION

TECHNOLOGY AND EDUCATION SEMESTER 2nd – ACADEMIC YEAR 2021-2022

Faculty for High Quality Training
Program name: Computer Engineering
Technology
Course name: Discrete structures
Course ID: DSCC235864E
Exam code: 01 Number of pages: 02
Duration: 75 minutes.
Closed-book.

Question 1: (3/10)
a. Show that (pq)  q and pq are logically equivalent without using truth tables.
b. Show that (pq)  p is a tautology without using truth tables.
c. We define the following predicates:
C(x): x is a car
F(x,y): x is faster than y
B(x): x has brakes
Consider the statement “Any car with brakes is faster than at least one car that
doesn’t have brakes.” Find the accurate translations of this statement by using
propositions and logical connectives.

Question 2: (2/10)
Using the premises:
i. 𝑝 ∨ 𝑞 → ¬𝑟
ii. (𝑝 ∨ 𝑟) ∧ 𝑞
a. Use rules of inference to show that p is true.
b. Redo problem a. but prove it using truth tables.

Question 3: (2/10)
A B
a. Shade the Venn diagram on the right to show
b. Determine whether the posets with these Hasse diagrams shown
below are lattices. C

Question 4: (3/10)
a. Use induction to prove that 4| (2𝑛2 + 6𝑛) for all positive
integer values of n. (Note: a| b notation means “b is divisible by
a”)
b. Give a big-O estimate for the number of comparison
operations used in the segment of an algorithm shown on the
right.

Note: Proctors are not allowed to give any unauthorised explaination.

Document ID: BM1/QT-PĐT-RĐTV-E Page: 1/1

Learning outcome mapping Assessed in
[LO 1.1]: Be able to count various sets of discrete objects using basic Question 1
enumeration techniques
[LO 1.2]: Be able to create formulas enumerating families of objects using set Question 2
theory, recursions, or generating functions
[LO 1.3]: Be able to solve various types of problems on discrete graphs Question 3
[LO 1.4]: Be able to run algorithms for various types of problems on discrete Question 4
graphs
[LO 1.5]: Prove various results in enumeration or graph theory using induction, Question 4
counter-examples, set theoretical, by contradiction, bijection arguments

05/06/2022
Approved by program chair
(signed and named)

PGS.TS. Trương Ngọc Sơn

Document ID: BM1/QT-PĐT-RĐTV-E Page: 1/1

 HCMC UNIVERSITY OF
TECHNOLOGY AND EDUCATION
Faculty for High Quality Training
Program name: Computer Engineering
Technology
FINAL EXAMINATION SOLUTION
SEMESTER 2nd – ACADEMIC YEAR 2021-2022
Course name: Discrete structures
Course ID: DSCC235864E
Exam code: 01 Number of pages: 02
Duration: 75 minutes. Closed-book.

Question 1: (3/10)
a. Show that (pq)  q and pq are logically equivalent without using truth
tables.

b. Show that (pq)  p is a tautology without using truth tables.

c. We define the following predicates:

C(x): x is a car; F(x,y): x is faster than y; B(x): x has brakes
Consider the statement “Any car with brakes is faster than at least one car that
doesn’t have brakes.” Find the accurate translations of this statement by using
propositions and logical connectives.
∀ x ∃ y ( C ( x) ∧ B(x )→ C( y)∧¬ B( y)∧ F (x , y ) )

Question 2: (2/10)
Using the premises:
i. 𝑝 ∨ 𝑞 → ¬𝑟
ii. (𝑝 ∨ 𝑟) ∧ 𝑞
a. Use rules of inference to show that p is true.

Document ID: BM1/QT-PĐT-RĐTV-E Page: 1/1

 b. Redo problem a. but prove it using truth tables.
p q r 𝑝∨𝑞 ¬𝑟 (𝑝 ∨ r) 𝑝 ∨ 𝑞 → ¬𝑟 (𝑝 ∨ 𝑟) ∧ 𝑞
F F F F T F T F
F F T F F T T F
F T F T T F T F
F T T T F T F T
T F F T T T T F
T F T T F T F F
T T F T T T T T
T T T T F T F T

Question 3: (2/10)
a. Shade the Venn diagram on the right to show

b. Determine whether the posets with these Hasse diagrams shown below are lattices.

Question 4: (3/10)
a. Use induction to prove that 4| (2𝑛2 + 6𝑛) for all positive
integer values of n. (Note: a| b notation means “b is divisible by
a”)
Proof: Use induction on n to prove this

Document ID: BM1/QT-PĐT-RĐTV-E Page: 1/1

 b. Give a big-O estimate for the number of comparison operations used in the segment of
an algorithm shown on the right.
2
O(N ) or O(Nlog ( N ) )

Document ID: BM1/QT-PĐT-RĐTV-E Page: 1/1