0% found this document useful (0 votes)
240 views10 pages

Multiple Choice Discrete Structures 1 Propositional Logic: Giáo trình Cấu Trúc Rời Rạc Trang 1/10

This document contains a multiple choice quiz on discrete structures with 10 questions. The questions cover topics like propositional logic, predicate logic, and rules of inference. Some questions ask students to represent statements in predicate logic, determine logical equivalences, or identify which logic formulas must be true under all interpretations. In general, the quiz seems to be assessing students' abilities to analyze and represent logical statements and arguments.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
240 views10 pages

Multiple Choice Discrete Structures 1 Propositional Logic: Giáo trình Cấu Trúc Rời Rạc Trang 1/10

This document contains a multiple choice quiz on discrete structures with 10 questions. The questions cover topics like propositional logic, predicate logic, and rules of inference. Some questions ask students to represent statements in predicate logic, determine logical equivalences, or identify which logic formulas must be true under all interpretations. In general, the quiz seems to be assessing students' abilities to analyze and represent logical statements and arguments.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

Trường Đại Học Bách Khoa Tp.

Hồ Chí Minh
Khoa Khoa Học và Kỹ Thuật Máy Tính

Multiple Choice
Discrete Structures

1 Propositional Logic
Question 1.
Which of these is NOT a valid inference rule, where A, B and C are any propositional formula?
A From ¬B and A → B infer ¬A.
B From A infer A ∧ B.
C From A and A −→ B infer B.
D From ¬A and A −→ B infer ¬B.

Answer.B 2

Question 2.
Which formula captures the following statement most accurately?

“When the next large bank gets into trouble (t), the financial system collapses (c) unless
the Central Bank buys the bank (b) .”

A (¬c → b) → t
B (c ∧ ¬b) → ¬t
C (c ∧ ¬b) → t
D t → (¬c → b)

Answer.D 2

Question 3.
Which of the following propositional formulas has value T by assigning p 7→ T , and q, r 7→ F ?
A ¬p ∨ ¬r −→ q
B ¬r −→ (p ∧ q)
C ¬(¬r −→ (p ∧ q))
D ¬p ∨ q ∨ r

Answer.C 2

Question 4.
Which formula captures the following statement most accurately?

“If he catches you (c), Jones will kill you (k) unless you pay (p).”

A c → (¬p → k)
B c → (k → ¬p)
C (¬p → k) → c
D (k → ¬p) → c

Answer.A 2

Giáo trình Cấu Trúc Rời Rạc Trang 1/10


Trường Đại Học Bách Khoa Tp.Hồ Chí Minh
Khoa Khoa Học và Kỹ Thuật Máy Tính

Question 5.
The statement form (p ↔ r) → (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))

Answer.D 2

Question 6.
Which of the following statements is the contrapositive of the statement,
“You win the game if you know the rules but are not overconfident.”
A If you lose the game then you don’t know the rules or you are overconfident.
B A sufficient condition that you win the game is that you know the rules or you are not overconfi-
dent.
C If you don’t know the rules or are overconfident you lose the game.
D If you know the rules and are overconfident then you win the game.

Answer.A 2

Question 7.
A sufficient condition that a triangle T be a right triangle is that a2 +b2 = c2 . An equivalent statement
is
A If T is a right triangle then a2 + b2 = c2 .
B If a2 + b2 = c2 then T is a right triangle.
C If a2 + b2 6= c2 then T is not a right triangle.
D T is a right triangle only if a2 + b2 = c2 .

Answer.B 2

Question 8.
Consider the statement form p → q where p = "If Tom is Jane’s father then Jane is Bill’s niece" and
q = "Bill is Tom’s brother." Which of the following statements is equivalent to this statement?
A If Bill is Tom’s Brother, then Tom is Jane’s father and Jane is not Bill’s niece.
B If Bill is not Tom’s Brother, then Tom is Jane’s father and Jane is not Bill’s niece.
C If Bill is not Tom’s Brother, then Tom is Jane’s father or Jane is Bill’s niece.
D If Bill is Tom’s Brother, then Tom is Jane’s father and Jane is Bill’s niece.

Answer.B 2

Question 9.
The statement form ¬(p ∧ (¬p ∨ q)) ∧ (p → q) is equivalent to

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

Answer.B 2

Giáo trình Cấu Trúc Rời Rạc Trang 2/10


Trường Đại Học Bách Khoa Tp.Hồ Chí Minh
Khoa Khoa Học và Kỹ Thuật Máy Tính

Question 10.
Which of the following statements is NOT equivalent to the statement

“There exists either a computer scientist or a mathematician who knows both discrete
math and Java.”

