HCMUT, VNU-HCM

MIDTERM EXAMINATION
Faculty of CSE
Course: Discrete structures for
Computing (CO1007)
Class: 2018-1-CO1007 Group: CC01
Duration: 60 minutes (Closed-book test)
Examination date: March 27, 2018

Student name:

Score: Student ID:

Examiner: Examiner’s signature:

(There are 20 multiple-choice questions, each question is worth 0.5 point. Highlight the correct (best)
answer: . Cancel out to deselect: @ or clear the highlight)

Question 1.
How many bit strings of
length 9 such that next toevery bit 0 is always a bit
1?
A 110. B 55. C 128. D 256.

Question 2. The power sets of (A × B) ∪ (B × A) and (A × B) ∪ (A × B) have the same number of elements
if and only if 
A A = ∅ or B = ∅ or A = B. B A = ∅ or B = ∅ or A ∩ B = ∅.
 
C A ∩ B = ∅. D A ∪ B = ∅.

Question 3. From a deck of cards we take 12 cards.

• Hearts 1, 2 and 3

• Clubs 1, 2, 3 and 4

• Diamond 1, 2, 3, 4 and 5

Take 5 cards (from 12 cards) such that there is at least one card of each type. In how many
ways is that possible? The
 order of these five cards
is irrelevant. 
A 590 B 690 C 790 D 490

Question 4. Let R be the relation on the set of people consisting of pairs (a, b) where “a is a parent of b”.
Let S be the relation on the set of people consisting of pairs (a, b) where “a and b are siblings
(brother or sisters).” What are S ◦ R and R ◦ S?
A S ◦ R = {(a, b)|a is a parent of b}; R ◦ S = {(a, b)|a is an aunt or uncle of b}

B S ◦ R = {(a, b)|a is an uncle or aunt of b}; R ◦ S = {(a, b)|a is a parent of b and b has a sibling }

C S ◦ R = {(a, b)|a is a parent of b and b has a sibling }; R ◦ S = {(a, b)|a is an aunt or uncle of b}

D All of the above statements are incorrect

Question 5. Let P (x, y) denote “x is a factor of y” where x ∈ {1, 2, 3, . . .} and y ∈ {2, 3, 4, . . .}. Let Q(y)
denote “∀x[P (x, y) → ((x = y) ∨ (x = 1))]”. When is Q(y) true?
A Q(y) always false. B Q(y) is an integer number.
 
C Q(y) is a prime number. D Q(y) is a positive number.

Student’s signature:. . . . . . . . . . . . . . . Code 2731 Page 1

 Question 6. Given

• S(x, y): x is older sister of y

• B(x, y): x is brother of y

• H(x, y): x is husband of y

• a: Alice

• b: Bob

Which of the following is represented for “Bob is brother in law of Alice”?


A ∀x((S(x, a) ∧ H(b, x)) ∨ (H(x, a) ∧ B(b, x))).

B ∀x((S(x, a) ∨ H(b, x)) ∧ (H(x, a) ∨ B(b, x))).

C ∃x((S(x, a) ∨ H(b, x)) ∧ (H(x, a) ∨ B(b, x))).

D ∃x((S(x, a) ∧ H(b, x)) ∨ (H(x, a) ∧ B(b, x))).

Question 7. How many terms in the sequence 56 , 32 , 12 , · · · must be added in order to get − 121 ?
   2
A 31. B 32. C 33. D 34.




Question 8. The assertion: “two statements ∃x ∈ Z (x < 0)∧(x > 0) and ∃x ∈ Z(x < 0) ∧ ∃x ∈ Z(x > 0)
have the same truth value” is
  
A false. B true. C not able to conclude.

Question 9. Let f : X → Y be a function, and let {Si : i ∈ I} be a family subsets of X. Which of the
following is incorrect?
 S S
A f ( i∈I Si ) = i∈I f (Si )

B When f is a bijection function: f −1 (S1 ∪ S2 ) = f −1 (S1 ) ∪ f −1 (S2 )
 
C f (S1 ∩ S2 ) ⊆ f (S1 ) ∩ f (S2 ) D f (S1 ) ∩ f (S2 ) ⊂ f (S1 ∩ S2 )

The statement p ∧ q → ¬q
Question 10.  is equivalent with which
of the following statement

A q ∧ p. B 1 C p ∨ ¬q D ¬p ∨ ¬q

Question 11. Le R be a relation on the set of positive integers given by “xRy if and only if x = y + 1.” Which
of the following is the transitive closure of R?
 
A R∗ = {(x, y)|x ≥ y}. B R∗ = {(x, y)|x ≤ y}.
 
C R∗ = {(x, y)|x > y}. D R∗ = {(x, y)|x, y ∈ Z}.

Question 12. Let x be any integer. To prove the statement x2 + x is even, we follow these steps:

