HCMUT, VNU-HCM MIDTERM

FACULTY OF CS AND ENGINEERING Subject: Discrete Structures (CO1007)

Class: CC15KTM2+QT15CNT2 Group: CC01
Time: 60 minutes (Closed book test)
Test date: June 27 2016

Student’s Name: Student’s ID:

Final Score: Examiner: Examiner’s Signature:

(There are 20 MCQs, each question is worth 0.5 points. Answers in bold : ; cancel out to deselect: @
 .)

Question 1. Represent the sentence “All Vietnamese speak the same languages” in predicate calculus.

A ∀x, ∀y, ∃l V ietnamese(x) ∧ V ietnamese(y) ∧ Speak(x, l) −→ Speak(y, l).

B ∀x, ∃l V ietnamese(x) ∧ Speak(x, l).

C ∀x, ∃y, ∃l V ietnamese(x) ∧ V ietnamese(y) ∧ Speak(x, l) −→ Speak(y, l).

D ∀x, ∀y, ∀l V ietnamese(x) ∧ V ietnamese(y) ∧ Speak(x, l) −→ Speak(y, l).

Question 2. If a student randomly guesses at 20 multiple choice questions, find the probability that the
student gets exactly four right. Each answer has four possible choices.
1 1  
A 20 .

B . C 3.5692 × 10−7 . D 0.1897.
4
5

Question 3. Translate the specification ∃p(F (p) ∧ B(p)) → ∃jL(j) into English where

• F (p) is “Printer p is out of service,”

• B(p) is “Printer p is busy,”

• L(j) is “Print job j is lost.”


A If there is a printer that is both out of service and busy, then some job has been lost.

B If there is a printer that is both out of service and busy, then all jobs have been lost.

C If all printer that are both out of service and busy, then some job has been lost.

D If some job has been lost, then there is a printer that is both out of service and busy.

How many sequences of 

Question 4. bits of length 100 have as 
many 0’s as 1’s? 
100 100
C 250 . D 2100 − 250 .


A 2 . B 50 .

Question 5. Let p, q, and r be the propositions, where:

• p: Grizzly bears have been seen in the area.

• q: Hiking is safe on the trail.

• r: Berries are ripe along the trail.

Write the following proposition using p, q, and r and logical connectives.

   
A (p ∧ r) → q. B (p ∧ r) → ¬q. C ¬q → (p ∧ r). D (p ∨ r) → ¬q.

Question 6. How many ways of coloring 5 objects a1 , a2 , a3 , a4 , a5 with 3 colors, such that each color must
be used at least once?
   
A 15. B 60. C 10. D 150.

Student’s Signature: . . . . . . . . . . . . . . Code 2761 Page 1

 Question 7. Find the flaw(s) in the following inductive“proof” of a RIDICULOUS CLAIM that “All tables
are the same height.”
“Proof ”. To prove this by induction, we let P (n) be the statement “For any set of n tables, all n
tables are the same height.” If we prove this true for all n, it will certainly be true for n = the
number of tables that exist.
Now we proceed by induction on the number of tables.
Step 1: The base case is the case in which there is one table. Since this table is the same height
as itself, the base case is true.
Step 2: Now assume that the statement holds for ANY set of n tables, and consider a set of
n + 1 tables.
Step 3: Put the tables in a line. If we remove the first table, we are left with a set of n tables.
Then by the inductive hypothesis, these n tables must all be the same height. If, instead, we had
removed the last table, we would again have n tables, which would now include the first one, and
again by inductive hypothesis all n tables would be the same height. Therefore, all of the tables
must be the same height as, for instance, the second table from the front, and consequently must
be the same height as one another.
The result then follows from induction. QED.

A NO. The “proof” above has no flaw.

B Step 3 is not correct when n = 1.