A There exists a person who is a computer scientist and who knows both discrete math and Java or
there exists a person who is a mathematician and who knows both discrete math and Java.
B 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 Java.
C There exists a person who is a computer scientist and who knows both discrete math and Java or
there exists a mathematician who knows both discrete math and Java.
D There exists a computer scientist who knows both discrete math and Java or there exists a person
who is a mathematician who knows both discrete math and Java.

Answer.B 2

2 Predicate Logic & Proving Methods


Question 11.
Which of the following is the negation of the statement, “For all odd primes p < q there exists positive
non-primes r < s such that p2 + q 2 = r2 + s2 .”
A For all odd primes p < q there exists positive non-primes r < s such that p2 + q 2 6= r2 + s2 .
B There exists odd primes p < q such that for all positive non-primes r < s, p2 + q 2 = r2 + s2 .
C There exists odd primes p < q such that for all positive non-primes r < s, p2 + q 2 6= r2 + s2 .
D For all odd primes p < q and for all positive non-primes r < s, p2 + q 2 6= r2 + s2 .

Answer.C 2

Question 12.
In this question, assume the following predicate and constant symbols:

S(x) : x is a student. L(x, y) : x loves y.

Given these specifications, which of the predicate logic formulas below represent the sentence, “No
students love Tom” in predicate logic?

A ¬∃x(S(x) ∧ L(x, T om)) C ∀x(S(x) → L(x, T om))


B ∃x(S(x) ∧ ¬L(x, T om)) D ¬∀x(S(x) → L(x, T om))

Answer.A 2

Giáo trình Cấu Trúc Rời Rạc Trang 3/10


Trường Đại Học Bách Khoa Tp.Hồ Chí Minh
Khoa Khoa Học và Kỹ Thuật Máy Tính

Question 13.
In this question, assume the following predicate and constant symbols:

W (x, y) : x wrote y h : Hardy


L(x, y) : x is longer than y a : Austen
N (x) : x is a novel

Given these specifications, which of the predicate logic formulas below represent the sentence,
“Hardy wrote a novel which is longer than any of Austen’s” in predicate logic?
A ∀x(W (h, x) → L(x, a)).
B ∀x∃y(L(x, y) → (W (h, y) ∧ W (a, x))).
C ∀x∀y((W (h, x) ∧ W (a, y)) → L(x, y))).
D ∃x(N (x) ∧ W (h, x) ∧ ∀y((N (y) ∧ W (a, y)) → L(x, y))).

Answer.D 2

Question 14.
In this question, assume the following predicate and constant symbols:

S(x) : x is a student A(x, y) : x has asked y a question


F (x) : x is a faculty member

Given these specifications, which of the predicate logic formulas below represent the sentence,“Some
student has never been asked a question by a faculty member” in predicate logic?

A ∃x(S(x) ∧ ∀y(F (y) → ¬A(y, x))) C ∃x(S(x) ∧ ∀y(¬A(y, x) → F (y)))


B ∃x(S(x) ∧ ∃y(F (y) ∧ ¬A(y, x))) D ∀x(S(x) → ∀y(F (y) → A(y, x)))

Answer.A 2

Question 15.
What rule of inference is used in the following argument?
"Jerry is a mathematics major and a computer science major. Therefore, Jerry is a mathematics
major."

A Addition B Simplification C Modus pones D Modus tollens

Answer.B 2

Question 16.
Which of the following predicate calculus formulas must be true under all interpretations?

I. ∀xP (x) ∧ ∀xQ(x) −→ ∀x(P (x) ∧ Q(x)). III. (∃xP (x) ∧ ∃xQ(x)) −→ ∃x(P (x) ∧ Q(x)).
II. ∃x(P (x) ∧ Q(x)) −→ (∃xP (x) ∧ ∃xQ(x)).

A I only. B III only. C I và II. D I và III.

Answer.C 2

Giáo trình Cấu Trúc Rời Rạc Trang 4/10


Trường Đại Học Bách Khoa Tp.Hồ Chí Minh
Khoa Khoa Học và Kỹ Thuật Máy Tính

Question 17.
Which of the following predicate logic formulas are FALSE if the domain of each variable consists of
all real numbers?

A ∀x∃y(x2 = y) C ∃x∀y(xy = 0)
B ∀x∃y(x = y 2 ) D ∀x∀y∃z(z = (x + y)/2)

Answer.B 2

Question 18.
Let Q(x, y) be the statement "x + y = x − y." If the domain for both variables consists of all integers,
which of the following predicate logic formulas are TRUE?

A ∀yQ(1, y) B ∃xQ(x, 2) C ∀x∃yQ(x, y) D ∀y∃xQ(x, y)

Answer.C 2

Question 19.
Which of the following logic formulas are the negation of the formula ∀x∃y∃z((¬P (x) ∧ Q(y)) → R(z))

A ∃x∀y∀z(¬P (x) ∧ Q(y) ∧ ¬R(z)). C ∀x∃y∃z(¬P (x) ∧ Q(y) ∧ R(z)).