First, because an arbitrary integer is either even or odd, we setup for proof-by-cases inference
p: x is even; q : x is odd; r : x2 + x is even.
Verify premise 1. If x is even, then x = 2n, for some integer n. Hence, x2 + x = (2n)2 + 2n =
4n2 + 2n, which is even.
Verify premise 2. If x is odd, then x = 2n + 1, for some n. Hence, x2 + x = (2n + 1)2 + (2n + 1) =
(4n2 + 4n + 1) + (2n + 1) = 4n2 + 6n + 2, which is even.

What is the proving method

 used above?  
A Contradiction B Contraposition C Direct D Induction

Question 13.
Which one of the following statements is true?
A For all sets A, B, and C, (A − B) ∩ (C − B) = (A ∩ C) − B.

B For all sets A, B, and C, A − (B − C) = (A − B) − C.

C For all sets A, B, and C, (A − B) ∩ (C − B) = A − (C ∪ B).

D For all sets A, B, and C, if A ∩ C = B ∩ C then A = B.

Student’s signature:. . . . . . . . . . . . . . . Code 2731 Page 2

 r
The statement (p ⇔) ⇒
Question 14.


(q ⇔ r) is equivalent to


A ∼ (∼ p ∨ r) ∧ (p∨ ∼ r) ∨ (∼ q ∨ r) ∧ (q∨ ∼ r) .



B (∼ p ∨ r) ∧ (p∨ ∼ r) ∨ (∼ q ∨ r) ∧ (q∨ ∼ r) .



C (∼ p ∨ r) ∧ (p∨ ∼ r) ∨ ∼ (∼ q ∨ r) ∧ (q∨ ∼ r) .



D ∼ (∼ p ∨ r) ∧ (p∨ ∼ r) ∨ ∼ (∼ q ∨ r) ∧ (q∨ ∼ r) .

Question 15. How many sequences contain 6 numbers from 1, 2, 3, 4, 5, 6 that meet the conditions: 6 numbers
in this sequence are different, and the sum of three first numbers less than the sum of three last
number a (1) unit?   
A 12 B 36 C 72 D 108

Question 16.
Which of the following is correct?
A Every relation R on A must be satisfied at least one of the following properties:
 reflexive, symmetric, anti-symmetric, transitive.
B If a relation R on A satisfy that R2 is reflexive, then it is not necessary that R itself
 is also reflexive.
C There is no relation R on A satisfying all the following properties: reflexive, sym-
 metric, anti-symmetric, transitive.
D If two relations R1 v R2 on A are transitive then their union R1 ∪ R2 is also transitive.

Question 17. Consider the statement: “There exists either a computer scientist or a mathematician who knows
both computer coding and discrete math”. Which of the followings is not logically equivalent to
the statement.
A There exists a person who is a computer scientist or there exists a person who is a
mathematician who knows discrete math or who knows computer coding.
B There exists a computer scientist who knows both discrete math and computer
coding or there exists a person who is a mathematician who knows both discrete
math and computer coding.
C There exists a person who is a computer scientist or a mathematician who knows
both discrete math and computer coding.
D There is no person who is a computer scientist or a mathematician who knows both
discrete math and computer coding.
Question 18. In a certain survey of a group of 200 students, 50% students indicated they can play volley ball,
65% indicated that they can play ping-pong, 15% indicate they cannot play both of them. How
many student can play both of two sport games?  
A 70 B 60 C 50 D 40

Let f : X → Y and g : Y→ Z. Suppose g ◦ f is injective.

Question 19.  Then, 
A f is injective. B f is surjective. C f is bijective. D g is injective.

Question 20. Let R be the relation on N × N defined by (a, b)R(c, d) if and only if ad = bc. Which of the
following answer is the most accurately?
 
A R is not a equivalence relation on N × N. B R is a equivalence relation on N × N.
 
C R is not a symmetric and ir-reflexive rela- D R is not a symmetric and transitive rela-
tion on N × N. tion on N × N.

Student’s signature:. . . . . . . . . . . . . . . Code 2731 Page 3

 HCMUT, VNU-HCM
MIDTERM EXAMINATION
Faculty of CSE
Course: Discrete structures for
Computing (CO1007)
Class: 2018-1-CO1007 Group: CC01
Duration: 60 minutes (Closed-book test)
Examination date: March 27, 2018

Answer Keys to Code: 2731

   
Question 1. B Question 6. D Question 11. C Question 16. B
   
Question 2. A Question 7. C Question 12. C Question 17. A and D
   
Question 3. A Question 8. A Question 13. A Question 18. B
   
Question 4. C Question 9. D Question 14. A Question 19. A
   
Question 5. C Question 10. D Question 15. D Question 20. B

Student’s signature:. . . . . . . . . . . . . . . Code 2731 Page 1