C We can’t say that if we prove P (n) true for all n, it will certainly be true for n =
the number of tables that exist, and therefore “All tables are the same height.”
D All arguments in the “proof” above is invalid because the statement “All tables are
the same height” is a fallacy.
Question 8. Let Z8 = {0, 1, 2, 3, 4, 5, 6, 7} be the set of all residue classes in modulo 8, i.e., Z8 is the set of all
equivalency classes of the following equivalent relation

a ≡ b ⇐⇒ 8|(a − b), ∀a, b ∈ Z.

Then the map

f :Z8 −→ Z8
x 7−→ 2x
 
A is a surjection but not an injection. B is a bijection.
 
C is neither surjective nor injective. D is an injection but not a surjectiion.

Question 9. How many of the natural numbers between 100 and 1000 are either multiples of 3 or multiples
of 7?
   
A 300. B 128. C 428. D 385.

Question 10. Let X, Y be two nonempty sets and let f : X −→ Y be a function. Consider A, B ⊆ X, and
C, D ⊆ Y . Which of the following is correct?
 
A f −1 (C) = f −1 (C). B f (A ∪ B) = f (A) ∪ f (B).
 
C f (A) = f (A). D f (f −1 (D)) = D.

Student’s Signature: . . . . . . . . . . . . . . Code 2761 Page 2

Question 11. Which of the following predicate calculus formulas is not a tautology?

I. ∀x(P (x) → A) ←→ ∃xP (x) → A, where x does not occur as a free variable in A.

II. ∃x(P (x) → A) ←→ ∀xP (x) → A, where x does not occur as a free variable in A.

III. ∀x(P (x) → Q(x)) −→ (∀xP (x) → ∀xQ(x)).

IV. (∀x(P (x) ↔ Q(x))) ←→ (∀xP (x) ↔ ∀xQ(x)).

 
A Formula I. B Formula II.
 
C Formula III. D Formula IV.

Which of the following statements

Question 12.  is not true?  
A ∅ ∈ ∅. B ∅ ∈ {∅}. C ∅ ⊆ ∅. D ∅ ⊆ {∅, {∅}}.

Question 13. A sequence is defined by the recurrence relation Un+1 = 2Un − 5 and U0 = 10. Which term of
this sequence is the first to exceed 90?
   
A U5 . B U3 . C U4 . D U6 .

How many terms of the 

Question 14. sequence -5, -1, 3, ... must
be added to give a sum of400?
A 15. B 16. C 17. D 18.

The statement “x is a minimal of the poset (A, 4)”is equivalent to

Question 15.
A ∀y ∈ A((x = y) ∨ (x < y)). B ∀y ∈ A((x = y) ∨ (y < x)).
 
C ∀y ∈ A((x = y) ∨ (x  y)). D ∃y ∈ A((x = y) ∨ (x  y)).

Question 16. How many ways are there to distribute 40 identical jelly beans among 7 CSE-HCMUT students,
if each student gets at least 1 bean?





39
A 33 . B 40 7 . C 46 6 . D 46
7 .

Suppose that A, B, C, D ⊂ S. Which of the following

Question 17.  is not correct?
A (A ∪ B)\(A ∩ B) = (A\B) ∪ (B\A). B A ⊇ B ⇐⇒ A ⊆ B.
 
C (A\B)\C = (A\C)\(B\C). D (A ∪ B) ∩ (C ∪ D) ⊂ (A ∩ C) ∪ (B ∩ D).

Question 18. How many equivalence relations on a set with 3 elements?

   
A 3. B 4. C 5. D 6.

propositional formula p −→
The contrapositive of the
Question 19.  (q ∨ r) is 
A ¬q ∧ ¬r −→ p. B ¬p −→ ¬(q ∨ r). C ¬q ∨ ¬r −→ p. D q ∨ r −→ p.

Question 20. Let S be the relation defined on R by aSb ⇐⇒ |a − b| ≤ 5. Then S is

 
A reflexive and transitive. B symmetric and anti-symmetric.
 
C symmetric but not transitive. D neither reflexive nor transitive.

Student’s Signature: . . . . . . . . . . . . . . Code 2761 Page 3