B ∃x∀y∀z((¬P (x) ∧ Q(y)) → R(z). D ∃x∀y∀z(P (x) ∧ ¬Q(y) ∧ ¬R(z)).

Answer.A 2

Question 20.
Let L(x, y) be the statement “x loves y,” where the domain for both x and y consists of all people
in the world. Which of the predciate logic formulas below represent the sentence "There is somebody
whom no one loves."

A ∀x∃yL(x, y) B ∃y∀xL(x, y) C ∀y∃x¬L(y, x) D ∃x∀y¬L(y, x)

Answer.D 2

3 Set & Function


Question 21.
Let S be the collection of all sets with at most 5 elements. Then
A An element of S is a set with 1, 2, 3, 4, or 5 elements.
B An element of S is a number which is not greater than 5.
C An element of S is a set with 25 elements.
D An element of S is a set with an arbitrary number of elements.

Answer.A 2

Giáo trình Cấu Trúc Rời Rạc Trang 5/10


Trường Đại Học Bách Khoa Tp.Hồ Chí Minh
Khoa Khoa Học và Kỹ Thuật Máy Tính

Question 22.
Which 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 − B) = A − (B ∪ C).
C For all sets A, B, and C, if A ∩ C = B ∩ C then A = B.
D For all sets A, B, and C, if A ∪ C = B ∪ C then A = B.

Answer.A 2

Question 23.
Let P (A) denote the power set of A. If P (A) ⊆ B then

A 2|A| ≤ |B| B 2|A| < |B| C |A| + 2 ≤ |B| D 2|A| ≥ 2|B|

Answer.A 2

Question 24.
For any set A, which is correct?

A P (∅ × ∅) = ∅. B P (∅) ⊂ ∅. C P (∅ − A) = ∅. D |P (P (∅)−{∅})| = 1.

Answer.D 2

Question 25.
Which of the following statements if FALSE?
A {1,2,3} ⊆ A implies that {1} ∈ A and {2,3} ⊆ A.
B {1,2,3} ⊆ A ∩ B implies that {1,2,3} ⊆ A and {1,2,3} ⊆ B.
C {1,2,3} ⊆ A ∪ B implies that {1,2} ⊆ A and {3} ⊆ B.
D {1,2} ⊆ A − B and {3,4} ⊆ B implies that {1,2,3,4} ⊆ A ∪ B.

Answer.C 2

Question 26.
Which of the following statements is FALSE?

A C − (B ∪ A) = (C − B) − A C B − (A ∪ C) = (B − C) − A
B A − (C ∪ B) = (A − B) − C D A − (B ∪ C) = (B − C) − A

Answer.D 2

Question 27.
n 1−(−1)n
Define f (n) = 2 + 4 for all n ∈ Z. Thus, f : Z → Z, Z the set of all integers. Which is correct?
A f is a function and is onto and one-to-one.
B f is a function and is not onto but is one-to-one.
C f is a function and is not onto and not one-to-one.
D f is a function and is onto but not one-to-one.

Answer.D 2

Giáo trình Cấu Trúc Rời Rạc Trang 6/10


Trường Đại Học Bách Khoa Tp.Hồ Chí Minh
Khoa Khoa Học và Kỹ Thuật Máy Tính

Question 28.
Let f : X → Y and g : Y → Z. Let g : Y → Z. Let h = g ◦ f : X → Z. Suppose g is one-to-one and
onto. Which of the following is FALSE?
A If f is one-to-one then h is one-to-one and onto.
B If f is one-to-one then h is one-to-one.
C If f is onto then h is onto.
D If f is not onto then h is not onto.

Answer.A 2

Question 29.
A hot-dog stand owner makes a profit of $100 when he sells 90 hot dogs a day. He has a loss of $30
when he sells 25 hot dogs a day. Which linear relation represents his profit?

A y = 0.5x + 55 B y = 1.08x + 3.08 C y = 1.11x D y = 2x − 80

Answer.D
2

Question 30.
Jane has a list of 37 potential customers for his house-paiting business. In order to get a business
grant, he must graph his income versus the number of customers. Determine the domain of the graph.

A {0, 1, 2, 3, ...} C all real numbers


B {0, 1, 2, 3, ..., 37} D all real numbers between 0 and 37

Answer.B 2

Question 31.
Give the domain and range of the relation {(1, −8), (−7, 8), (−3, 7), (−3, −5)}
A domain = {7, 8, -8, -5}; range = {-3, -7, 1}
B domain = {-3, -7, 1, 3}; range = {7, 8, -8, -5}
C domain = {-3, -7, 1}; range = {7, 8, -8, -5}
D domain = {-3, -7, 1, -13}; range = {7, 8, -8, -5}

Answer.C 2

