Professional Documents
Culture Documents
Co1007 CC GK212
Co1007 CC GK212
Question 1. (L.O.3.1) How many ways to divide 32 identical blackboards among 4 schools if
each school must receive at least one blackboard? Type the exact value. Do not type formulas.
A. 4495 B. 3146 C. 1456 D. 2389
Question 2. (L.O.3.1) How many positive integers not exceeding 2022 are divisible either by 4
or by 6? Type the exact value. Do not type formulas.
A. 432 B. 674 C. 525 D. 981
Question 3. (L.O.3.1) A palindrome is a string whose reversal is identical to the string. How
many bit strings of length 11 are palindrome? Type the exact value. Do not type formulas.
A. 32 B. 128 C. 64 D. 16
Question 4. (L.O.3.1) How many different sets that have exactly 3 elements (not necessarily
distinct), the elements are non-negative integers, and the sum of them is 10? Type the exact
value. Do not type formulas.
A. 14 B. 21 C. 10 D. 16
Question 5. (L.O.3.1) How many strings with six or more characters can be formed from the
letters in “NOCOPYP”? Type the exact value. Do not type formulas.
A. 3060 B. 2520 C. 1024 D. 3688
Page 1 of 5
Question 6. (L.O.2.2) The relation R on the set of all real numbers defined by aRb if a b is a
rational number is
A. reflexive, symmetric, anti-symmetric, and transitive
B. symmetric, anti-symmetric, and transitive
C. reflexive, anti-symmetric, and transitive
D. reflexive, symmetric, and transitive
A. B. 2 C. S D. R
Question 8. (L.O.2.2) The transitive closure of the relation (1, 2), (1,3), (1, 4), (2,3), (2, 4), (3, 4) on
1, 2,3, 4 is also
A. anti-symmetric C. symmetric
B. reflexive D. all of the other choices are correct
Question 9. (L.O.2.2) Let R ( S ) be the set of all relations on a set S excluding the empty relation.
The relation ~ on R ( S ) is defined as follows. For M , N R ( S ), M ~ N if M N . Which of
the following statements is the most CORRECT?
A. R(S ), ~ is totally orderd C. R(S ), ~ is a partially ordered
Question 10. (L.O.2.2) Given the poset 2, 4,6,9,12,18, 27,36, 48,60,72 ,| , where | is the
divisibility relation. Find all maximal elements if they exist.
A. 27, 48, 60, 72 C. 36, 48, 60, 72
B. 9, 27, 48, 60 D. There is no maximal element
Page 2 of 5
Question 11. (L.O.2.2) Let S 0,1, 2,3, 4,5,6,7,8,9 . What is the smallest integer n such that
for every A S and | A | n , A contains two disjoint subsets x1 , x2 and y1 , y2 satisfying
x1 x2 y1 y2 9?
A. 5 B. 6 C. 7 D. 8
Question 13. (L.O.2.2) Is it true that if f is not one-to-one and g is not onto then f g is
neither one-to-one nor onto?
A. No B. Yes
A. C. (1,2)
B. (2, 2) D. None of the other choices are correct
Question 15. (L.O.3.1) Let f (1) 1 and f (n) f (n 1) 2n 1 for n 2. Find the value of
f (88).
A. 9090 B. 1088 C. 6688 D. 7744
Question 17. (L.O.2.1) The truth value of the statement “If 7|9 is true then 7|18”, where | is the
divisibility relation on , is
A. true B. false C. can’t be determined
Question 18. (L.O.2.1) Let p, q, and r be propositions. Which of the following propositions is
logically equivalent to p q r ?
A. p q r B. p q r C. q r p D. q p r
Question 19. (L.O.2.1) Determine the truth value of xy x y 2 , where the domain of each
variable consists of all real numbers.
A. False B. True
Question 20. (L.O.2.1) Determine the truth value of xy x y 2 , where the domain of each
variable consists of all nonzero real numbers.
A. False B. True
Page 4 of 5
Semester/Academic 2 2021-2022
MIDTERM TEST year
(Answer Key) Date 03/05/2022
HO CHI MINH CITY UNIVERSITY OF Course title Discrete Structures for Computing
TECHNOLOGY
FACULTY OF COMPUTER SCIENCE AND Course ID CO1007
ENGINEERING Duration 60 minutes
Notes: - Online.
Page 5 of 5