Question 32.
Find the nth term of the sequence 1, -4, 9, -16, ...

A an = −2n C an = (−1)n (n)2


B an = (−2)n D an = n2

Answer.C 2

Giáo trình Cấu Trúc Rời Rạc Trang 7/10


Trường Đại Học Bách Khoa Tp.Hồ Chí Minh
Khoa Khoa Học và Kỹ Thuật Máy Tính

Question 33.
Find the sum of the infinite series
∞  k
X 2
5
3
k=0

10
A 0 B 3 C 5 D 15

Answer.D 2

Question 34.
Find the 5th term of the recursive sequence ak+1 = 2ak − 1, where a1 = 2.

A 17 B 10 C 9 D 5

Answer.A 2

Question 35.
Let f (x) = bxc. Find f −1 {x|0 < x < 1}

A {x|0 ≤ x < 1} C {x|0 < x < 1}


B {x|0 < x ≤ 1} D ∅

Answer.D 2

Question 36.
Let A = {1, 2, 3} and B = {2, 3}. If C = (A − B) × B then

A C = {1, 2, 3} C C = {(1, 2), (1, 3), (2, 2), (2, 3), (3, 2), (3, 3)}
B C = {(2, 1), (3, 1)} D C = {(1, 2), (1, 3)}

Answer.D 2

4 Relation
Question 37.
Say that two real numbers a and b are related if the sum of their squares is 2015. Then this relation is

A A function C Symmetric
B An equivalence relation D Anti-symmetric

Answer.C 2

Question 38.
Say that two functions f and g; with domain R, are related if f (x) ≤ g(x) for every x ∈ R. Then

A This is an equivalence relation. C This is a function.


B This is an order relation. D This does not allow us to compare any two
functions.

Answer.D 2

Giáo trình Cấu Trúc Rời Rạc Trang 8/10


Trường Đại Học Bách Khoa Tp.Hồ Chí Minh
Khoa Khoa Học và Kỹ Thuật Máy Tính

Question 39.
How many transitive relations are there on a set with 2 elements?

A 4 B 8 C 13 D 15

Answer.C
2

Question 40.
Exactly which of the relations R1 , R2 , and R3 on {1, 2, 3, 4} that are given below are antisymmetric?

R1 ={(1, 1), (1, 2), (2, 2), (2, 3), (3, 3), (3, 4), (4, 4), (4, 1)};
R2 ={(1, 1), (1, 2), (2, 3), (3, 3), (3, 2), (4, 2)};
R3 =∅.

A R1 , R2 B R1 , R3 C R2 , R3 D R2

Answer.B 2

Question 41.
How many reflexive relations are there on a set with 3 elements?

A 5 B 3 C 15 D 8

Answer.D 2

Question 42.
Let R be the relation {(x, y)|x = y + 1} on the set of integers. What is the transitive closure of R?

A R∗ = {(x, y)|x ≥ y}. C R∗ = {(x, y)|x > y}.


B R∗ = {(x, y)|x ≤ y}. D R∗ = {(x, y)|x, y ∈ Z}.

Answer.C 2

Question 43.
Let R be the relation on the set X = {a, b, c, d} defined below
R = {(a, b), (b, a), (a, c), (c, a), (b, c), (c, b)}.
Let R0 = (X × X)\R. Determine the properties of R0 ?

A transitive. B antisymmetric. C symmetric. D none of above.

Answer.C 2

Question 44.
Define a binary relation R = {(0, 1), (1, 2), (2, 3), (3, 2), (2, 0)} on A = {0, 1, 2, 3}. The directed graph
(including loops) of the transitive closure of this relation has

A 16 arrows B 12 arrows C 8 arrows D 6 arrows

Answer.A 2

Question 45.
Let R and S be binary relations on a set A. Suppose that R is reflexive, symmetric, and transitive

Giáo trình Cấu Trúc Rời Rạc Trang 9/10


Trường Đại Học Bách Khoa Tp.Hồ Chí Minh
Khoa Khoa Học và Kỹ Thuật Máy Tính

and that S is symmetric, and transitive but is not reflexive. Which statement is always true for any
such R and S?
A R ∪ S is symmetric but reflexive and not transitive.
B R ∪ S is symmetric but not reflexive.
C R ∪ S is reflexive and symmetric.
D R ∪ S is symmetric but not transitive.

Answer.C 2

Question 46.
Suppose A = {2, 4, 5, 6, 7, 10, 18, 20, 24, 25} and R is the partial order relation (x, y) ∈ R iff x|y. Find
all maximal elements.

A 18, 10, 25, 20, 2 C 18, 24, 20, 25, 7


B 18, 24, 20 D 18, 24, 20, 25

Answer.C 2

Giáo trình Cấu Trúc Rời Rạc Trang 10/10

You might also like