MOST POPULAR AROUND THE WORLD

SUCCESS

PRACTICE BOOK» NOT FOR SALE

SERIES

DISCRETE MATHEMATICS
BOOST YOUR KNOWLEDGE

DESIGNED FOR SURE SUCCESS

MCQ EDITION
NARAYAN CHANGDER

+ S
3 0 ON
9 TI RS
ES WE
QU NS
A
USEFUL FOR
4STUDENTS 4
□ □TEACHERS 4
□PARENTS 4□KIDS 4
□QUIZ TEST
□EXAM 4
4 □TRIVIA TEST 4
□COMPETITIVE EXAM 4
□OTHERS
 Preface:
This book has undergone rigorous scrutiny to ensure its accuracy. I eagerly invite constructive
feedback on its content. Feel free to reach out to me via Facebook at https://www.facebook.
com/narayanchangder. Additionally, you can access all of my books on Google Play Books at
https://play.google.com/store/books/author?id=Narayan+Changder.

JAI SHREE RAM

NARAYAN CHANGDER
This E-book is dedicated to the loving memory of my mother:

PRACTICE BOOK» NOT FOR SALE

my guiding light, my shining star,
forever

It is my deepest gratitude and warmest

affection that I dedicate this Ebook.

To my mother JOYTSNA CHANGDER

who could not see this Ebook.

who has been a constant source of Knowledge and in-

spiration. Mom, Covid did not take you, it took our
many dreams. wherever you are we will meet again.
 Disclaimer

The aim of this publication is to sup-

ply information taken from sources be-
lieved to be valid, reliable and authen-
ticate. The author bear no responsibil-
ity for any damage arising from inad-
verent omissions, negligence or inac-
curacies (typographical or factual) that
♣

NARAYAN CHANGDER
may have found their way into this PDF
booklet.
Due care has been taken to ensure that
the information provided in this book
is correct. Author is not responsible
for any errors, omissions or damage
arising out of use of this information.

nt
Importa inter-
s , s e ar ch the de
er to inclu -
i t h t h e answ w a n t
w u au
atisfied . If yo ontact
If not s rrect answers klet, please c t s:
p
net for
co
i n t h is boo F a c e b ook ht
estions on
tact him arayanchangd
er/
new qu a n c o n n
ou c om/
thor. Y acebook.c
. f
//www
CRUCIAL INFORMATION: PLEASE READ BEFORE
CONTINUING:

PRACTICE BOOK» NOT FOR SALE

1. If you require practice sets on various sub-
jects, kindly send us a message on Facebook
with the subject name. Our team will be happy
to create them for you. Message us on Face-
book at https://www.facebook.com/
narayanchangder
2. Additionally, you can access all of my books
with answers on Google Play Books at »>
https://play.google.com/store/books/
author?id=Narayan+Changder
3. Answers are given at the end of every page
to help you identify your strengths and weak-
nesses.
4. It shows you how to build your own techni-
cal and pedagogical skills to enable them to
create their own materials and activities for
students.
5. It helps you to see how you can make the
 transition from classroom teaching to blended
and online teaching.
6. It’s the cheapest good quality ebook that you
can buy online on google play books.

NARAYAN CHANGDER
7. The money raised from creating the sales of
the book will help to ensure that I’m able to
produce similar books like this at a compara-
ble price.
8. YOU CAN DOWNLOAD 4000+ FREE PRACTICE
SET PDF EBOOK ON VARIOUS SUBJECTS (NURS-
ERY to UNIVERSITY LEVEL) FROM GOOGLE
DRIVE LINK https://drive.google.com/
drive/u/1/folders/19TbUXltOSN5S7FV3sL
 PRACTICE BOOK» NOT FOR SALE
Contents

1 DISCRETE MATHEMATICS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
1.1 DISCRETE MATHEMATICS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
 1. DISCRETE MATHEMATICS

NARAYAN CHANGDER
1.1 DISCRETE MATHEMATICS
1. Let P (x) denote the statement “x >7.” A. We have P → Q and P, so Q follows.
Which of these have truth value true? Sue gets an B.
A. P (0) B. We have P → Q and P, so Q follows.
B. P (4) Sue gets an A.
C. We have P → Q and P, so P follows.
C. P (6)
Sue gets an A.
D. P (9)
D. We have Q → P and P, so Q follows.
2. If g and f are two one-to-one functions, Sue gets an A.
then their composition of fog is:
5. �����������Discrete Distribution
A. Onto A. Geometric distribution
B. One to one function B. Gaussian distribution
C. Bijective C. Poisson distribution
D. None of these D. Hypergeometric distribution
3. The domain of 1/(9 − x2 ) 6. Graph Type:set of vertices V, and set of
A. (-3, 3) Edges E, that are ordered pair of elements
of V (directed edges)
B. (-3, 3]
A. Simple Graph
C. [-3, 3]
B. Multigraph
D. None of these
C. Pseudograph
4. Suppose I tell Sue that if she gets a 93% D. Directed Graph
on her final, then she will get an A in the
class. Assuming that what I said is true, 7. are the set of all whole numbers but it
what can you conclude this case if Sue gets includes a negative set of natural numbers
a 93% on her final. also. It is denoted by the symbol Z.

1. D 2. B 3. A 4. B 5. B 6. D 7. D
1.1 DISCRETE MATHEMATICS 3

A. Whole Numbers 13. refers to a number’s quality of being

B. Natural Numbers evenly divided by another number, with-
out a remainder left over.

PRACTICE BOOK» NOT FOR SALE

C. Real Numbers
A. Division Algorithm
D. Integers
B. divisibility
8. Find the inverse f(x)= x4-2 C. Parity
A. �(x+2) D. Positivity
B. (x+2)4 14. The premises (p ∧ q) ∨ r and r → s implies
C. -1+2x4 which of the conclusion?
A. p ∨ r
D. �2x
B. p ∨ s
9. If there are ‘M’ switches in series num- C. q ∨ s
bered from 1, 2, , M. For circuit to be
complete and bulb to glow which of the fol- D. q ∨ r
lowing is necessary? 15. An example that shows a statement is
A. 1∧ 2∧ 3 ∧ ∧M should be on false:
B. 1∧ 2∧ 3 ∧ ∧M should be off A. hypothesis

C. 1 v 2 v 3 v v M should be on B. conclusion
C. counterexample
D. None of the mentioned
D. none of above
10. Which is not a function on {a, b, c}?
16. The inverse of 19 modulo 141 is?
A. {(a, b), (b, b), (c, c)}
A. 50
B. {(a, a), (b, b), (c, c)} B. 51
C. {(a, b), (b, b), (a, c), (c, a)} C. 54
D. {(a, b), (c, a)} D. 52
11. If A and B are two sets, then A∩(AB)c = 17. Translate the following statement into
A. ϕ symbolic form p = Amanda is happy q =
Amanda is smiling She is neither happy nor
B. A‘ smiling
C. B A. p v q
D. none B. ∼ ( p v q )
C. ∼ (pq )
12. How many ways can we rearrange the let-
ters h, i, j, k, l, m, n, and o without repeat- D. ∼ pq
ing? 18. P ∧ (Q ∨ R) ↔ (P ∧ Q) ∨ (P ∧ R) is a
A. 5, 040 A. Tautology
B. 64 B. Contradiction
C. 40, 320 C. Contingency
D. 16 D. None of these

8. A 9. A 10. C 11. A 12. C 13. B 14. B 15. C 16. D 17. B 18. A 19. B
1.1 DISCRETE MATHEMATICS 4

19. What is the dual of (A ∧ B) v (C ∧ D)? C. (4, 2)

A. (A V B) v (C v D) D. (5, 3)
B. (A V B) ∧ (C v D) E. (5, 5)
C. (A V B) v (C ∧ D) 25. The function f : R → R, f (x) = (x −
D. (A ∧ B) v (C v D) 1)(x − 2)(x − 3)

20. Which of the following are the set of inte- A. One one but not onto

NARAYAN CHANGDER
gers? B. Onto but not one one
A. {1/2, 1/3, 1/4, 1/5} C. One one and onto
B. {0, 1, 2, 3, 4, 5} D. Neither one one nor onto
C. {-3, -2, -1, 0, 1, } 26. The set operation which is a relative com-
D. {a, b, c, d, e} plement of sets A and B, is the set of all
elements in A that are not in B.
21. The number of distinguishable permuta-
tions of the letters in the word BANANA A. Complementation
are, B. Difference
A. 60 C. ∪nion
B. 20 D. Intersection

22. Which is not a Depth-First Search method? 27. 0 ∈ 0/

A. Inorder A. true
B. Level order B. false
C. Pre order
28. From the picture, what kind of function is
D. Post order the diagram showing?
23. Which two of the following are equivalent
for an undirected graph G? (i) G is a tree
(ii) There is at least one path between any
two distinct vertices of G (iii) G contains
no cycles and has (n-1) edges (iv) G has n
edges
A. (i) and (ii) A. 1-1 function, but not comprehensive
B. (i) and (iii) B. The function is thorough but not 1-1.
C. (i) and (iv) C. Thorough 1-1 functionality
D. (ii) and (iii) D. Functions that are not 1-1 and not com-
prehensive
24. Which item is not in R on {2, 3, 5} where
R = {(a, b)| a>b} (There may be many an- E. Not a function
swers, answer them all) 29. Which of the following statement is a
A. (3, 2) proposition?
B. (5, 2) A. What time is it?

20. C 21. A 22. B 23. B 24. C 24. E 25. B 26. B 27. B 28. A 29. C
1.1 DISCRETE MATHEMATICS 5

B. Read this carefully. 35. Let P:We should be honest., Q:We should
C. Toronto is the capital of Canada be dedicated., R:We should be overconfi-
dent. Then ‘We should be honest or dedi-

PRACTICE BOOK» NOT FOR SALE

D. x + 1 = 2. cated but not overconfident.’ is best rep-
30. Which of the following does not correctly resented by?
match the equivalence rules? A. ∼P V ∼Q V R
A. De Morgan:∼ (p ∧ q) ≡ ∼ p ∨ ∼ q B. P ∧ ∼Q ∧ R
B. Output rule:p → (q → r) ≡ (p ∧ q) → C. P V Q ∧ R
r.
D. P V Q ∧ ∼R
C. Alternating pair rule:p → q ≡ ∼ p ∨
q 36. A way to reach a conclusion using reason-
ing:
D. Distributive law:p ∧ (q ∨ r) ≡ (p ∧ q)
∨ (p ∧ r) A. Proof

31. A bridge can not be a part of B. hypothesis

A. a simple cycle C. counterexample

B. a tree D. none of above

C. a clique with size ≥ 3 whose every 37. Find Sn for the given series:a1=22 d=-8
edge is a bridge n=21
D. a graph which contains cycles A. 1911
32. What is the GCF of 8 and 10? B. -1449
A. 2 C. -2436
B. 4 D. -1218
C. 6 38. Is this mapping a function or not a func-
D. 3 tion?

33. {x} ∈ {{x}}

A. true
B. false
34. hash table size 9 with hash function is H(x,
i) = 2x + i mod 9 where x is the data value
and i equals the number of collisions. If
data 47 is inserted into this hash table and A. Function
it is found that there are 2 collisions 47
B. Not a Function
What number slot will be agreed upon?
A. 6 39. A trail in a graph can be described as
B. 4 A. a walk without repeated edges
C. 2 B. a cycle with repeated edges
D. 3 C. a walk with repeated edges
E. 5 D. a line graph with one or more vertices

30. C 31. A 32. A 33. A 34. A 35. D 36. A 37. D 38. B 39. A
1.1 DISCRETE MATHEMATICS 6

40. If set A contain 4 element and set B con- 45. Let S = {2, 3, 4, 16} be ordered by divisi-
tains 5 elements then AxB contains el- bility. Then the maximal elements are
ements. A. 3, 16
A. 45 B. 4, 16
B. 54 C. 16, 3
C. 20 D. 4, 3
D. 9

NARAYAN CHANGDER
46. What branch of mathematics that deals
with the properties of well-defined collec-
41. Which among the choices below is NOT
tions of objects, which may or may not be
variation of conditional statement?
of a mathematical nature, such as numbers
A. Bijective or functions?
B. Inverse A. Inverse
C. Contrapositive B. Set Theory
D. Converse C. Logic
D. None of the above.
42. Algebra of logic is termed as
47. Order of the power set of a set of order n
A. Boolean algebra
is
B. Numerical logic A. n
C. Boolean number B. that
D. Arithmetic logic C. n2

43. Given set A = B, which answer is not true? D. 2n

(There may be many answers. Answer 48. Condition for monoid is
them all)
A. (a+e)=a
A. A is a subset of set B.
B. (a*e)=(a+e)
B. B is a subset of set A.
C. a=(a*(a+e)
C. A ∩ B = 0/ D. (a*e)=(e*a)=a
D. A and B have the same members.
49. How many outcomes are in the sample
E. A ∪ space for tossing one coin?

44. How many 3-digit numbers can be formed A. 1

from the digits 2, 3, 5, 6, 7 and 9, which B. 2
are divisible by 5 and none of the digits is C. 4
repeated?
D. 8
A. 5
50. Which is true about the Simple graph with
B. 10
6 vertices?
C. 15
A. will be a connected graph There must
D. 20 be a minimum of 5 sides.

40. C 41. A 42. D 43. C 44. D 45. A 46. B 47. D 48. D 49. B 50. A 50. B
1.1 DISCRETE MATHEMATICS 7

B. If there are at least 11 sides, it is a 56. It is a mathematical technique that deter-

connected graph. mines the possible arrangements in a col-
lection of items where the order of the se-

PRACTICE BOOK» NOT FOR SALE

C. If there are at least 15 sides, it is a
connected graph. lection does not matter.
D. will be a connected graph There must A. Factorial Notation
be a minimum of 11 sides. B. Permutation
51. p ∧ q:It is raining and it is cold C. Combination
A. True
D. Counting
B. False
57. An implication written as is the propo-
52. Evaluate 10P3
sition “if A, then B”. It is false if A is true
A. 3, 628, 800 and B is false.
B. 5, 040 A. A∧B
C. 720
B. ¬A
D. 120
C. A→B
53. Picking a President, Vice-President, and
D. A∨B
Secretary from a group of 12.
58. The set operation that is the set of all el-
ements in the given universal set ∪ that
are not in A.
A. Complementation
B. Difference
A. Permutation C. ∪nion
B. Combination
D. Intersection
C. Neither
D. none of above 59. Given h (x) = x2 − 4 what is h (6)?

54. ∼(∼p) = p is A. 32
A. involution law B. 0
B. double negation law C. -4
C. complement law D. 77
D. none of above
60. It is used to represent the universal set
55. The applies when a procedure is made (universe)
up of separate tasks.
A. Circle
A. Product Rule
B. Sum Rule B. Rectangle

C. Subtraction Rule C. Square

D. Division Rule D. Oval

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 8

61. A −→ B, A −→ C, ∼ (B ∧C) , D ∧ A 66. A is defined as a a non-empty finite set

A. A of elements called vertices or nodes having
the property that each node can have min-
B. B imum degree 1 and maximum degree n.
C. C
A. Tree
D. D
B. Acrylic Graph
62. What type of logic is this table showing: C. General Tree

NARAYAN CHANGDER
D. Function

67. Each student in a class of 40 plays at least

one indoor game chess, carrom and scrab-
ble. 18 play chess, 20 play scrabble and
27 play carrom. 7 play chess and scrabble,
12 play scrabble and carrom and 4 play
chess, carrom and scrabble. Find the num-
ber of students who plays chess and car-
rom.
A. AND A. 10
B. OR B. 11
C. IF, THEN C. 12
D. none of above D. 15
63. In how many different ways can the let-
68. Solve the system of equations to find the
ters of the word “MAGIC” can be formed?
value of z.
A. 24 ways
B. 120 ways
C. 240 ways
D. 720 ways
64. TR∪E or FALSE:Combinatorics is the branch
of Mathematics dealing with combinations
of objects belonging to a finite set in ac- A. 4
cordance with certain constraints, such as B. -4
those of graph theory.
C. 2
A. True
D. -2
B. False
69. Which of these conditions is apt if one
65. P→Q¬Q∴¬P
wants to add two matrices?
A. Removing Mode
A. Columns of both of those matrices that
B. Setting Mode we would add are equal.
C. Disjunctive Syllogism B. The columns and rows of the matrices
D. Hypothetical Syllogism that we want to add are similar.

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 9

C. The total number of the rows and 75. Matrix multiplication is a/an prop-
columns of the first matrix must be equal erty.
to the total number of rows and columns

PRACTICE BOOK» NOT FOR SALE

A. Commutative
in the second matrix that we want to add.
B. Associative
D. The rows of both of those matrices that
we would add are similar. C. Additive
D. Disjunctive
70. xx + xx
A. 1 76. R is a relation defined in Z by aRb if and
only if ab ≥ 0
B. 0
A. Reflexive only
C. x
B. Reflexive and Symmetric
D. x
C. Symmetric and Transitive
71. Which of these cannot be considered a
probability of an outcome? D. Reflexive, Tranisitive and Symmetric

A. 1/3 77. How many distinguishable 11-letter ar-

B. -1/5 rangements can be made from the letters
of the word CHATTANOOGA?
C. 0.80
A. 24
D. 112%
B. 39, 916, 800
E. 1
C. 1, 663, 200
72. The linear combination of gcd(10, 11) = 1
D. 77
can be written as
A. (-1)*10 + 1*11 78. What is the contrapositive of the condi-
B. (-2)*10 + 2*11 tional statement? “The home team misses
whenever it is drizzling?”
C. 1*10 + (-1)*11
A. If it is drizzling, then home team
D. (-1)*10 + 2*11 misses
73. P:It is raining Q:It is Cold then ‘If it is not B. If the home team misses, then it is driz-
raining then it is not cold’ will be repre- zling
sented by
C. If it is not drizzling, then the home
A. P → Q team does not misses
B. ∼ P →∼ Q D. If the home team wins, then it is not
C. ∼ P ↔ Q drizzling
D. ∼ P ∧ Q 79. Determine the inverse for the function:S
2
74. It helps visualize the consecutive actions (x) = 2x4 7
involved. 2x−4
A. S-1(x) = 7
A. Formula 4x+7
B. S-1(x) = 2
B. Tree Diagram √
C. S-1(x) = 4x+7
2
C. Permutation √
D. Combination D. S-1(x) = 2x+7
4

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 10

80. it will give a True result if and only if the 86. Coefficient of the homogeneous solution
value of both propositions is True (h)
an
A. Conjunction A. Expression representation in base con-
B. Disjunction dition

81. The operation of two propositions A B. Roots of characteristic equations

and B is true if both the propositional vari- C. Solving equations in specific solutions
able A and B is true. D. Coefficient of the homogeneous recur-

NARAYAN CHANGDER
A. OR sive relationship
B. AND
87. Order of Matrix A=
C. If then
D. If and only If

82. Which proposition has a truth value that

satisfies p → q in all cases?
A. Converse of p → q
B. Inverse of p → q
C. Contrapositive of p → q
D. Negate of p → q
A. 3x2
83. A graph which has no cycle is called an
B. Extend
A. Trees
C. 6
B. Acrylic Graph
D. 2x2
C. General Tree
D. Function 88. Is this a function?

84. A deductive argument is said to be valid if

and only if it takes a form that makes it
impossible for the premises to be true and
the conclusion nevertheless to be false.
A. Validity
B. Arguments
A. Yes
C. Fallacy
B. No
D. Predicate
89. Given the function f (x) = 5x − 6
85. To prove the statement of the form ∀x
f −1 (5)
P(x) to be false, what must be shown?
11
A. 6
A. There is x for which P(x) is false.
11
B. P(x) is false for all possible values of x. B. 5
10
C. P(x) is true for at least one x. C. 6
10
D. P(x) is true for all possible values of x. D. 5

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 11

90. How many words that can be formed with B. n2 nodes

the letters of the word ‘SWIMMING’ such
C. (k+n)-colorable
that the vowels do not come together? As-

PRACTICE BOOK» NOT FOR SALE

sume that words are of with or without D. (k3+n3+1) nodes
meaning.
A. 729 96. It is based upon continuous number line or
the real numbers. It is characterized by
B. 430 the fact that between any two numbers,
C. 1239 there are almost always an infinite set of
D. 623 numbers.
A. Continuous Mathematics
91. If A = {1, 2, 4}, B = {2, 4, 5}, C = {2, 5},
then (A-B) * (B-C) is B. Discrete Mathematics
A. (1, 4) C. Function
B. {(1, 4)} D. Quantifiers
C. {(1, 2), (1, 5), (2, 5)}
D. None of these. 97. Draw one card from a standard deck. Find
P(4 or club)
92. LetX = {2, 3, 6, 12, 24, 48} (X, |) is
A. 17/52
A. 3
B. 2/13
B. 4
C. 4/13
C. 5
D. 6 D. 1/26

93. Which of the following is a well-defined 98. P ↔ Q is true when P and Q are both true,
set? or both true.
A. A set of beautiful teachers A. True
B. A set of basketball players
B. False
C. A set of President of the Republic of
the Philippines 99. Does this graph have a Hamiltonian Cir-
D. A set of Class Honors cuit?

94. A graph G is called a if it is a connected

acyclic graph
A. Cyclic graph
B. Regular graph
C. Tree
D. Not a graph

95. If a graph G is k-colorable and k<n, for any

integer n then it is A. True
A. n-colorable B. False

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 12

100. How many students must be in a class to A. put n = 1

guarantee that at least two students re- B. put n =-1
ceive the same score on the final exam if
the exam is graded on a scale from 0 to C. put n = 0
100 points? D. none of these
A. 100
106. Given ↓
B. 99
A. x = x ↓ x

NARAYAN CHANGDER
C. 101
B. x + y = (x ↓ x) ↓ (y ↓ y)
D. 102
C. xy = (y ↓ y) ↓ (x ↓ x)
101. The inverse of 7 modulo 26 is? D. {↓}
A. 12
107. Counting problems that require separat-
B. 14 ing non-concurrent cases Which counting
C. 15 rule is used?
D. 20 A. Addition rules

102. If one card is drawn from a deck of 52 B. Multiplication rules

cards, what is the probability that it would C. Deletion rules
not be a queen?
D. Division rules
A. 1/13
108. ϕ
B. 4/13
A. {1, 2}
C. 6/13
D. 12/13 B. {1, 3, 4}
C. ϕ
103. The empty graph is also known as:
D. All of the above
A. Trivial graph
B. bipartite graph 109. A function in which the second element of
order pair is distinct is called:
C. regular graph
A. onto function
D. none of the above
B. one-one function
104. The number of binary operation on set {1,
C. identity function
2} is
D. inverse function
A. 8
B. 16 110. The function f : R+ → R+
f (x) = x3 , g : R+ → R+ , g(x) =
C. 2
x1/3 then ( f og)(x) =
D. 4
A. x3
105. n ≥ 113 + 23 + 33 + + n3 = [n(n + B. 1/x
1)/2]2 What would be the appropriate
first step in proving the above mathemat- C. x
ical induction? D. x

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 13

111. Calculate A × B C. Both P and Q

D. Neither P nor Q

PRACTICE BOOK» NOT FOR SALE

115. A Poset in which every pair of elements
has both a least upper bound and a great-
est lower bound is termed as
A. sublattice
A. B. lattice
C. trail
D. walk
B. 25
116. Which statement is true about prime num-
bers?
C. A. The smallest odd number that is a
prime number is 1.
B. All prime numbers are all odd.
C. All prime numbers must be in the form
of Mersenne numbers (2p-1).
D. D. If n has no prime divisor p, then p≤√n,
then n is a prime number.

117. The number of colours required to prop-

112. Permutation concerns itself with number erly colour the vertices of every planer
of graph is:
A. counting techniques A. 2
B. selections B. 3
C. arrangements C. 4
D. events D. 5

113. For any non empty sets Aand B if A ⊂ 118. Consider a complete bipartite graph km,
B then AB = n. For which values of m and n does this,
A. A complete graph have a Hamilton circuit?

B. B A. m=3, n=2

C. ϕ B. m=2, n=3

D. none C. m=n≥2
D. m=n≥3
114. Which of the following statements is/are
TR∪E for undirected graphs?P:Number of 119. Give the converse of the implication “If
odd degree vertices is even.Q:Sum of de- it is raining then I get wet”.
grees of all vertices is even. A. If I get wet, then it is raining
A. P only B. If I am not getting wet, then it is rain-
B. Q only ing

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 14

C. If I am not getting wet, then it is no- 125. The number of edges from the root to the
training node is called of the tree
D. If I get wet, then it isnot raining A. Height
120. “Parul is out for a trip or it is not snow- B. Depth
ing” and “It is snowing or Raju is playing C. Length
chess” imply that
D. Width
A. Parul is out for trip

NARAYAN CHANGDER
B. Raju is playing chess 126. What type of logic is this table showing:

C. Parul is out for a trip and Raju is play-

ing chess
D. Parul is out for a trip or Raju is playing
chess

121. Permutation, combination, or neither?

There are 45 applicants for three Computer
Programmer job positions.
A. combination
B. permutation
A. AND
C. neither
D. none of above B. OR
C. NOT
122. If 4 Maths books are selected from 6 dif-
ferent Maths books and 3 English books D. XOR
are chosen from 5 different English books,
127. Which property of real numbers justifies
how many ways can the seven books be
the work shown from Step 1 to Step 2?
arranged on a shelf?
A. None of these ways
B. 750000 ways
C. 756000 ways
D. 480000 ways
A. Distributive Property
123. How many relations are there on a set
B. Commutative Property
with 5 elements?
A. 25 C. Identity Property

B. 52 D. Associative Property
C. 225 128. De Morgan’s Law is
D. 5 A. ∼ (P∧ ∼ Q) =∼ P∧ ∼ Q
124. For Z as the domain ∃x(x3 > x2 ) B. ∼ (P∧ ∼ Q) =∼ P∨ ∼ Q
A. 0 C. ∼ (P ∧ Q) =∼ P ∨ ∼ Q
B. 1 D. ∼ (P ∧ Q) = P ∨ Q

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 15

129. How many ways can 6 policemen and 3 B. ∪niversal

sergeant puppets form a line? C. Existential

PRACTICE BOOK» NOT FOR SALE

A. 9! D. Nested
B. 12*(7!)
135. 19 The set of integers Z with the binary
C. 6! + 3! operation “*” defined as a*b =a +b+ 1 for
D. (3!)*(6!) a, b ∈ Z, is a group. The identity element
of this group is
130. The truth value ‘9 is prime then 3 is
even’. A. 0

A. False B. 1
C. -1
B. True
D. 12
131. Analysis of algorithm performance What
analysis will be done? (There may be mul- 136. Determine the inverse for the func-
tiple answers. Answer them all.) tion:Q(x) = 2x7
4
2x−4
A. Time complexity A. Q-1(x) = 7
B. Space complexity 4x+7
B. Q-1(x) = 2
C. Real complexity 7x2
C. Q-1(x) = 4
D. Process complexity D. Q-1(x) = 2x +4
7
132. Given that f is a function on the set of 137. In the poset (Z+, |) (where Z+ is the set
real numbers, where f(x) = 3x +2, which of all positive integers and | is the divides
is f-1? relation) are the integers 9 and 351 com-
A. f-1(x) = (x-2)/3 parable?
B. f-1(x) =-3x-2 A. comparable
C. f-1(x) = y/3-2 B. comparable but not determined
D. f-1(x) = 1/(3x+2) C. determined but not comparable
D. not comparable
133. Which is an example of disjoint sets?
Check ALL that applies. 138. ⌈− 14.52
2 ⌉
A. A={multiples of two} and B = {mul- A. -7
tiples of three}
B. − 363
50
B. C = {whole numbers} and D = {ra-
C. -8
tional numbers}
D. none of above
C. E = {even numbers} and F = {odd
numbers} 139. What is the cardinality of the set of odd
D. G = {multiples of five} and H = {mul- positive integers less than 10?
tiples of ten} A. 5
134. Which among the choices below is NOT a B. 10
quantifiers? C. 3
A. Inverse D. 20

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 16

140. If f(x)=3x+1 then its inverse is:

A. x-1
B. x +2
C. 1/3(x-1)
D. None of the above
A. (A ∪ B)-C
141. If in a for it to be complete it is neces- B. (A ∩ B)-C

NARAYAN CHANGDER
sary for switch A to be closed and either
C. (A-B) ∩ C
of switch B or C to be closed, then which
can be true? D. A ∩ B ∩ C
A. Switch A should in parallel with B and 146. What is the probability of flipping a coin
C is series to them and getting heads?
B. Switch A should be in series with a par- A. 1/2
allel circuit of B and C B. 1/3
C. All of the mentioned C. 1/4
D. None of the mentioned D. Never, Tails never fails.

142. To deduce new statements from the 147. There are six movie parts numbered from
statements whose truth 1 to 6. Find the number of ways in which
they be arranged so that part-1 and part-
A. Rule of Inference 3 are never together.
B. Rule of Law A. 876
C. Rule of Arguments B. 480

D. Rule of Investigation C. 654

D. 237
143. Is the Boolean algebra contains 9 ele-
ments? 148. What is the Boolean identity called De
Morgan’s Law? (There may be many an-
A. Yes swers. Answer all)
B. No A. xy = x + y
B. x + y = (x) (y)
144. What is the Range in the relation {(-2, 3),
{4, 5), (6, -5), (-2, 3)}? C. x + yz = (x + y) (x + z)
D. x (y + z) = xy + xz
A. {3, 5, -5, 3)
B. {-2, 5, -5, 3} 149. Which of the following is a path?

C. {3, 5, -5, -2}

D. None of the above

145. From the Venn diagram of the three sets

A, B, and C, which set is the shaded area?

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 17

A. 5-2-7-3-2-0-5 C. B ⊆ A
B. 1-6-0-5-2-7 D. A ̸⊂ B

PRACTICE BOOK» NOT FOR SALE

C. 0-6-1-5-7-2-5
155. Which of the following two sets are
D. 0-2-5-7-2-0 equal?
150. A is any declarative sentence which A. A = {1, 2} and B = {1}
is either true or false
B. A = {1, 2} and B = {1, 2, 3}
A. Predicate
C. A = {1, 2, 3} and B = {2, 1, 3}
B. Atomic
D. A = {1, 2, 4} and B = {1, 2, 3}
C. Statements
D. Domain 156. Number Theory is also known as

151. Compound propositions appear mediated A. Discrete Mathematics

by the presence of some kind of connec- B. Differential Calculus
tor, which can be opposition (or), addition
(and), or condition (if). In addition, nega- C. Higher Arithmetic
tive propositions, which include the word D. Automata
no, are considered compounds.
A. True 157. A letter is chosen at random from the
word “MILKTEA”. What is the probability
B. False that the letter chosen is a vowel?
152. A is a formula which is always true A. 5/7
for every value of its propositional vari-
B. 4/7
ables.
A. Predicate C. 3/7

B. Domain D. 2/7
C. Tautology 158. Consider x ∈ N where x is prime. Here,
D. Statements x is a set.

153. Identify the properties of functions. A. Empty

A. One to one B. Infinite

B. Onto C. Finite
C. Many to many D. Not a set
D. none of above
159. ....Condition of semigroup homomor-
154. Which of the following is true according phism should be
to the statement:A = the set of students A. f(x * x) = f(x * y)
at PLM living in Mandaluyong. B = the set
of students at PLM living in Bulacan B. f(x) = f(y)
A. A ⊆ B C. f(x) * f(y) = f(y)
B. A ⊆ B and B ⊆ A D. f(x * y) = f(x) * f(y)

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 18

160. This matrix shows the sales of the lo- A. Existential instantiation
cal fruit and vegetable store. How many
B. ∪niversal instantiation
Items were sold on Sunday?
C. Setting the mood
D. Removing Mode
E. ∪niversal generalization

A. 292

NARAYAN CHANGDER
165. Which statement is true about expecta-
B. 100 tion value?
C. 147 A. It is the average of the results when
D. 47 many experiments are performed.

161. How many words with seven letters are B. It is the result value that will be ob-
there that start with a vowel and end with tained from the first experiment.
an A? (Note that they do not have to be C. Occurs from the product of the value of
real words and letters can be repeated.) a random variable multiplied by the prob-
A. 45087902 ability of that random variable.
B. 64387659 D. is the mode of the result. When doing
C. 12765800 many experiments
D. 59406880
166. If A and B are sets and A� B= A ∩ B, then
162. A in a graph is a cycle that uses each
A. A.A = F
edge precisely once. If such a cycle ex-
ists, the graph is called Eulerian (also uni- B. B.B = F
cursal).
C. A = B
A. Hamiltonian Path
D. none of these
B. Hamiltonian Cycle
C. Eulerian Path 167. Which of the following relations is a one-
D. Eulerian Cycle to-one function?
8!
163. Evaluate 4! A.
A. 2
B. 24
C. 1, 680 B.
D. 40, 320

164. Assumption:All MC students must study

Discrete Mathematics and Kanokwan is a C.
MC student. Conclusion:Kanokwan must
study Discrete Mathematics. What rules
are used to draw this conclusion? (There D.
may be multiple answers. Choose all.)

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 19

168. are the complex numbers that can be 173. Consider the statement, “At least one of
written in the form of the product of a real your friends is perfect”. Let P (x) be “x is
number and the imaginary unit i. perfect” and let F (x) be “x is your friend”

PRACTICE BOOK» NOT FOR SALE

and let the domain be all people.Then the
A. Rational Numbers
symbolic form of the statement is
B. Irrational Numbers A. ∀x (F (x) → P (x))
C. Complex Numbers B. ∀x (F (x) ∧ P (x))
D. Imaginary Numbers C. ∃x (F (x) ∧ P (x))
D. ∃x (F (x) → P (x))
169. A is a formula which is always false
for every value of its propositional vari- 174. In the poset (Z + , |)
ables. A. 5, 7
A. Predicates B. 1, 4
B. Domain C. 2, 5
C. Tautology D. 13, 5
D. Contradiction 175. Function f is defined byf(x) =-2 x 2 + 6
x-3 find f(-2)
170. are used so that the program itself
A. 10
can decide what to do in a certain situa-
tion. B. 23

A. Flowchart C. -23
D. -10
B. Variables
C. Data Types 176. How many edges are there in the graph?

D. Conditional Statements

171. If N objects are placed into k boxes, then

there is at least one box containing N/k
objects.
A. Factorial Notation
B. Permutation
C. Combination
D. Counting A. 7
B. 5
172. The next number in the sequence 2, 3, 5, C. 6
7, 11, 13, 17, is:
D. 8
A. 18
177. ∀x (P (x) ∨ Q (x)) =⇒ ∀xP (x) ∨
B. 21 ∃xQ (x)
C. 25 A. True
D. none of the above B. False

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 20

178. Which item has the most value? / ∈ {0}

184. {0} /
A. 7810 A. true
B. 1168 B. false
C. 10011112
185. Find the number of non-negativeinteger
D. 4e16 solutions of the equation x1 + x2 + x3 =
12
179. f (n) = 2n2 + 3n + 4
A. 91

NARAYAN CHANGDER
A. Na
B. 30
B. n logn
C. 65
C. Yes
D. n D. 44

E. that 186. Which statements are correct?

180. Which are methods to find the greatest A. Sample space is a subset of Event.
common divisor of the positive number a B. The ratio of the event size to the sam-
and b ple space size is the probability.
A. Checking with the prime less than C. The probability has a maximum value
square root of a*b equal to the size of the sample space.
B. ∪sing the prime factorization of a and D. The minimum probability is 0.
b
187. What is your name?
C. ∪sing the repeat of Euclidean division
as gcd(a, b) = gcd(b, r) A. Proposition
D. ∪sing the decimal expansion of a and B. Not a proposition
b
188. Which of the given statement is correct?
181. p → q A. Functions cannot be defined recur-
A. ∼ q → p sively
B. ∼ p → q B. Sets cannot be defined recursively
C. ∼ p ∧ q C. A recursive definition has one
D. ∼ p ∨ q part:Base
D. The process of defining an object in
182. The compound statement A v ∼(A ∧ B).
terms of smaller versions of itself is called
A. True recursion
B. False
189. Given the set of letters in the word
183. A declarative sentence which is either “mathematics”, what is the cardinality of
true or false is called? the given set?
A. Single statement A. 11
B. formal proposition B. 8
C. proposition C. 6
D. simple statement D. 4

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 21

190. In complexity theory, which case does 195. An argument is if the conclusion is not
NOT exist? true when all the premises are true:
A. invalid

PRACTICE BOOK» NOT FOR SALE

A. Worst Case
B. Best Case B. False
C. valid
C. Null Case
D. None of the above
D. Average Case
196. Which is a valid conclusion for If I run
191. A in a graph G is a circuit which con- in the morning then I feel energizedIf I am
sists of every vertex (except first/last energized then I have a great day
vertex) of G exactly once. A. If I am energized then I have a great
A. Euler path day

B. Hamiltonian path B. I have a great day

C. I am energized
C. Planar graph
D. If I run in the morning then I have a
D. Path complement graph great day
192. A bag contains 8 red marbles and 7 green 197. The following K-map represents a re-
marbles. What is the probability of get- duced form of Boolean function.
ting a green ball?
A. 1/7
B. 1/8
C. 7/15
D. 8/15 A. f (x, y, z) = yz + yz
193. The of the conditional statement is B. f (x, y, z) = x
computed by interchanging the hypothesis C. f (x, y, z) = x + yz + yz + yz + yz
and the conclusion. D. f (x, y, z) = yz + yz + yz + yz
A. converse 198. Which is the characteristic equation of
B. contrapositive an = an−1 + 3an−3
C. self-dual A. x3 + x2 + 3 = 0
B. x3 − x2 − 3 = 0
D. inverse
C. x2 − x − 3 = 0
194. are known as counting numbers that D. 3x3 + x + 1 = 0
contain the positive integers from 1 to in-
finity. It is denoted by the symbol N. 199. Positive integers that is greater than 1
and is not prime are called
A. Whole Numbers
A. Composite
B. Natural Numbers B. Prime
C. Real Numbers C. Even
D. Integers D. Odd

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 22

200. p, p −→ q, q −→ r C. Complex Numbers

A. p D. Imaginary Numbers
B. r 207. Consider the set N* of finite sequences of
C. q natural numbers with a denoting that se-
D. none of the above quence a is a prefix of sequence b. Then,
which of the following is true?
201. The largest integer that divides both of A. Every non-empty subset of has a great-

NARAYAN CHANGDER
two integers is called the est lower bound
A. Greatest Common Divisor B. It is uncountable
B. Least Common Multiple C. Every non-empty finite subset of has a
C. Least Common Denominator least upper bound
D. Greatest Common Denominator D. Every non-empty subset of has a least
upper bound
202. Each object in a set is called
208. Which of the following is true according
A. Set
to the statement:A = the set of birds. B =
B. Element the set of living creatures that can fly
C. Function A. A ̸⊂ B
D. Subject B. A ⊆ B and B ⊆ A

203. {x} ⊆ {x} C. B ⊆ A

A. true D. A ⊆ B

B. false 209. In an undirected graph the number of

nodes with odd degree must be
204. Which is the name of the algorithm?
A. Zero
A. Sorting
B. Odd
B. Divide and Conquer
C. Prime
C. Euclid division
D. Even
D. Dynamic memory
210. Discrete mathematics is an excellent tool
205. A graph is tree if and only if for ?
A. It is planar A. Problem solving and reasoning
B. It contains a circuit B. Demonstration
C. It is minimally connected C. Role play
D. It is completely connected D. Analogy
206. The number that cannot be expressed as 211. A compound proposition that is neither
the ratio of one over another is known as a tautology nor a contradiction is called a
It is denoted by P.
A. Rational Numbers A. Contingency
B. Irrational Numbers B. Equivalence

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 23

C. Condition 216. The compliment of the set S is (Where ∪

D. Inference is an ∪niversal set and A is any set)

PRACTICE BOOK» NOT FOR SALE

212. Determine if the relations is a function A. S-A
and describe the pattern B. ∪-S
C. S-∪
D. A-S

217. Domain of a function is:

A. it is set of natural numbers for which
a function is defined
B. the maximal set of numbers for which
A. Yes it is a function, input goes up 1 and a function is defined
output goes up by 15 C. the maximal set of numbers from
B. Yes it is a function, input goes up 15 which a function can take values
and output goes up by 1 D. none of above
C. Not a function, input goes up 1 and out-
put goes up by 15 218. The proposition (x ∧ (∼y)) ∨∼(x ∨ y)
D. Not a function, input goes up by 15 and can be transformed into a Boolean alge-
output goes up by 1 braic statement as

213. What is regular graph? A. xy + (x + y)

A. Vertices have different degree B. (x + y) (xy)
B. Many vertices have same degree C. xy + (x + y)
C. Every vertex of a simple graph has the D. (1 × 0) + (1 + 0)
different degree ( )
E. (1 + 0) 1 × 0
D. Every vertex of a simple graph has the
same degree
219. what is equivalence relation
214. Length of the walk of a graph is
A. reflexive, antisymmetric, transitive
A. The number of vertices in walk W
B. reflexive, symmetric, transitive
B. The number of edges in walk W
C. reflexive, asymmetric, transitive
C. Total number of edges in a graph
D. Total number of vertices in a graph D. reflexive, antisymmetric, symmetric

215. Which of the following are the set of ra- 220. Boolean algebra can be used
tional numbers?
A. For designing of the digital computers
A. {1/2, 1/3, 1/4, 1/5}
B. {0, 1, 2, 3, 4, 5} B. In building logic symbols

C. {-3, -2, -1, 0, 1, } C. Circuit theory

D. {a, b, c, d, e} D. Building algebraic functions

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 24

221. From the hypothesis:If I get a good vac- C. 3

cine I will have immunity, and if I have im- D. 5
munity, I will not contract the disease. By
the analogy rule from the previous ques- 226. What is 4 factorial equal to?
tion. What will be the conclusion?
A. 42
A. If I get a good vaccine, I don’t get the
disease. B. 24

B. If I get a good vaccine, I will get the C. 22

NARAYAN CHANGDER
disease. D. 6
C. I have no immunity But I’m not in-
227. A proof broken into distinct cases, where
fected.
these cases cover all prospects, such
D. I have had good vaccinations and I am proofs are known as
not infected.
A. Direct proof
222. For a 3-variable K-map, what is the or- B. Contrapositive proofs
der of the variables along the columns?
C. Vacuous proof
A. x, x
D. Proof by cases
B. yz, y z, y z, y z
228. What would the chromatic number be for
C. yz, y z, y z, y z
this figure?
D. xy, yx, y x, y x

223. How many properties can be held by a

group?
A. 5
B. 4
C. 2
D. 6
A. 1
224. Object/s in a set
B. 2
A. Element
C. 3
B. Member
D. 4
C. A person
D. A thing 229. Which pair is a logical symbol change? is
a valid Boolean algebraic symbol. (There
225. Let G be a simple undirected planar graph may be multiple answers. Answer them
on 10 vertices with 15 edges. If G is a con- all.)
nected graph, then the number of bounded
A. ∼ x ⇐⇒ x
faces in any embedding of G on the plane
is equal to B. x ∧ y ⇐⇒ x + y
A. 7 C. (x −→ y ) ⇐⇒ xy
B. 6 D. 1 ⇐⇒ True

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 25

230. C(n, 0) + C(n, 1) + C(n, 2) + + C(n, n) 236. Which statement is useful for finding x, y
= that h = ax + by
A. 2n

PRACTICE BOOK» NOT FOR SALE

A. d = a-bc
B. n2 B. 0 = f-hj
C. n ! C. f = b-the
D. nn D. h = d-fg

231. Which of the following two sets are dis- 237. A is an arrangement of objects in
joint? a definite order and a mathematical tech-
A. {1, 3, 5} and {1, 3, 6} nique that determines the possible ar-
rangements in a set when the order of ar-
B. {1, 2, 3} and {1, 2, 3} rangement matters.
C. {1, 3, 5} and {2, 3, 4} A. Factorial Notation
D. {1, 3, 5} and {2, 4, 6} B. Permutation
232. Let a be an integer and d a positive inte- C. Combination
ger. Then there are unique integers such q D. Counting
and r with 0 ≤ r < d, such that a = dq + r.
238. What is a full binary tree?
A. Division Algorithm
A. Each node has exactly zero or two chil-
B. divisibility
dren
C. Parity
B. Each node has exactly two children
D. Positivity
C. All the leaves are at the same level
233. In which of the following problems recur- D. Each node has exactly one or two chil-
rence relation holds? dren
A. Optimal substructure 239. It is the set of all items under considera-
B. Tower of Hanoi tion for a particular problem or situation.
C. Hallmark substitution A. Set
D. Longest common subsequence B. ∪niverse
234. Let P:I am in Bangalore.; Q:I love cricket.; C. Power Set
then q → p(q implies p) is? D. Subset
A. If I love cricket then I am in Bangalore 240. Which of the following set of values
B. If I am in Bangalore then I love cricket would correctly complete this table?
C. I am not in Bangalore
D. I love cricket
235. What is f (0) f (x) = 2x + 3
A. X A. T F F
B. -3 B. T T F F
C. 3 C. T T T F
D. 10 D. F T F T

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 26

241. Let domain of m includes all students, P C. implies

(m) be the statement “m spends more than D. negation
2 hours in playing polo”. Express ∀m ¬P
(m) quantification in English. 246. A is an ordered collection of objects.
A. A student is there who spends more A. Relation
than 2 hours in playing polo B. Function
B. There is a student who does not spend C. Set
more than 2 hours in playing polo

NARAYAN CHANGDER
D. Proposition
C. All students spends more than 2 hours
in playing polo 247. The shaded area of figure is best de-
D. No student spends more than 2 hours scribed by?
in playing polo

242. are used when you need two or more

conditions in a certain statement.
A. Logical Operators
B. Arithmetic Operators
C. Special Logical Operators A. A ∩ B
D. Concatenation Operator B. A ∪ B
243. The absolutely key observation here is C. B-A
that which the molecular statement D. A-B
achieves is completely determined by the
type of connective and the truth values of 248. The statement, “At least one of your
the parts. friends is perfect”. Let P (x) be “x is per-
fect” and let F (x) be “x is your friend”
A. connectives
and let the domain be all people.
B. truth value
A. ∀x (F (x) → P (x))
C. atomic
B. ∃x (F (x) ∧ P (x))
D. molecular
C. ∃x (F (x) → P (x))
244. What is the sum of the first 10 terms D. ∀x (F (x) ∧ P (x))
for the following geometric series:2-6+18-
54+ 249. P −→ (Q −→ R)
A. 59048 A. (P ∧ Q) −→ R
B. -29524 B. (P ∨ Q) −→ R
C. 524288 C. ((P ∧ Q) −→∼ R)
D. 3069 D. None of the above

245. P ∧ Q is read “P and Q, “ and called a 250. In preorder traversal of a binary tree the
second step is
A. conjunction A. traverse the right subtree
B. disjunction B. traverse the left subtree

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 27

C. traverse right subtree and visit the 255. Describe the pattern of inputs and out-
root puts

PRACTICE BOOK» NOT FOR SALE

D. visit the root

251. The letters that form the word ALGEBRA

are placed in a bowl. What is the probabil-
ity of choosing a letter other than “A”?
A. 2/7
B. 5/49
C. 5/7
D. 10/49 A. The x and y move by 1
252. The of � is the n x m matrix obtained B. The x moves right by 2 and the y stays
by interchanging rows and columns of A. the same

A. Identity Matrix C. The x does not move and the y does not
move
B. Transpose Matrices
D. The x moves down by 1 and y moves up
C. Determinant
256. The truth or falsehood of a proposition.
D. Zero Matrix
A. Truth Value
253. A total of 1232 students have taken a B. Connectives
course in Spanish, 879 have taken a course
C. Proportions
in French and 114 have taken a course in
Russian. Further, 103 have taken a course D. Disconjunction
in Spanish and Russian, 23 have taken a
257. Which of the following does belong under
course in Spanish and French and 14 have
Combinatorics?
taken a course in French and Russian. If
2092 students have taken at least one of A. Fundamental Counting Principle
Spanish, French and Russian, how many B. Combination
students have taken a course in all 3 lan-
C. Permutation
guages?
D. Binomial Expansion Theorem
A. 8
B. 107 / ⊂ {{0},
258. {{0}} / {0}}
/

C. 108 A. true
B. false
D. 7
259. The number of edges in a regular graph
254. ⌈3.2⌉ + ⌊5⌋ − ⌈−2.9⌉ of degree 46 and 8 vertices is
A. 7 A. 347
B. 6 B. 230
C. 12 C. 184
D. 11 D. 186

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 28

260. It is used to represent the subsets of the C. What is the time now?
universe, i.e., sets that exist within the D. The only odd prime number is 2
universe.
A. Circle 265. It is a ST∪DY of discrete objects.
B. Rectangle A. Science
C. Square B. Mathematics
D. Oval C. Information Technology

NARAYAN CHANGDER
D. Discrete Mathematics
261. if f (x) =
cos x and g (x) = x3 , then ( f , g) (x) is 266. From a club consisting of 6 men and 7
A. (cos x)3 women, in howmany ways can we select
a committee of 3 men and 4 women?
B. cos 3 x
x)3
A. 566
C. x (cos
B. 700
D. cos x3
C. 650
262. The following K-map represents a re- D. 345
duced form of a Boolean function.
267. is defined as the smallest multiple
that two or more numbers have in com-
mon.
A. Greatest Common Divisor
B. Least Common Multiple
C. Least Common Denominator
D. Greatest Common Denominator
A. f (x, y, z) = xz + wxz
B. f (x, y, z) = wy + wxy 268. Given p and q are logical variables that
both have a truth value of True, which
C. f (x, y, z) = wxyz + wxz + wxyz proposition has a truth value of False?
D. f (x, y) = wx + xw + yz + yz + wx + A. p ∧
wx
B. p V q
263. g(x)= 3x+2 then gog(x): C. p → q
A. sh+h D. p � q
B. jah+8
269. What is the algorithm for sorting data?
C. zks-2 There is a worst-case running time that is
D. None of the above best.

264. Which of the following statement is a A. Merge Sort

proposition? B. Insertion Sort
A. Get me a glass of milkshake C. Selection Sort
B. God bless you! D. Bubble Sort

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 29

270. P(5) is the statement “3 5 + 1 is even”, C. ∃x (F (x) ∧ P (x))

which is true. Thus the statement ∃xP(x) D. ∃x (F (x) → P (x))
is

PRACTICE BOOK» NOT FOR SALE

A. True 275. An integer n is if, and only if, n is
equals twice some integer plus 1.
B. False
A. Composite
271. How many unique ways can you flip a
B. Prime
coin, roll a die, and spin a five-sectioned
spinner? C. Even
A. 3 D. Odd
B. 13 276. subtraction is not binary on
C. 30
A. Z
D. 60
B. N
272. Which of the following can only be used C. W
in disproving the statements?
D. Both b and c
A. Direct proof
B. Contrapositive proofs 277. Nicole has four different skirts, three
different blouses and two pairs of shoes
C. Counter Example which she can wear for a business meet-
D. Mathematical Induction ing. In how many ways can Nicole dress
for the meeting?
273. List the ordered pairs
A. 9
B. 12
C. 18
D. 24

278. The sum of the terms of the arithmetic

progression.
A. Arithmetic Series
B. Geometric Series
A. Input and Output
C. Arithmetic Progression
B. (0, 12), (2, 10), (4, 8), (6, 6)
D. Geometric Progression
C. (12, 0), (10, 2), (8, 4), (6, 6)
D. (6, 6) 279. Any number that can be written as a ra-
tio of one number over another number is
274. The statement, “At least one of your called a It is written as Q.
friends is perfect”. Let P (x) be “x is per-
A. Rational Numbers
fect” and let F (x) be “x is your friend”
and let the domain be all people. B. Irrational Numbers
A. ∀x (F (x) → P (x)) C. Complex Numbers
B. ∀x (F (x) ∧ P (x)) D. Imaginary Numbers

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 30

280. What is a proposition? A. {20, 30}

A. An invariable word used to establish a B. {10, 50, 65}
dependency relationship between two or
more words. C. {10, 50, 65, 60, 70, 75, 85, 90}
B. It is a statement with complete mean- D. {20, 30, 60, 70, 75, 85, 90}
ing and constitutes the most elementary
form of logic. 285. Find a counterexample of ∀x∀y(xy > y),
where the domain for all variables consists
C. It is a resinous mixture obtained by

NARAYAN CHANGDER
of all integers.
bees from tree buds.
D. None of the above. A. x =-1, y = 17

281. If P = {0, 1, 2, 3, 4}, Q = {4, 5, 6, 7}R = B. x =-2 y = 8

{3, 6, 9}, and S = {6, 12, 18}Then what is C. Both x =-1, y = 17 and x =-2 y = 8
(P � Q) ∩ (S � R)?
D. Does not have any counter example
A. {6}
B. {3, 6} 286. Which set of truth values would correctly
C. {4, 6} complete this table?
D. {1, 2, 3, 4, 5, 6, 7, 9, 12, 18}
282. (P −→ Q) ←→ (∼ P ∨ Q) is a
A. Contradiction
B. Tautology
C. inconsistent A. T F T F
D. none of the above B. F T T T

283. Which of the following is true according C. F F T T

to the statement:A = the set of Filipino bas- D. F F F T
ketball players playing in Japan League. B
= the set of Filipinos 287. Boolean algebra can be used
A. A ̸⊂ B
A. Circuit theory
B. A ⊆ B and B ⊆ A
B. For designing of the digital computers
C. B ⊆ A
C. In building logic symbols
D. A ⊆ B
D. Building algebraic functions
284. What is the complement of B union C, (B
∪ C)’? 288. Which Boolean Identities law proof
A+A=A?
A. Idempotent Law
B. Complement Law
C. Double Complement Law
D. Identity Law

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 31

289. A method that allows a programmer to 293. A statement with all true values is called
represent the algorithm in a diagram or an A. Inconsistent
illustration

PRACTICE BOOK» NOT FOR SALE

B. Consistent
A. Flowchart
C. Tautology
B. Variables
D. Negation
C. Data Types
294. Edge Type:∪nordered pair of vertices
D. Conditional Statements
A. Multiple Edges
290. What is Complete graph? B. Directed
A. There exit a path between every pair C. ∪ndirected
of vertices D. Loop
B. There exit a cycle between every pair
of vertices 295. Given a number of variables, the prod-
ucts in which each variable or its negation,
C. There exit an edge between every pair but not both, occurs only once is called
of vertices
A. disjunctive normal form
D. None of the above
B. conjunctive normal form
291. Which of the above graphs is/are NOT C. min terms
planar? D. max terms

296. The truth value ‘If 9 is prime then 3 is

even’
A. false
B. true
C. NEITHERE TR∪E NOR FALSE
D. NONE OF THESE
A. G1 297. Determine the characteristics of the rela-
B. G2 tion aRb if a2 = b2.

C. Ms A. Transitive and symmetric

B. Reflexive and asymmetry
D. Gch
C. Reflexive, antisymmetric, and irreflex-
292. What is degree of the vertex? ive
A. The number of edges incident at the D. Symmetric, Reflexive, and transitive
vertex
298. What assumption would you make to
B. The number of vertices incident at the start the indirect proof of:there can be only
vertex one 90 angle in a triangle
C. The number of edges not incident at A. there can be more than one 90 angle
the vertex in a triangle
D. None of the above B. <a+<b+<c=180

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 32

C. <a+<b+<c≠180 304. The members of the set S = {x | x is the

D. all the angles in a triangle add up to square of an integer and x < 100} is
180. A. {0, 2, 4, 5, 9, 58, 49, 56, 99, 12}
299. The ordinary enumerator of the selection B. {0, 1, 4, 9, 16, 25, 36, 49, 64, 81}
of r objects out of n objects with unlimited C. {1, 4, 9, 16, 25, 36, 64, 81, 85, 99}
repetition is
D. {0, 1, 4, 9, 16, 25, 36, 49, 64, 121}
A. C( n + r-1, r)

NARAYAN CHANGDER
B. C(n, r) 305. Data Structure:Preorder and in order of a
C. P(n, r) tree is given by Preorder ABDHEC
F I G J K Inorder DHBEAIFCJGK
D. S (n, r) What will be the postorder?
300. All the positive and negative integers, A. H D E B I F J K G C A
fractional and decimal numbers without
B. H D E B F I J K G C A
imaginary numbers are called It is rep-
resented by the symbol R. C. H D E B I F J K C G A
A. Whole Numbers D. None
B. Natural Numbers
306. Find the first four terms of the se-
C. Real Numbers quence.an= 2a(n-1) + n where a0= 0
D. Integers A. 0, 0, 0, 0
301. Which graph has the most connecting B. 0, 1, 4, 11
lines?
C. 0, 1, 2, 4
A. Cough
D. 0, 2, 4, 8
B. Number
C. Kz, h 307. If the statement is “If p, then q”, the in-
D. Wah verse will be “If not p, then not q”.
A. p→q is ¬p→¬q
302. Which of the following satisfies commu-
tative law? B. q→p is q→p.
A. ∧ C. p→q is ¬p→¬q
B. ↔ D. p→q is p→¬q
C. v
308. How many relations are there on a set
D. All of the mentioned with n elements that are symmetric and a
set with n elements that are reflexive and
303. An isomorphism of a group onto itself is
symmetric?
called
A. homomorphism A. That(n+1)/a when that.about(n-1)/a

B. heteromorphism B. About(n-1)/a when(n-1)

C. epimorphism C. That(n+1)/a when about(n-1)/a
D. automorphism D. that(n+1)/a when(n-1)/a

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 33

309. Let P, Q, R be true, false true, respec-

tively, which of the following is true?

PRACTICE BOOK» NOT FOR SALE

A. P∧Q∧R

B. P∧∼Q∧∼R

C. Q→(P∧R)

D. P→(Q∧R)

310. When four coins are tossed simultane-

ously, in number of the outcomes at
most two of the coins will turn up as
heads. A. True
B. False
A. 17
314. A value is represented by a Boolean
B. 28
expression.
C. 11 A. Positive

D. 43 B. Negative
C. Boolean
311. The number that can be written in the D. Recursive
form of a+bi where “a and b” are the real
315. Let P:I am in Bangalore.; Q:I love cricket.;
number and i is an imaginary number is
then q → p(q implies p) is?
known as It is written as C.
A. If I love cricket then I am in Bangalore
A. Rational Numbers
B. If I am in Bangalore then I love cricket
B. Irrational Numbers C. I am not in Bangalore

C. Complex Numbers D. I love cricket

316. Which of the following is true?

D. Imaginary Numbers
A. Prim’s algorithm can also be used for
disconnected graphs
312. Which is not a proposition?
B. Kruskal’s algorithm can also run on the
A. It’s raining this morning. disconnected graphs

B. Everyone in this room Have an ID card C. Prim’s algorithm is simpler than

Kruskal’s algorithm
C. Read the questions and options slowly. D. In Kruskal’s sort edges are added to
MST in decreasing order of their weights
D. 8 + 7 = 10
317. Which sentence is a proof of statement?
313. ∪se the logic condition to find the value If a|b and a|b+c then a|c is perfect.
of W:not A or B or C A. There is k1 ∈� such that b + c = k1a.

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 34

B. Since (k2 + k1) ∈�, then a|c 323. What type of distribution has the same
C. There is k2 ∈� such that b = k2a. probability of occurrence of various out-
comes in the sample space?
D. Since (k2-k1) ∈� then a|c
A. uniform
E. By the law of transmission, we have
that a|c B. normal
C. Gaussian
318. The is the length of the path from it
to the root. D. Binomial

NARAYAN CHANGDER
A. Binary Tree 324. 0/ ∈ {x}
B. Height of Tree A. true
C. Depth of Tree B. false
D. Size of Tree
325. is used to find all primes not exceed-
319. What is the value of S.P.S of term a3a4 ing a specified positive integer.
in (a+b)7? A. Trees
A. C(7, 4) B. The Sieve of Eratosthenes
B. C(4, 3) C. Division Algorithm
C. C(7, 2) D. Long Division
D. C(3, 4)
326. In a finite state machine, m =
320. A is an acrylic directed graph. It has (Q, Σ, δ , q0, F) δ
one node with indegree 1, while all the
A. Q → Σ xQ
other nodes have indegree 1.
B. Qx Σ → Q
A. Directed Trees
C. Q → F
B. Ordered Trees
D. Qx q0 → Σ
C. Rooted Trees
D. General Trees 327. Combination concerns itself with the num-
ber of
321. Truth Value of the Conjunction is.
A. counting techniques
A. p ∧ q
B. selections
B. p v q
C. arrangements
322. For all positive integers n which is more D. events
than 1, which statements are TR∪E?
A. It can be written as the product of 328. Is the following graph connected or dis-
primes if it is not prime. connected? Explain why or why not.
B. It can be more than one set of the prod-
uct of primes if it is a composite number.
C. Each prime included in the product is
less than the square root of n.
D. You can check whether n is prime by
dividing it with the square root of n

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 35

A. Connected because all vertices are 332. If I roll a dice, what is likelihood that I
even. will land on a 3?

PRACTICE BOOK» NOT FOR SALE

B. Connected because one can get from
one vertex to every other vertex on the
graph
C. Disconnected because all vertices are
even
D. Disconnected because one can NOT
get from one vertex to every other vertex. A. 3 out of 6

329. Determine if the relation is a function B. 1 out of 8

C. 1 out of 6
D. 5 out of 7
333. is a square matrix in which all the el-
ements of principal diagonals are one, and
all other elements are zeros.
A. Identity Matrix
B. Transpose Matrices
C. Determinant
A. Yes, each input has one output D. Zero Matrix
B. Yes, each output has one input 334. What is the definition of function?
C. No, because the pattern is 4 A. Every input has only ONE output
D. No, each input is the same as the out- B. Has inputs and outputs
put C. Inputs have different outputs every
330. The statement, “ Every comedian is time
funny” where C(x) is “x is a comedian” D. x-values and y-values
and F (x) is “x is funny” and the domain
335. which of the following are equal set
consists of all people.
A. ϕ
A. ∃x(C(x) ∧ F (x))
B. {ϕ }
B. ∀x(C(x) ∧ F (x))
C. {0}
C. ∃x(C(x) → F (x))
D. {}
D. ∀x(C(x) → F (x))
336. Find the number of ways in which 4 peo-
331. If a statement contain ‘n’ variables then ple E, F, G, H, A, C can be seated at a round
the number of entries in the truth table will table, such that E and F must always sit to-
be calculated by the formula gether.
A. 2n A. 32
B. 2n − 1 B. 290
C. 2(n−1) C. 124
D. 2(n+1) D. 48

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 36

337. The shaded area of figure is best de- 341. Which of the following is true according
scribed by? to the statement:A = the set of people who
can speak Tagalog. B = the set of people
who can speak Tagalog with a Batangas
accent.
A. A ̸⊂ B
B. A ⊆ B and B ⊆ A

NARAYAN CHANGDER
C. A ⊆ B
A. A‘ (Complement of A)
D. B ⊆ A
B. A ∪ B-(A ∩ B)
C. A-B 342. What is the method for presenting
D. B graphs in a computer?
A. Adjacency matrix
338. “Close the door.”
B. Symmetry matrix
C. Edge list
D. Adjacency list
E. Distance matrix

343. From the hypothesis:All KM∪TNB stu-

dents study English and Asawin is a
KM∪TNB student. What law of infer-
ence must be used to draw conclusions and
what conclusions can be drawn?
A. Proposition
A. ∪niversal instantiation:Knight studies
B. Not proposition English.
339. “A snail can sleep for three years.” B. ∪niversal generalization:Knight stud-
ies English.
C. Existential instantiation:There are
KM∪TNB students who study English.
D. Existential generalization:There are
KM∪TNB students who study English.

344. Which of the following is true according

A. Proposition to the statement:A = the set of fruits. B =
the set of citrus fruit
B. Not proposition
A. A ̸⊂ B
340. Decide whether each of the statement be-
low are true or false.”4 | 20” B. A ⊆ B and B ⊆ A
A. True C. A ⊆ B
B. False D. B ⊆ A

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 37

345. The set operation that brings together all B. Solving the Diophantine equation (d =
of the elements of both sets whether those ax + by)
elements are in one or both of the sets.

PRACTICE BOOK» NOT FOR SALE

C. Converting base 10 numbers to other
A. Complementation bases
B. Difference D. Prime Number Test
C. ∪nion E. Converting other base numbers to
D. Intersection base 10

346. choose the law of hypothetical syllogism 351. Which is the type of this graph?
A. p −→ q, r A. Connected Graph
B. (p −→ q) ←→ r B. Digraph
C. (p ∨ q) −→ r, p −→ r C. Cycle
D. (p −→ q) ∧ (q −→ r) =⇒ D. 2-regular graph
(p −→ r)
E. weighted graph
347. Which of the following is not a function?
352. If the functions g and f are onto functions,
A. {(0, 1), (1, 2), (2, 3), (3, 4)}
then the function (gof) is function:
B. {(0, 2), (1, 3), (4, 3), (1, 2)}
A. onto
C. {(1, 3), (4, 2), (2, 0), (3, 4)}
B. one to one
D. {(1, 2), (2, 2), (3, 2), (4, 2)}
C. one-to-many
348. Boolean algebra can be used
D. Into
A. For designing of the digital computers
B. Circuit theory 353. The probability of first success in the kth
Bernoulli experiment can be calculated by
C. Building algebraic functions What is the probability of the distribution?
D. In building logic symbols A. Binomial
349. From the hypothesis:“If I get a good vac- B. Poisson
cine I will be immune” and “If I am im-
C. Hypergeometric
mune I don’t have a disease.” Which rule
of thumb should be used? in finding con- D. Geometric
clusions
354. There are n/d ways to do a task if it can
A. Elimination be done using a procedure that can be car-
B. Hypothetical syllogism ried out in n ways, and for every way w,
C. Setting Mode exactly d of the n ways correspond to way
w.
D. Removing Mode
A. Product Rule
350. In what problems can the Euclidean divi-
B. Sum Rule
sion algorithm be used? (There may be
multiple answers. Answer them all.) C. Subtraction Rule
A. Finding the Greatest Common Divisor D. Division Rule

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 38

355. When is the quantity statement 360. If eight colours are used to paint 65 bicy-
∀x∃y[P(x, y)] false? cles, then at least how many bicycles will
A. Every x has a y such that P(x, y) is false. be the same colour.

B. There is x such that every y P(x, y) is A. 10

false. B. 9
C. There are x and y such that P(x, y) is C. 7
false. D. 11

NARAYAN CHANGDER
D. Every x and any y P(x, y) is false.
361. Adjoining figure shows a relationship be-
356. What is the survival rate of newborns? tween the set A and B. Write this relation
in the roster form. What is its domain and
range?

A. 0.28
B. 0.2
C. 0.8
D. 0.1

357. Which is the idempotent elements in the

A. R = {(4, 2) (5, 3) (6, 4)}Domain {1, 2,
set {1, -1, i, -i}?
3}Range {4, 5, 6}
A. 1
B. R = {(4, 2) (5, 3) (6, 4)}Domain {4, 5,
B. -1 6}Range {2, 3, 4}
C. i C. R = {(4, 2) (5, 3) (6, 4)}Domain {2, 3,
D. -i 4}Range {4, 5, 6}
D. none of above
358. How many 5-letter arrangements can be
made from the letters of the word LOGA- 362. Which statement is true about Euler path
RITHM? and Euler circuit?
A. 15, 120 A. A graph has an Euler circuit if every
B. 462 vertex has an even degree.
C. 55 B. A graph has an Euler path if it has an
odd number of vertices with an even num-
D. 181, 440 ber of degrees.
359. Property of a Relation:A relation R is C. An Euler path in a graph must start and
called if (a, a)∈R for every element end at odd degree vertices.
a∈A. D. A graph without Euler circuits and Eu-
A. Reflexive ler paths is a graph in which every vertex
B. Irreflexive has an odd degree.

C. Symmetric 363. If x ∈ N and x is prime, then x is set.

D. Antisymmetric A. Infinite Set

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 39

B. Finite Set 368. “Man is Mortal”, it returns truth value “

C. Empty Set A. True

PRACTICE BOOK» NOT FOR SALE

D. None of the above B. False
364. Let the statement be “If n is not an odd 369. Determine the missing term in the se-
integer then square of n is not odd.”, then quence:4, 12, , 108, 324, 972
if P(n) is “n is an not an odd integer” and
A. 24
Q(n) is “(square of n) is not odd.” For di-
rect proof we should prove B. 38
A. ∀nP ((n) → Q(n)) C. 36
B. ∃ nP ((n) → Q(n)) D. 72
C. ∀n∼(P ((n)) → Q(n)) 370. years ago, who asked the question,
D. ∀nP ((n) → ∼(Q(n))) “How many prime numbers are there?”
365. What is the likelihood of getting yellow? A. Archimedes
B. Euclid
C. Einstein
D. Fibonacci

371. Which statement is true about k-ary

trees with n vertices?
A. The maximum height of this tree is n.
B. The minimum height is floor(logk n)
C. There is a maximum of n-1 internal
A. 1 out of 12 nodes.
B. 1 out of 8 D. If this tree is 2 tall, it can have a maxi-
C. 3 out of 12 mum of 2k leaf nodes.
D. 5 out of 7 372. For a symmetric digraph, the adjacency
366. If every two elements of a poset are com- matrix is
parable then the poset is called A. antisymmetric
A. sub ordered poset B. asymmetric
B. totally ordered poset C. symmetric and asymmetric
C. sub lattice D. symmetric
D. semigroup
373. Let p represent “x is an even number”
367. The truth value of ‘4+3=7 or 5 is not and q represent “x is divisible by 4” Which
prime’. of the following is true when x = 10?
A. False A. p ∧ q
B. True B. p ∨ q
C. Statement C. ∼ p
D. None of the above D. q

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 40

374. Declarative sentence that is either true or B. 13 out of 52

false (but not both) C. 26 out of 52
A. Proposition D. 4 out of 52
B. Gates
379. A is a cycle that visits each vertex ex-
C. Logic
actly once (except for the starting vertex,
D. Conjuction which is visited once at the start and once
again at the end).

NARAYAN CHANGDER
375. Go to your room!
A. Hamiltonian Path
A. Statement
B. Hamiltonian Cycle
B. Not Statement
C. Eulerian Path
376. If a task can be done either in one of n1
D. Eulerian Cycle
ways or in one of n2 ways, where none
of the set of n1 ways is the same as any 380. Let N = {1, 2, 3, } be ordered by di-
of the set of n2 ways, then there are n1 + visibility, which of the following subset is
n2 ways to do the task. totally ordered,
A. Product Rule A. (2, 6, 24)
B. Sum Rule B. (3, 5, 15)
C. Subtraction Rule C. (2, 9, 16)
D. Division Rule
D. (4, 15, 30)
377. Translate the following proposition into
381. If A = {1, 2, 3, 4, 5} then the relation
logical expressionLet p and q be a propo-
R={(4, 5)} in A is
sitions.p:You drive over 65 miles per
hourq:You get a speeding ticket. Driving A. Symmetric and transitive only
65 mi/hr is sufficient for getting speeding B. Symmetric only
ticket
C. Transitive only
A. ∼p
D. Not transitive
B. p ∧ ∼ q
C. p → q 382. Let n(A) denotes the number of elements
in set A. If n(A) =p and n(B) = q, then how-
D. q ∧ ∼p many ordered pairs (a, b) are there with a
378. Find the probability of drawing a 10from ∈ A and b ∈ B?
a standard deck of 52 cards. A. p2
B. p × q
C. p + q
D. 2pq

383. the study of mathematical structures that

are fundamentally discrete rather than
continuous.
A. 1 out of 52 A. Discrete Mathematics

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 41

B. Algebra 388. Given a≡b mod m, which statement is

C. Logic not true?

PRACTICE BOOK» NOT FOR SALE

D. Gates A. a-b is divisible by m.
B. a and b have the same remainder from
384. p v q:It is raining or it is cold.
division by m.
A. AND
C. a * b ≥ 0
B. OR
D. an ≡ bn mod m
385. The solution of the linear congruence 4x
= 5(mod 9) is? 389. An implication or conditional is a molecu-
lar statement of the form P → Q where P
A. 6(mod 9) and Q are statements. We say that * P is
B. 8(mod 9 the (or antecedent). * Q is the conclu-
C. 9(against 9) sion (or consequent).
D. 10(mod 9) A. hypothesis
B. predicate
386. Find A + B
C. domain
D. statement

390. Let the roots of the characteristic equa-

tion be 2, 3 and the inhomogeneous part
is f (n) = 3n
A. (p)
A. an = k3n
(p)
B. an = kn3n
(p)
C. an = k0 + k1 n + k2 n2 + k3 n3
B. 24
(p)
D. an = kn2 3n

391. What method of proof was used to

C.
deduct that there are a FINITE number of
prime numbers?
A. Proof by Contradiction
B. Proof by Counterexample
D. C. Proof by Example
D. Indirect Proof

392. ���������Ai ∪∞
i=1 Ai
387. deals with the study of mathematical
interaction and number types. A. {0}
A. Number Theory B. set of counting numbers
B. Differential Calculus C. set of integers
C. Higher Arithmetic D. The set of non-negative integers.
D. Automata E. Empty set

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 42

393. Translate into symbols. ∪se E(x) for “x 398. A set of ordered pairs is called what?
is even” and O(x) for “x is odd.” There is A. Coordinates
prime number that is even.
B. Relation
A. ∀x(E(x) → O(x + 1)).
C. Function
B. For every y there is an x such that
sin(x) y. In other words, every number y D. Vertical Line Test
is in the range of sine (which is false).
399. Hamilton cycle is a cycle that contains ev-
C. ∀x¬∃y(x < y < x + 1).

NARAYAN CHANGDER
ery of G.
D. ∃x(P(x) ∧ E(x)) (where P(x) means “x A. path
is prime”).
B. cycle
394. Identify the domain and range. Does the C. vertex
relation represent y as a function of x?
D. edge

400. The premisesp −→ q, q −→ r, s −→∼

r, q ∧ s
A. D:{4}R:{1, 3, 7, 10}No, it is not a func- A. consistent
tion. B. Inconsistent
B. D:{1, 3, 7, 10}R:{4}Yes, it is a func- C. none of the above
tion
D. none of above
C. D:{4}R:{1, 3, 7, 10}Yes, it is a func-
tion. 401. Which of the following is true about the
D. none of above relation R defined in the set {1, 2, 3, 4, 5}
as R = {(a, b):b = a + 1}?
395. Which operator is executed last in the A. Symmetric
Precedence Order?
B. Reflexive
A. ∼ (NOT)
C. Transitive
B. ∨
D. None of these
C. ∧
D. ↔ (BICONDITIONAL) 402. reasoning is a type of reasoning that
reaches conclusions based on a pattern.
396. True or False:3! = 3! x 2! x 1! A. Inductive
A. True B. Conjecture
B. False
403. A logical formula P which is equivalent to
397. Let �(�)=�-7. Find the value of �(2). a product of max terms is called
A. 5 A. PCNF
B. -7 B. PDNF
C. 7 C. DNF
D. -5 D. CNF

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 43

404. A polygon with 7 sides can be triangu- C. Definition of implication

lated into D. Transposition Law

PRACTICE BOOK» NOT FOR SALE

A. 7
410. Let P and Q be statements, then P<→Q
B. 14
is logically equivalent to
C. 5
A. P<→∼Q
D. 10
B. ∼P<→Q
405. ‘’Everyone wants to learn cosmology.” C. ∼P<→∼Q
This argument may be true for which do-
D. None of the mentioned
mains?
A. All students in your cosmology class 411. Which is not the name of the sorting
B. All the cosmology learning students in step?
the world A. Merge
C. Both of the mentioned B. Bubble
D. None of the mentioned C. Binary
406. If ∪ (the universal set) = {1, 3, 5, 7, 9, D. Insertion
11, 13, 15, 17} and W = {5, 7, 9, 11},
412. Can a simple graph exist with 15 vertices
then W’ =
each of degree 5?
A. {1, 3, 13, 15, 17}
A. Exist
B. {1, 3}
B. Does not exist
C. {2, 4, 6, 8, 10, 12, 14, 16}
D. {1, 3, 5, 7, 9, 11, 13, 15, 17} 413. Which one of the following is a binary op-
eration on N?
407. The nodes which have outdegree greater A. subdtraction
than or equal to one are called
B. multiplication
A. External Node/Terminal Node
C. division
B. Internal Node
D. all of the above
C. Rooted Trees
D. General Trees 414. A statement is if it cannot be divided
into smaller statements, otherwise it is
408. ⌊−5.5⌋ + ⌈7.6⌉ − ⌈1⌉ called
A. 1 A. mole/atom
B. 2 B. atomic/molecular
C. -1 C. molecular/atomic
D. 0 D. atom/mole
409. p → q ≡∼ p ∨ q What is the name of 415. The number of distinguishable permuta-
the equivalence law? tions of the letters in the word BANANA
A. From Morgan Law are,
B. Double Negation Law A. 60

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 44

B. 36 421. It is a formal language that is used to di-

rect instructions to the computer
C. 40
A. Computer Programming
D. 24
B. Programming Language
416. The Two Thousand and two makes 4 is a
C. Programming Algorithm
proposition
D. Pseudocode
A. True

NARAYAN CHANGDER
B. False 422. are often used in combination with
the conditional statements to compare val-
417. What is the minimum height for a binary ues.
search tree with 60 nodes?
A. Logical Operators
A. 1
B. Arithmetic Operators
B. 3
C. Special Logical Operators
C. 4
D. Concatenation Operator
D. 2
423. Property of a Relation:A relation R on a
418. What is the value of x after this state- set is called asymmetric if ∀a ∀b((a, b) ∈
ment, assuming the initial value of x is R → (b, a) � R).
5¿If x equals to one then x=x+2 else
A. Reflexive
x=0’.
B. Irreflexive
A. 1
C. Symmetric
B. 3
D. Asymmetric
C. 0
D. 2 424. Property of a Relation:A relation R is
called transitive if whenever (a, b) ∈ R
419. Consider the subset S= {2, 3, 6} of the and (b, c) ∈ R, then (a, c) ∈ R for all a, b,
poset(1, 2, 3, 4, 5, 6, |) c ∈ A.
A. 6, 2 A. Reflexive
B. 6, 1 B. Irreflexive
C. 6, 3 C. Transitive
D. 6 and 1, 2 D. Antisymmetric

420. are types of data to be used in a pro- 425. it will give a False result if and only if the
gram. value of both propositions if False
A. Flowchart A. Conjunction
B. Variables B. Disjunction
C. Data Types
426. ∪se the logic condition to find the value
D. Conditional Statements of X:A or (B and C)

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 45

B. 82
C. 64

PRACTICE BOOK» NOT FOR SALE

D. 30
431. Telephone numbers in the ∪SA have 10
digits and 42 is a perfect square
A. Molecular
B. Atomic
C. Predicates
D. Domain
432. What is the Cartesian product of A = {4,
A. True 8} and B = {x, y}?

B. False A. {(4, x), (4, y), (8, x), (y, y)}

B. {(4, 4), (8, 8), (x, x), (y, y)}
427. What is the negation of the “1001011”
C. {(4, x), (8, x), (4, y), (8, y)}
bits?
D. {(4, 4), (x, x), (2, x), (4, y)}
A. 0110100
B. 1100100 433. A drawer contains 12 red and 12 blue
socks, all unmatched. A person takes
C. 10110100
socks out at random in the dark. How
D. 11011011 many socks must he take out to be sure
that he has at least two blue socks?
428. Which one of the following statements
has the truth valueT A. 18
A. sinx is an even function B. 35
B. every square matrix has inverse C. 35
C. 3 + 4 = 10 D. 14
D. /5 is irrational number 434. At a dinner party, 6 men and 6 women
sit at a round table. In how many ways
429. How many license plates are possible if can they sit if men and women alternate?
each contains 3 letters followed by 3 dig-
its if letters and digits can be repeated? A. 86400 ways
B. 43200 ways
A. 17, 576, 000
C. 36 ways
B. 11, 232, 000
D. 1246 ways
C. 312, 000
D. 2, 176, 782, 336 435. Solve the system for the value of x. 5x
+ 8y =-123x + 5y =-7
430. In class, students want to join sports. 15
A. 1
people will join football, 24 people will
join basketball, and 7 people will join both. B. -1
How many people are there in the class? C. -4
A. 19 D. No solution

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 46

436. A cyclic group can be generated by a/an 442. Which of the arguments is not valid in
element. proving sum of two odd number is not odd.
A. inverse A. 3 + 3 = 6, hence true for all
B. non-singular
B. 2n +1 + 2m +1 = 2(n+m+1) hence
C. singular true for all
D. multiplicative C. All of the mentioned
437. If A = {1, 3, 5, 7, 9} and B = {2, 3, 5, 7},

NARAYAN CHANGDER
D. None of the mentioned
what is A � B?
A. {3, 5, 7} 443. What is the probability of choosing a
B. {2, 3, 5, 7} vowel from the alphabet?
C. {2, 3, 5, 7, 9}
D. {1, 2, 3, 5, 7, 9}
438. The statement “It is not raining if and
only if roads are dry” is logically equiv-
alent to:
A. If roads are dry then it is not raining
B. If it is not raining then roads are dry
C. Roads are dry if and only if it is not rain-
ing
D. none of these A. 21/26
B. 5/26
439. p −→ q is equivalent to
A. ∼ p ∨ q C. 1/21
B. ∼ p∨ ∼ q D. 7/21
C. p ∨ q
444. The number of vertices of odd degree in
D. ∼ p ∧ q
a graph is always
440. The sum of the terms of the geometric A. one
progression.
B. even
A. Arithmetic Series
B. Geometric Series C. odd
C. Arithmetic Progression D. zero
D. Geometric Progression
445. A graph with one vertex and no edges is
441. What is the GCF of 20, 44, and 88?
A. Multigraph
A. 4
B. digraph
B. 8
C. 14 C. Isolated graph
D. 2 D. Trivial graph

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 47

446. Given:ab, ac, bc, ba, ca, cbThere are 452. Which algorithm? There is a division of
number of combinations. sorted and unsorted data. During sorting
in each round (there are many answers, an-

PRACTICE BOOK» NOT FOR SALE

A. 4
swer them all)
B. 3
C. 5 A. Selection Sort
D. 6 B. Bubble Sort
447. The integer 561 is a Carmichael number. C. Insertion Sort
A. True
D. Merge Sort
B. False
448. “Fish can fly.” 453. Which of the following is true according
to the statement:A = the set of students
of Pamantasan ng Lungsod ng Maynila. B
= the set students at PLM CET IT

A. A ̸⊂ B

B. A ⊆ B and B ⊆ A
A. Proposition C. A ⊆ B
B. Not proposition
D. B ⊆ A
449. Which of the following is a circuit?
454. You give the answer to a probability
problem as 6/5. The teacher marks it
wrong. Why?

A. It should have been 5/6.

B. Its not written as a percent.

A. 5-2-7-3-2-0-5 C. Its more than 1.
B. 2-3-7-5-1
D. Its not written as a decimal.
C. 0-6-1-5-7-2
D. 0-2-5-7-2-0 455. What is the Domain in the relation {(-2,
450. A relation is a set of coordinates written 3), {4, 5), (6, -5), (-2, 3)}?
as (x, y). A. {3, 5, -5, 3}
A. TR∪E
B. {-2, 4, 6, 3}
B. FALSE
C. {-2, 4, 6}
451. The truth value of ‘4+3=7 or 5 is not
prime’. D. None of the above.
A. False
B. True 456. Does this relation represent a function?

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 48

C. A→B
D. A�B
460. Identify the properties of the functions
A. Injective
B. Surjective
C. Not function

NARAYAN CHANGDER
D. none of above
461. choose distributive law
A. P ∧ (Q ∧ R) = (P ∧ Q) ∧ R
B. P ∨ (Q ∨ R) = (P ∨ Q) ∨ R
C. P ∧ (Q ∨ R) = (P ∧ Q) ∨ (P ∧ R)
D. P ∧ (Q ∧ R) = (P ∧ Q) ∧ ∼ R
462. The logic circuit shown in the figure rep-
A. No resents which Boolean function?
B. Yes

457. In a language survey of students it is

found that 80 students know English, 60
know French, 50 know German, 30 known
English and French, 20 know French and
A. f (x, y) = x y
German, 15 know English and German and
10 students know all the three languages. B. f (x, y) = x + y
A. 135 C. f (x, y) = xy
B. 30 D. f (x, y) = x + y

C. 10 463. Order of functions with ascending growth

rate.
( )Which one follows? A.O (n log n)
D. 45
O n2 C.O (n)
458. Which relation is NOT a function? A. C-A-B
A. {(1, -5), (3, 1), (-5, 4), (4, -2)} B. B-A-C
B. {(2, 7), (3, 7), (4, 7), (5, 8)} C. C-B-A
C. {(1, -5), (-1, 6), (1, 5), (6, -3)} D. A-C-B
D. {(3, -2), (5, -6), (7, 7), (8, 8)} E. B-C-A
464. If there is an Edge from v1 to v1 that
459. The OR operation of two propositions A
edge is called
and B (written as ) is true if at least
any of the propositional variable A or B is A. Parallel edge
true. B. self loop
A. A∨B C. Incident
B. A∧B D. Isolated

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 49

465. The negation of “Today is Monday” is: 470. A function from B to A is called onto func-
A. Today is Saturday tion if its range is:

PRACTICE BOOK» NOT FOR SALE

B. Today is Wednesday A. B
C. Today is Monday B. A
D. Today is not Monday C. Neither A nor B

466. “Grass is green.” D. both A and B

471. An algorithm that affects the output

based on a certain condition given which
makes the program more smart and com-
plex thus extending the possibilities.
A. Sequential
A. Proposition
B. Conditional/Selection
B. Not Proposition
C. Looping/Repetition
467. How many ways can 6 first-year stu- D. Modular
dents and 3 second-year students form a
line? 472. The inverse of p → q is the proposition
A. 9! of
B. 12*(7!) A. ¬p → ¬q
C. 6! + 3! B. ¬q → ¬p
D. (3!)*(6!) C. q → p
468. If A is any statement, then which of the D. ¬q → p
following is a tautology?
473. A relation pairs each input with exactly
A. A ∧ F
one output is a
B. A ∨ F
A. congruence
C. A ∨ ¬A
B. similarity
D. A ∧ T
C. function
469. Evaluate
D. mathematical equation

474. Let P:This is a great website, Q:You

should not come back here. Then ‘This is
a great website and you should come back
here.’ is best represented by?

A. A A. ∼P V ∼Q
B. B B. P ∧ ∼Q
C. C C. P V Q
D. D D. P ∧ Q

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 50

475. Property of a Relation:A relation is C. f(1, 0, 1)

if and only if there are no pairs of distinct D. f(0, 0, 1)
elements a and b with a related to b and
b related to a. E. f(1, 1, 1)

A. Reflexive 480. Which is true about these two graphs?

B. Irreflexive A. A. is a subgraph of B.
C. Symmetric B. B. is a subgraph of A.

NARAYAN CHANGDER
D. Antisymmetric C. �. isomorphic ��� �.
D. B. is a complement of A.
476. Which one is true? (There may be multi-
ple answers. Answer all) 481. When a 3x6 matrix is multiplied by a 6x5
A. Countable set is always finite set. matrix, what will the dimensions of the
product be?
B. Countable set ���� infinite set ����
A. shhh
C. The set of rational numbers (Q) is a
countable set. B. NS

D. The set of irrational numbers ( Q C. Reverse

D. 5x6
E. Finite set is always Countable set.
482. What are the converse of the conditional
477. Suppose P and Q are the state-
statement “When Raj stay up late, it is
ments:P:Jack passed math. Q:Jill passed
necessary that Raj sleep until noon.”
math. Translate “Jack and Jill both passed
math” into symbols. A. “If Raj stay up late, then Raj sleep until
noon.”
A. P ∧ Q
B. “If Raj does not stay up late, then Raj
B. P → Q
does not sleep until noon.”
C. ∃xP(x) C. “If Raj does not sleep until noon, then
D. ∀xP(x) Raj does not stay up late.”

478. From the assumptions “If it rains then D. “If Raj sleep until noon, then Raj stay
there will be traffic jams” and “Today up late.”
there will be no traffic jams”, it can be 483. In Boolean addition 1+1=
concluded that It’s not raining today. It
is concluded by what inductive law? A. 2
B. 1
A. Removing Mode
C. 0
B. Setting Mode
D. None of the above
C. Elimination
D. Simplification 484. An implication is true provided P is false
or Q is true (or both), and false otherwise.
479. �������� SOP form ��� f (x, y, z) = xyz + In particular, the only way for P → Q to
xyz + xzy + xyz be false is for P to be true and Q to be
A. f(1, 1, 0) A. false
B. f(0, 1, 0) B. true

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 51

485. If A = {1, 2, 3, 4, 5, 6}, B = {1, 2, 3, 5, 490. The binary relation {(1, 1), (2, 1), (2, 2),
7, 9} and C = {3, 5, 6, 7, 8, 9}, what is (A (2, 3), (2, 4), (3, 1), (3, 2)} on the set {1,
∪ B) ∩ (B ∪ C)? 2, 3} is

PRACTICE BOOK» NOT FOR SALE

A. {1, 2, 3, 4, 5, 6, 7, 9} A. reflective, symmetric and transitive
B. {1, 2, 3, 4, 5, 6, 7, 8, 9} B. irreflexive, symmetric and transitive
C. {1, 2, 3, 5, 6, 7, 9} C. neither reflective, nor irreflexive but
transitive
D. { }
D. irreflexive and antisymmetric
486. In how many ways can the letters of the
491. An undirected graph possesses an eule-
word ‘OPTICAL’ be arranged so that the
rian circuit if and only if it is connected and
vowels always come together?
its vertices are An undirected graph pos-
A. 120 sesses an eulerian circuit if and only if it is
B. 720 connected and its vertices are
A. all of even degree
C. 4320
B. all of odd degree
D. 2160
C. Of any degree
E. None of these
D. even in number
487. It is a formula which has both some true
492. are known as non-negative integers
and some false values for every value of
and it does not include any fractional or
its propositional variables.
decimal part. It is denoted as W.
A. Contingency A. Whole Numbers
B. Tautology B. Natural Numbers
C. Domain C. Real Numbers
D. Predicate D. Integers
⊕
488. ¬ (A ∨ q) ∧ (A ∧ q) is a 493. ¬(p q) is logically equivalent to
A. Tautology A. p ↔ q
B. Contradiction B. p ∨ (p ∧ q)

C. Contingency C. (p → q)
D. (p ∧ q)
D. None of the mentioned
494. Which topic of which mathematics sub-
489. Which of the following is true according ject? Can be used to compare growth
to the statement:A = the set of students rates. of two functions
studying discrete mathematics. B = the set
of students studying Programming A. Infinite Limits of Calculus

A. A ⊆ B B. Relationships and functions of the sub-

ject Discrete
B. A ⊆ B and B ⊆ A
C. Finding the highest and lowest values
C. B ⊆ A in Calculus
D. A ̸⊂ B D. Boolean circuit of Discrete subject

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 52

495. Which statement is true about the history 499. Which Boolean Identities law proof
of number theory? (There may be multiple A+1=1?
answers. Answer them all.) A. Dominance Law
A. Knowledge about number theory Be- B. Absorption Law
ginning in ancient Greece
C. Commutative Law
B. The concept of using the number 0 was
first used in India. D. Associative Law
C. It is the study of rational numbers.

NARAYAN CHANGDER
500. A word/letter that serves as temporary
D. Division in integers Invented by the storage of values depending on its data
Greeks type.
E. Examples of mathematicians involved A. Flowchart
in number theory include Diophantus, Eu- B. Variables
ler, Fermat.
C. Data Types
496. sub graphs homeomorphic to k5 or k3, 3 D. Conditional Statements
A. two arrows between each pair of dis-
tinct vertices 501. From the picture, what kind of relation-
ship or function is a diagram?
B. n-1 arrows between each pair of dis-
tinct vertices
C. one arrow between each pair of dis-
tinct vertices
D. path between every two distinct ver-
tices
497. The shaded area of figure is best de- A. non-functional relationships
scribed by? B. A function that is neither 1-1 nor uni-
versal.
C. 1-1 function, but not comprehensive
D. The function is thorough but not 1-1.
E. 1-1 and thorough functionality
A. A ∩ B 502. Which of the following are the set of nat-
B. A ∪ B ural numbers?
C. A A. {1/2, 1/3, 1/4, 1/5}
D. B B. {0, 1, 2, 3, 4, 5}
C. {-3, -2, -1, 0, 1, }
498. Determine the edge count of a path com-
plement graph with 14 vertices. D. {a, b, c, d, e}
A. 502 503. P:It is 4 o’clock Q:the train is late‘If it is
B. 345 not 4 o’clock then the train is late.
C. 78 A. P → Q
D. 69 B. ∼ P → Q

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 53

C. Q ↔ P 509. Which of the following canNOT be a prob-

D. None of these ability?

PRACTICE BOOK» NOT FOR SALE

A. 0
504. Which relation is NOT a function?
B. 0.5
A. {(1, -5), (3, 1), (-5, 4), (4, -2)}
C. 1
B. {(2, 7), (3, 7), (4, 7), (5, 8)}
C. {(3, -2), (5, -6), (7, 7), (8, 8)} D. 1.5

D. {(1, -5), (-1, 6), (1, 5), (6, -3)} 510. P ↔ Q is read “P if and only if Q, “ and
called a
505. ⌊ 3 ⌋
10.56
A. conditional
A. 4
B. biconditional
B. 3.52
C. conjunction
C. 3
D. none of above D. disjunction

506. If the proposition �x∀y L(x, y) repre- 511. From the hypothesis:If I get a good vac-
sents the statement:There is someone in cine I will have immunity. // If I have
this class who likes all Korean idol groups. immunity, I will not contract the disease.
Which statement is not true? What law of inference is used to draw the
conclusion?
A. The value that can be substituted for x
is anyone in this class. A. Selection logic rules/elimination rules
(Elimination)
B. The value to be substituted in y must
be any Korean idol group. B. Hypothetical logic rules (Hypothetical
syllogism)
C. ∀x L(x, BTS) represents the state-
ment:Everyone in this class likes BTS. C. Modus Tollens Rule
D. �x L(x, 4EVE) represents the message D. Modus Ponens Rule
Someone in this class likes the band 4EVE. E. Separation Rule (Resolution)
507. Find the explicit rule for an arithmetic se-
512. In the set {1, 2, 3}, how many permuta-
quence if the 6th term is-38 and the 14th
tions are there when taken one at a time?
term is-110
A. 3
A. an=7-9(n-1)
B. 6
B. an=-9+7(n-1)
C. an=-83+9(n-1) C. 9

D. an=9-83(n-1) D. 12

508. A proof covering all the possible cases, 513. Which of the following is/are the univer-
such type of proofs are known as sal logic gates?
A. Direct proof A. OR and NOR
B. Proof by Contradiction B. AND
C. Vacuous proof C. NAND and NOR
D. Exhaustive proof D. NOT

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 54

514. “Match will be played only if it is not a 519. The number of onto function from
humid day.” The negation of this state- set{1, 2, 3, 4}to {3, 4, 7}
ment is? A. 18
A. Match will be played but it is a humid B. 36
day
C. 64
B. Match will be played or it is a humid
day D. none

NARAYAN CHANGDER
C. All of the mentioned statement are cor- 520. In a simple graph with n vertices, the
rect maximum possible degree of a vertex is:
D. None of the mentioned A. n+1
515. Property of a Relation:A relation R is B. 2n-1
called if ∀aA, (a, a)�R C. n
A. Reflexive D. n-1
B. Irreflexive
521. Which is not true about the process of
C. Symmetric drawing conclusions using the law of induc-
D. Antisymmetric tion?

516. It is the process of designing/building A. Step 1:Replace the entire sentence

something in a logical way. with propositional variables or proposi-
tional functions.
A. Computer Programming
B. Step 2:Change the hypothesis into a
B. Programming Language proposition or propositional function with
C. Programming Algorithm quantifiers.
D. Pseudocode C. Step 3:Convert the hypothesis using
the law of induction until reaching a con-
517. List all the letters in the name ‘’ jenny- clusion.
lyn”
D. At some stage, equivalence rules may
A. {j, e, n, n, y, l, y, n} be used to change the form of a proposi-
B. {j, e, n, y, l, y, n} tion.
C. {j, e, n, y, l}
522. How many edges are there in a complete
D. {j.e.n} graph of order 9?
518. A non empty set A is termed as an alge- A. 35
braic structure A with respect to binary B. 36
operation *B with respect to ternary oper-
C. 45
ation?C with respect to binary operation
+D with respect to unary operation- D. 19
A. option A 523. Every Isomorphic graph must have
B. option B representation.
C. option C A. cyclic
D. option D B. adjacency list

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 55

C. tree 529. If N objects are placed into k boxes, then

D. adjacency matrix there is at least one box containing N/k
objects.

PRACTICE BOOK» NOT FOR SALE

524. When buying a new car, the customer can
A. Pigeonhole Principle
choose from 7 different exterior colors, 4
interior colors, and 3 different accessory B. Sum Rule
packages? How many different cars can
C. Generalized Pigeonhole Principle
the customer order?
A. 84 D. Division Rule

B. 2184 530. The inverse of 3 modulo 7 is?

C. 364
A. -1
D. 924
B. -2
525. The linear combination of gcd(252, 198) C. -3
= 18 is?
D. -4
A. 252*4-198*5
B. 252*5-198*4 531. The monoid is a?
C. 252*5-198*2 A. a non-abelian group
D. 252*4-198*4
B. groupoid
526. Property of a Relation:A relation R is C. A group
called if (b, a)∈R whenever (a, b) ∈
R, for all a, b ∈ A. D. a commutative group
A. Reflexive
532. If a task can be done in either n1 ways
B. Irreflexive or n2 ways, then the number of ways to
C. Symmetric do the task is n1 + n2 minus the number
of ways to do the task that are common
D. Antisymmetric
to the two different ways.
527. A relation where every input yields one A. Product Rule
and only one output is called what?
B. Sum Rule
A. Relation
C. Subtraction Rule
B. Linear
C. Exponential D. Division Rule

D. Function 533. What is the test to determine if a graph

528. Rephrase the implication, “if I dream, represents a function?
then I am asleep” in as many different A. Horizontal line test
ways as possible. Then do the same for
the converse. B. Vertical line test

A. I am asleep if I dream. C. Heidelberg ∪ncertainty Test

B. I dream if I am asleep. D. Obi one kick extension hand st

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 56

534. The shaded area of figure is best de- 539. If A = {1, 3, 5, 15}, B = {2, 3, 5, 7}C =
scribed by? {2, 4, 6, 8}then what is (A ∪ B) ∩ C?
A. {1, 3, 5}
B. {1, 2, 3}
C. {2, 3, 5}
D. {2}

540. The statement ∼(∼q)=q Describes:

NARAYAN CHANGDER
A. A ∩ B
A. Double negative law
B. A ∪ B
B. Commutative laws
C. A’
C. implication Laws
D. B’
D. None of the above
535. A monoid is called a group if 541. You have 5 Christmas presents, one for
A. (a*a)=a=(a+c) each of your siblings. They each get to pick
a present. How many different ways can
B. (a*c)=(a+c)
the presents be selected?
C. (a+c)=a
A. 25
D. (a*c)=(c*a)=e B. 120
(n)
536. ������������T (n) = 4T 4 + n log n C. 10
A. nlog3 4 D. 3, 628, 800
B. n (log n)2 542. Which of the following graphs is not a
C. n regular graph?

D. n log n A. Isolated Graph

B. Cycle
537. A cyclic group is always
C. Complete Graph
A. abelian group D. Wheel
B. monoid
543. Graph Type:consists of set of vertices V,
C. semigroup set of Edges E and a function F from E to
D. subgroup {{u, v}| u, v Î V}. Loops allowed in such a
graph.
538. Best case Complexity is the time function
A. Simple Graph
analysis in which situation?
B. Multigraph
A. There are minimal operational inputs.
C. Pseudograph
B. It has the inputs that make the most
operations. D. Directed Graph

C. The algorithm performs the same op- 544. Given the function f (x) = 5x − 6
erations for all input types. f −1 (x)
y+5
D. Consider the average operation. A. 6

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 57
y−6
B. 5 549. Which of the following is a correct repre-
x+5 sentation of a complete bipartite graph?
C. 6

PRACTICE BOOK» NOT FOR SALE

A. Vomiting, A
x+6
D. 5 B. Kch
545. Given there exists x, y that gcd(p, q) = C. K5
px + qy, which statement is True? D. Tz
A. x and y is a Bézout coefficients of p and
550. From the above Venn diagram, what is
q
the set (S � T) ∩ V?
B. p and q is a Bézout coefficients of x and
y
C. x and y is the only Bézout coefficients
of p and q
D. p and q is the only Bézout coefficients
of x and y

546. The set consisting of all the first elements

of each ordered pair in the relation is called A. {casey, drew, jade, glen}

A. subset B. {alex, glen, hunter, jade}

C. {casey, drew, glen}
B. domain of relation
D. {drew, jade}
C. range of relation
D. complement of a set 551. Does this mapping diagram represent a
function?
547. Which is not a Linear recurrence relation?
(There may be many answers. Answer
them all)
A. an = 4an−1 + n2
B. an = an−1 an−2 + 2n − 1
C. an = 3an−3 + 2
D. an = 2a n2 + n
E. an = 7an−1 − 10an−2
A. No, because an input value goes to
548. Express, “The difference of a real num- multiple output values
ber and itself is zero” using required oper-
B. Yes, because each input goes to one
ators.
and only one output
A. ∀x(x-x! = 0)
552. Given the function f (x) = x +9 g (x) =
B. ∀x(x-x = 0) 2x − 5 g f (x)?
C. ∀x∀y(x-y = 0) A. x + x
D. ∃x(x-x = 0) B. 2x − 4

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 58

C. x + 4 558. If x * y = x + y + xy then (G, *) is

D. x + 13 A. Monoid
553. In how many ways can letters of the B. Abelian group
word “TRIANGLE ‘’ be arranged such that C. Commutative semigroup
vowels come together? D. Cyclic group
A. 2340
559. Consider the given graph, What is the
B. 4126 weight of the minimum spanning treeusing

NARAYAN CHANGDER
C. 4320 the Kruskal’s algorithm?
D. 3460
554. The inorder and preorder traversal of a
binary tree are d b e a f c g and a b d e c
f g, respectively. The postorder traversal
of the binary tree is:
A. d e b f g c a
B. e d b g f c a
C. e d b f g c a
D. d e f g b c a A. 24
B. 23
555. A human resources director interviews
eight people for three identical positions. C. 15
How many ways can she select three of D. 19
people to move on to the second inter-
view? 560. Graphs studied in this subject It is a math-
ematical model that consists of 2 sets.
A. 56 What is a set?
B. 336
A. The set of vertices and the set of
C. 512 edges.
D. 6561 B. The set of degrees and the set of ver-
tices
556. ‘Raj went to college’ is a
C. Set of x-axis values and y-axis values.
A. Statement
D. Set of root nodes and leaf nodes.
B. Sentence
C. Statement and sentence both 561. Graph G will be a tree when which condi-
tion is true?
D. none of these
A. It is a connected graph with no cycles.
557. If you roll a die then flip a coin, how many
possible outcomes? B. It is a graph with n nodes having n-1
edges.
A. 2
C. Each pair of nodes in G has only one
B. 6 connecting path.
C. 12 D. It is a connected graph with the most
D. 64 connecting lines.

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 59

562. If x is a set and the set contains the real C. 18

number between 1 and 2, then the set is D. 24

PRACTICE BOOK» NOT FOR SALE

568. The linear combination of gcd(117, 213)
A. Infinite set
= 3 can be written as
B. Finite set
A. 11*213 + (-20)*117
C. not a set B. 10*213 + (-20)*117
D. none of above C. 11*117 + (-20)*213
563. (P ↔ Q) ∧ (Q ↔ R) → (P ↔ R) is a D. 20*213 + (-25)*117
A. Tautology 569. The minimum number of edges in a con-
B. Contradiction nected cyclic graph on n vertices is

C. Contigency A. a) n-1
B. b) n
D. None of these
C. Q) A+A
564. A A is a relation from A to A. D. d) n+1
A. Relation
570. If A = {2, 3} and B = {x | x∈ A × B
B. Binary Relation
A. {(2, 1), (2, 2), (3, 1), (3, 2)}
C. Relation on a Set
B. {(1, 2), (1, 3), (2, 2), (2, 3)}
D. Function C. (1, 2), (2, 2), (3, 3), (3, 2)
565. What is the number of edges present in D. None of these.
a wheel Wn?
571. p → q is logically equivalent to
A. n+1
A. ¬p ∨ ¬q
B. that B. p ∨ ¬q
C. n/2 C. ¬p ∨ q
D. n D. ¬p ∧ q
566. Suppose X = {a, b, c, d} and � is the par- 572. Edge Type:Ordered pair of vertices
tition of X, �= {{a, b, c}, d}. The number of A. Graph
ordered pairs of the equivalence relations
induced by B. Directed
C. ∪ndirected
A. 15
D. Loop
B. 10
C. 34 573. The in a rooted tree is defined to be
the number of edges in the path from the
D. 5 root to the vertex.
567. Find the missing number in the se- A. Path Length of a Vertex
quence:5, 10, 15, , 25, 30. B. Degree
A. 20 C. Node
B. 35 D. Graph

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 60

574. Edge Type:Two or more edges joining the 579. How many type of canonical forms for a
same pair of vertices Boolean expression?
A. Multiple Edges A. 5
B. Directed B. 2

C. ∪ndirected C. 6
D. 4
D. Loop

NARAYAN CHANGDER
580. How do we determine if the graph will
575. Again, suppose the statement “if the have a Euler Path?
square is blue, then the triangle is green”
is true. This time however, assume the A. All even degree vertices
converse is false. Classify each statement B. Exactly 2 odd degree verticies
below as true or false (if possible).”The C. Each vertex will be used once
square is blue if and only if the triangle is
green.” D. All odd degree vertices

A. False 581. Find A-B

B. True
(n)
576. T (n) = 4T 3 + n2
A. nlog3 4
B. n2
C. n3
A.
D. n log n

577. The value of p, p→q, q→r is

A. P
B. q
C. r B.
D. True

578. Find the sum if possible

C. -31

D.
A. 16
B. 48
C. 36
582. Number of subsets of a set of order three
D. not possible is

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 61

A. 2 587. Which is the result of this algorithm

B. 4 A. gcd(a, b) = h

PRACTICE BOOK» NOT FOR SALE

C. 6 B. gcd(f, h) = 0
D. 8 C. gcd(a, b) = d
583. What is the result of this expres- D. None since the process is wrong.
sion?A=10, B=5, C=3NOT((A<B) &
(A==B) | NOT(A>=B)) 588. Consider the graph given above. The two
distinct sets of vertices, which make the
A. True graph bipartite are:
B. False

584. Finding gcd(312, 64) using Euclidean di-

vision. How are rounds 1 and 2 divided?
(Choose 2 answers)
A. 312 = 64 * 4 + 56
B. 64 = 56 * 1 + 8
C. 312 = 16 * 19 + 8
D. 19 = 16 * 1 + 3 A. (c1, high school, high school); (c2, vz,
c5, vst, c8)
E. 312 = 8 * 39 + 0
B. (F1, Fah, Fad); (fa, fa, trap, fa)
585. Which two of the following are equiva- C. (c1, vc, vc, vc); (c2, cz, c5, c8)
lent for an undirected graph G?(i) G is a
tree(ii) There is at least one path between D. (c1, vc, vc, vc, c8); (c2, cz, c5)
any two distinct vertices of G(iii) G con-
589. How many ways can a stylist arrange 5
tains no cycles and has (n-1) edges(iv)G
of 8 vases from left to right in a store dis-
has n edges
play?
A. (i) and (ii)
A. 672
B. (i) and (iii)
B. 40
C. (i) and (iv)
C. 6720
D. (ii) and (iii)
D. none of above
586. Which statement is not true about Rela-
tionship from A to B 590. An isomorphism of graphs G and H is a bi-
jection f the vertex sets of G and H. Such
A. is the set of ordered pairs (a, b) where
that any two vertices u and v of G are ad-
a ∈ A and b ∈ B.
jacent in G if and only if
B. is a subset of the Cartesian product of
A. f(u) and f(v) are contained in G but not
A and B.
contained in H
C. A domain is the set of the first mem-
B. f(u) and f(v) are adjacent in H
bers of ordered pairs in a relationship.
C. f(u * v) = f(u) + f(v)
D. One member of a domain belongs to a
single pair in the relationship. D. f(u) = f(u)2 + f(v)2

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 62

591. Determine the 3rd term of the se- C. 0

quence.a1=5 an= 2an-1-1 D. 1
A. 14
596. How many ways can five different books
B. 13 be arranged on a bookshelf?
C. 17 A. 120
D. 16 B. 3125
C. 60

NARAYAN CHANGDER
592. “12 + 9 = 3-2”, it returns truth value
A. False D. 25
B. True 597. It is a branch of mathematics involving
discrete elements that uses algebra and
593. ((P ∨ Q) ∧ (P −→ R) ∧ (Q −→ S)) arithmetic.
A. S ∧ R A. Discrete Mathematics
B. S ∨ R B. Continuous Mathematics
C. S −→ R C. Basic Mathematics
D. None of these D. Statistics
594. Find the product. 598. In proving �5 as irrational, we begin with
assumption �5 is rational in which type of
proof?
A. Direct proof
B. Proof by Contradiction
C. Vacuous proof
D. Mathematical Induction

A. undefined 599. Which of the following statements is the

B. -3 1617 128-10 negation of the statements “4 is odd or-9
is positive”?
C. 3 12-15-8-1-3
A. 4 is even or-9 is not negative
D. none of above
B. 4 is odd or-9 is not negative
595. What is the degree of vertex 2? C. 4 is even and-9 is negative
D. 4 is odd and-9 is not negative
600. Which statements are True about Prime
number?
A. There are infinite number of primes
B. Every prime number can be written in
Mersenne form (2p-1)
C. Every number in Mersenne form (2p-1)
A. 3 is prime
B. 2 D. 127 is a Mersenne prime

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 63

601. All of the x values or inputs are called B. -162

what? C. -682

PRACTICE BOOK» NOT FOR SALE

A. Domain D. 324
B. Range
606. How many different ways can 7 people
C. Relation fit in a car that seats 7 people?
D. Function A. 5, 040
602. Consider a weighted undirected graph B. 14
with positive edge weights and let (u, v) C. 48
be an edge in the graph. It is known that
the shortest path from source vertex s to D. 87, 178, 291, 200
u has weight 53 and shortest path from s
607. Which of the following is true according
to v has weight 65. Which statement is
to the statement:A = the set of airline
always true?
flights from Manila to Cebu. B = the set
A. Weight (u, v) > 12 of nonstop flights from Manila to Cebu
B. Weight (u, v) = 12 A. A ̸⊂ B
C. Weight (u, v) <= 12 B. A ⊆ B and B ⊆ A
D. Weight (u, v) >= 12 C. B ⊆ A
603. What is the identity element In the group D. A ⊆ B
G = {2, 4, 6, 8) under multiplication mod-
608. The symbol II in ASCII stands for:
ulo 10?
A. international information
A. 5
B. information interchange
B. 6
C. American Standard Code for Informa-
C. 9
tion Interchange
D. 12
D. none of above
604. Which is the output of half adders?
609. Which of the following propositions is
A. xy + xy tautology?
B. xy A. (p ∨ q) −→ q
C. x + y B. p ∨ (q −→ p)
D. xx + yy C. p ∨ (p −→ q)
605. Find the sum for the following series. D. both (b) and (c)

610. How many different words can be formed

out of the letters of the word VARANASI?
A. 1050
B. 964
C. 720
A. 44 D. 842

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 64

611. The ∪niversal Set = {-4, 3, -2, -1, 0, 1, 2, 616. If P is TR∪E and Q is TR∪E what is the
3, 4} and A = {0}. What is the complement result?
of A?
A. True
A. {-4, -3, -2, -1, 0, 1, 2, 3}
B. False
B. {-3, -2, -1, 1, 2, 3}
C. {-4, -3, -2, -1, 1, 2, 3, 4} 617. What is the cardinality of the set of odd
D. {-4, -3, -2, -1, 1, 2, 3} positive integers less than 10?

NARAYAN CHANGDER
612. A die is rolled, what is the probability A. 10
that the number rolled is greater than 2?
B. 5
A. 2/3
B. 1/3 C. 3

C. 1/2 D. 20
D. 1/4
618. is a graph is a path that uses each
613. What type of proportion? edge precisely once. If such a path exists,
the graph is called traversable.
A. Hamiltonian Path
B. Hamiltonian Cycle
C. Eulerian Path

A. AND D. Eulerian Cycle

B. OR
619. An algorithm that runs from top-down
C. NOR without interruption until it finishes the
D. none of above program.

614. M M A. Sequential
A. M = {3, 6, 9, 12, · · · } B. Conditional/Selection
B. M = {2, 3} C. Looping/Repetition
C. M = {3}
D. Modular
D. M = {3, 5, 7, 9}
615. G is a simple undirected graph and some 620. Find the negation of the proposi-
vertices of G are of odd degree. Add tion“Vandana’s smartphone has at least
a node n to G and make it adjacent to 32GB of memory”
each odd degree vertex of G. The resultant
A. False
graph is
A. Complete bipartite graph B. “Vandana’s smartphone has less than
32GB of memory.”
B. Hamiltonian cycle
C. Regular graph C. True
D. Euler graph D. none of above

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 65

621. All of the y values or outputs are called 627. “The product of two negative real num-
what? bers is not negative.” Is given by?
A. ∃x ∀y ((x < 0) ∧ (y < 0) → (xy > 0))

PRACTICE BOOK» NOT FOR SALE

A. Range
B. Relation B. ∃x ∃y ((x < 0) ∧ (y < 0) ∧ (xy > 0))
C. Tomorrow C. ∀x ∃y ((x < 0) ∧ (y < 0) ∧ (xy > 0))
D. Function
D. ∀x ∀y ((x < 0) ∧ (y < 0) → (xy > 0))
622. If the statement is “If p, then q”, the
contra-positive will be “If not q, then not 628. Which is the divide and conquer algo-
p”. rithm? (There may be multiple answers.
Answer them all.)
A. Contra-positive
A. an = 4an−1 + n2
B. Converse
C. Inverse B. an = an−1 an−2 + 2n − 1

D. Dual positive C. an = 3an−3 + 2

D. an = 2a n2 + n
623. A ∧ ¬(A ∨ (A ∧ T)) is always
A. True E. an = 7an−1 − 10an−2

B. False 629. Describe the pattern input and output

624. A compound proposition that is always
is called a tautology.
A. True
B. False
C. Neither true nor false
D. None of the above

625. A relation R is defined on the set of pos-

itive integers as if 2a + b ≤ 7.
A. reflexive A. The input and output both go down by
3
B. transitive
C. symmetric B. The x goes up 1 and the y goes right 1
D. None of these. C. The x goes right 2 and the y goes up 2

626. Which is not a parameter of a Binomial D. There is no pattern

distribution?
630. It a test to check if a function is one-to-
A. Number of result patterns that can oc- one.
cur in a single experiment.
A. Horizontal Line test
B. Random variable representing the
number of successes. B. Vertical Line test
C. number of trials C. None of these
D. Probability of success D. none of above

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 66

631. What is the degree sum of this graph? 636. Let P:If Sahil bowls, Saurabh hits a cen-
tury.; Q:If Raju bowls, Sahil gets out on
first ball. Now if P is true and Q is false
then which of the following can be true?
A. Raju bowled and Sahil got out on first
ball
B. Raju did not bowled
C. Sahil bowled and Saurabh hits a cen-

NARAYAN CHANGDER
tury
A. 14
D. Sahil bowled and Saurabh got out
B. 7
C. 6 637. If I use the fundamental counting prin-
ciple, how many different outcomes are
D. 0 there if I flip 4 different 2-sided coins?
632. For any non empty sets A and B if A ⊂ A. 8, because 4 x 2 = 8
B then A ∩ B = B. 6, because 4 + 2 = 6
A. A C. 16, because 2 x 2 x 2 x 2 = 16
B. B D. 256, because 4 x 4 x 4 x 4 = 256
C. ϕ
638. Given f (x) = x − 2 f g (x) = 3x + 4
D. none
g (x)?
633. What will be the number of edges in a x−6
A. 3
complete bipartite graph Km, n
B. zx − 2
A. m+n
C. zx + w
B. m.n x−2
D. 6
C. Data Insufficient
639. Consider the given graph. What is the
D. none of above
weight of the minimum spanning tree using
634. If A is any statement, then which of the the Prim’s algorithm, starting from vertex
following is not a contradiction? a?
A. A ∧ ¬A
B. A ∨ F
C. A ∧ F
D. None of mentioned
635. If a statement contain 3 variables then
the number of entries in the truth table will
be
A. 3 A. 23
B. 6 B. 28
C. 8 C. 27
D. 16 D. 11

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 67

640. Graph Type:consists of V, a nonempty 646. Which one of the following is not true?
set of vertices, and E, a set of unordered A. Negation of a negation of a statement
pairs of distinct elements of V called edges

PRACTICE BOOK» NOT FOR SALE

is the statement itself.
(undirected)
B. (2) If the last column of the truth table
A. Simple Graph
contains only T then it is a tautology.
B. Multigraph
C. (3) If the last column of its truth table
C. Pseudograph contains only F then it is a contradiction
D. Directed Graph D. If p and q are any two statements then
641. Which sentence is true? p <→ q is a tautology.
A. Set of all matrices forms a group under 647. If ∪ = {1, 2, 3, 4, 5} and A = {2, 4} then
multiplication A’ should be
B. Set of all rational negative numbers A. {2, 4, 5}
forms a group under multiplication
B. {2, 4}
C. Set of all non-singular matrices forms
a group under multiplication C. {1, 2, 3, 4, 5}
D. Both (b) and (c) D. {1, 3, 5}

642. [3] (+4) [3] =? 648. In how many ways can letters of the
A. 2 word “ALLAHABAD” be arranged?
B. 4 A. 6540
C. 6 B. 7560
D. 1 C. 8128

643. Representing a set by (enumerating) the D. 3456

members of the set. (Select all that AP-
649. Letters of CHORD taken all at a time can
PLIES.)
be written in:
A. Definition by property
A. 500
B. Roster Method
B. 120
C. Rule Method
C. 122
D. Listing
D. 135
644. .... and are the two binary opera-
tions defined for lattices. 650. “x is greater than 2”
A. Join, meet
B. Addition, subtraction
C. ∪nion, intersection
D. Multiplication, modulo division
645. 0/ ⊆ {x}
A. true A. Proposition
B. false B. Not proposition

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 68

651. Which of the following are logical connec- 657. ∪se the logic condition to find the value
tives? of X:A and not B
A. proposition
B. negation
C. division
D. biconditional
E. disjunction

NARAYAN CHANGDER
652. Which of the following is a proposition?
A. His excellency Rodrigo Duterte is the
current president of the CSPC.
B. Obey the officials. A. True
C. Mass testing, please! B. False
D. Do you know who the president of the
Philippines is? 658. Let P:I am in Bangalore.; Q:I love cricket.;
then q → p(q implies p) is?
653. If in a tree level, an ordering is defined, A. I love cricket
then such a tree is called
B. If I am in Bangalore then I love cricket
A. Directed Trees
C. If I love cricket then I am in Bangalore
B. Ordered Trees
C. Rooted Trees D. I am not in Bangalore
D. General Trees 659. 0/ ∈ {0,
/ {0}}
/
654. P∨ ∼ P = T A. true
A. True B. false
B. False
660. In the principle of mathematical induction,
655. A card is randomly selected from a deck which of the following steps is manda-
of cards. What is the probability that the tory?
card is a “spade card”? A. induction hypothesis
A. 1/13
B. inductive reference
B. 1/4
C. induction set assumption
C. 17/52
D. minimal set representation
D. 9/52
656. The set O of odd positive integers less 661. Which is not a method for testing eternal
than 10 can be expressed by truth?

A. {1, 2, 3} A. ∪sing truth tables

B. {1, 3, 5, 7, 9} B. ∪sing the Equivalence Rule
C. {1, 2, 5, 9} C. ∪sing proofs contradiction
D. {1, 5, 7, 9, 11} D. ∪sing the rule of analogy

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 69

662. How many bytes are required to encode B. Contrapositive proofs

2000 bits of data: C. Vacuous proof

PRACTICE BOOK» NOT FOR SALE

A. 2
D. Mathematical Induction
B. 1
C. 3 667. A is a sequence of the form a, ar, ar2,
, ark.
D. 10
A. Sequence
663. is a rectangular array or table of num- B. Notation
bers, symbols, or expressions, arranged in
rows and columns, which is used to repre- C. Arithmetic Progression
sent a mathematical object or a property D. Geometric Progression
of such an object
A. Matrix 668. List the ordered pairs

B. Table
C. Tree
D. Graph

664. A consists of propositional variables

and connectives.
A. Set
B. Propositional
A. Input and Output
C. Function
D. Predicates B. (-1, 1), (-2, 1), (-3, 2), (-4, 2)
C. (1, 1) (2, 4)
665. Decide if this is a regular transition ma-
trix. If it is, solve for its equilibrium vec- D. (1, -1), (1, -2), (2, -3), (2, -4)
tor.
669. Which statement is true when the truth
value of the proposition (∼ p) V r → q is
set to FALSE?
A. p, q and r are TR∪E.
B. p is TR∪E, q is FALSE and r is FALSE.
C. p is TR∪E, q is FALSE and r is TR∪E.

A. Yes, [.39.61] D. p is FALSE, q is TR∪E and r is TR∪E.

B. Yes, [.38.6] 670. Which of these Law of Boolean would

C. Yes, [.61.39] prove the X.X=X:
D. Not a transition matrix A. Idempotent Law
B. Complement Law
666. When to proof P→Q true, we proof P
false, that type of proof is known as C. Double Complement Law
A. Direct proof D. Identity Law

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 70

671. Which of the following statement is the C. empty set

negation of the statement, “2 is even and- D. not a set
3 is negative”?
A. 2 is even and-3 is not negative 677. A sentence that contains variables is
called a
B. 2 is odd and-3 is not negative
A. Predicate
C. 2 is even or-3 is not negative
B. Quantifiers
D. 2 is odd or-3 is not negative

NARAYAN CHANGDER
C. Atomic
672. If A and B are two setsand A ∩ B = AB
D. Domain
A. A = 0/
B. A=B 678. What is p(G|H)?

C. B = 0/ A. The conditional probability of an event

G depends on H.
D. none
B. The conditional probability of an event
673. A is a function from a subset of the H depends on G.
set of integers to a set S. C. Probability of event G independent of
A. Sequence H
B. Notation D. Probability of event G occurring at the
C. Arithmetic Progression same time as H

D. Geometric Progression 679. p → q ≡∼ p ∨ q What is the name of

the equivalence law?
674. A is a binary tree which all levels com-
pletely filled except the last level. The last A. From Morgan Law
level must also be filled from left to right. B. Transposition Law
A. Complete Binary Tree C. Definition of implication
B. Height of Tree D. Double Negation Law
C. Depth of Tree
680. (A ∨ ¬A) ∨ (q ∨ T) is a
D. Size of Tree
A. Tautology
675. Six friends are going to play a ball game. B. Contradiction
Each team has 3 players. How many dif-
ferent team combinations are possible? C. Contingency
A. 120 D. None of the mentioned
B. 6 681. Evaluate the following
C. 18
D. 20

676. If x ∈ N and x is prime, then x is set.

A. Infinite
B. Finite

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 71

A.

PRACTICE BOOK» NOT FOR SALE

A. Permutation
B. B. Combination

685. The shaded area of figure is best de-

scribed by?

C.

D. 42

682. |A1 � A2| = |A1| + |A2|-|A1 ∩ A2| What A. A ∩ B

is the rule? B. A ∪ B
A. Inclusion-exclusion C. A’
B. pigeon nest D. B’
C. Euler
686. Is this mapping a function or not a func-
D. Addition rules tion?

683. List the ordered pairs

A. Function
A. (1, 3), (2, 6), (3, 9), (4, 12) B. Not a Function

B. (3, 1), (6, 2), (9, 3), (12, 4) 687. If 1=1 then 2=3, the conditional state-
C. Input and Output ment is:

D. Output and Input A. False

B. True
684. Permutation, Combination or Nei-
C. Biconditional
ther?Picking a President, Vice-President,
and Secretary from a group of 12. D. None of the above

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 72

688. Let P (x) denote the statement “x >7.” 694. How many vertices are there in the
Which of these have truth value true? graph?
A. P (0)
B. P (4)
C. P (6)
D. P (9)

NARAYAN CHANGDER
689. A well-defined collection of distinct ob-
jects having a common property
A. Group
B. Team
C. Set A. 7
D. I don’t know B. 5
690. What is f(6) for the function f(x)=3x-8 C. 6
A. -8 D. 8
B. 10
695. What is the contrapositive of the state-
C. -144
ment “If I study, then I pass the test”?
D. answer not here
A. I pass if I study
691. Consider the Poset (A = 1, 2, 3, 4, 6, 9, 12, 18, 36, |)
B. If I pass the test, then I study
A. 18, 2
C. If I do not study, then I do not pass
B. 12, 3
D. If I do not pass the test, then I did not
C. 9, 4
study
D. 1, 36
696. The number of edges in a complete graph
692. If P is always against the testimony of
with ‘n’ vertices is equal to:
Q, then the compound statement P→(P v
∼Q) is a A. 2n-1
A. Tautology B. n(n-1)
B. Contradiction C. n2
C. Contingency
D. n(n-1)/2
D. None of the mentioned
697. What is an inverse of-i in the multiplica-
693. How many different five-card hands can tive group if {1, -1, i, -i} is?
be dealt from a standard deck of 52 cards?
A. 1
A. 2, 598, 960
B. 311, 875, 200 B. -1
C. 260 C. i
D. 380, 204, 032 D. -i

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 73

698. An algebraic structure is called a semi- 704. Let R be a non-empty relation on a collec-
group. tion of sets defined by ARB if and only if A
∩ B = Ø Then (pick the TR∪E statement)

PRACTICE BOOK» NOT FOR SALE

A. (Q, +, *)
B. (+, *) A. R is relexive and transitive
C. (P, *) B. R is an equivalence relation
D. (P, +) C. R is symmetric and not transitive

699. The search compares every element D. R is not relexive and not symmetric
against the searching element until it is not
found: 705. Let P:This is a great website, Q:You
should not come back here. Then ‘This is
A. Binary a great website and you should come back
B. Merge here.’ is best represented by?
C. Sequential A. P V Q
D. none of the above B. P ∧ ∼Q
700. The value of 52003 mod 7 is? C. P ∧ Q
A. 3 D. ∼P V ∼Q
B. 4
706. PQ∴P∧Q
C. 8
A. Conjunction
D. 9
B. Simplification
701. A trail in a graph can be described as
C. Ponen mode
A. a walk without repeated edges
D. Removing Mode
B. a cycle with repeated edges
C. a walk with repeated edges 707. Which is not a statement that has been
D. a line graph with one or more vertices proven to be true?
A. Conjecture
702. Choose f as a set of ordered pairs.
B. Theorem
A. {(2, p), (4, q), (5, r)}
C. Lemma
B. {(4, p), (2, q), (5, r)}
C. {(2, p), (4, q), (5, q)} D. Corollary

D. none of above 708. A ∩ (B ∪ C) = (A ∩ B) ∪(A ∩ C) is called:

703. Which of the following relations is a one- A. Distributivity of intersection over
to-one function? union
A. {(0, 2), (0, 4), (0, 5), (0, 6)} B. Distributivity of union over intersec-
B. {(1, 3), (4, 3), (8, 3), (3, 1)} tion
C. {(5, -1), (6, 3), (1, 2), (7, -8)} C. None of these
D. {(1, 2), (3, 4), (-1, -2), (1, 5)} D. Distributivity Law

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 74

709. The shaded area of figure is best de- 714. Range of a function is:
scribed by? A. the maximal set of numbers for which
a function is defined
B. the maximal set of numbers which a
function can take values
C. it is set of natural numbers for which
a function is defined

NARAYAN CHANGDER
D. none of above
A. A‘ (Complement of A)
B. B-(A ∩ B)-(C ∩ B) 715. What is the order of this matrix?

C. A ∩ C ∩ B
D. B’ (Complement of B)

710. A in mathematics defines the relation-

ship between two different sets of infor-
mation.
A. Relation
B. Binary Relation
C. Relation on a Set
D. Function

711. How do we determine if a graph will A. (5 x 2)

have a Euler Circuit? B. (2 x 5)
A. All even degree vertices C. (3 x 1)
B. Exactly 2 odd degree vertices D. (25 x 17)
C. Every Vertex will be used once 716. An is a sequence of the form a, a + d,
D. All odd degree vertices a + 2d, , a + nd.
A. Sequence
712. ⌊6.3 − 2⌋ + ⌈−4.2⌉ − ⌈9.8⌉
B. Notation
A. 10
C. Arithmetic Progression
B. -9
D. Geometric Progression
C. -10
D. -1 717. Which of the following is a proper name
used only for the vertices in a tree?
713. A partition of {1, 2, 3, 4, 5} is the family A. lonely spot
A. {(1, 2, 3), (5)} B. leaf node
B. {(1, 2, ), (3, 4, 5)} C. stem node
C. {�(1, 2), (3, 4), (5)} D. Sibling node
D. {(1, 2), (3, 4), (3, 5)} E. internal node

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 75

718. Edge Type:Endpoints are equal 723. What is the correct order of using Eu-
A. Multiple Edges clidean Division to find the greatest com-
mon divisor of two positive integers.

PRACTICE BOOK» NOT FOR SALE

B. Directed
A. P-Q-R-S
C. ∪ndirected
B. Q-R-P-S
D. Loop
C. S-P-Q-R
719. What is the determinate of A? det(A) D. This division is wrong

724. How many conditions are there to prove

for the given set us a field?
A. 5
B. 8
C. 9
A. 10
D. 11
B. 2
725. Which of the following graphs is isomor-
C. 4
phic to
D. -2

720. The greatest lower bound of {10, 30} in

D30
A. 1
B. 10
C. 2
D. 3
A. A
721. Rules of inference theory in quantifiers B. B
includes
C. C
A. ∪niversal specification
D. D
B. Existential specification
726. Evaluate 12C4
C. ∪niversal generalization
A. 479, 001, 600
D. Existential Generalization.
B. 40, 320
E. all of the above
C. 11, 880
722. Determine the inverse for the function:R D. 495
(x) = 2x + 1
x−1 727. The second step of an indirect proof is to
A. R-1(x) = 2 ?
x+1
B. R-1(x) = 2 A. assume the negation of the given
C. R-1(x) = x − 3 B. assume the negation of what you are
D. R-1(x) = x + 3 trying to prove

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 76

C. conclude the prove is true 731. Power set of empty set has exactly
D. contradict the given using logical state- subset.
ments based on the initial assumption A. 1

728. D = {composite numbers between 40 and 48}B. 2

Describe set D by using set-builder nota- C. 0
tion! D. 3
A. D = {x : 40 < x < 48, x ∈ composite number}

NARAYAN CHANGDER
732. The node which has outdegree 0 is called
an
B. D = {x : x ∈ composite number, 40 ≤ x ≤ 48}
A. External Node/Terminal Node
B. Ordered Trees
C. D = {x : 41 < x < 47, x ∈ composite number}
C. Rooted Trees
D. D = {x : x ∈ composite number, 40 < x ≤ 48}
D. General Trees

729. What is the valence of vertex E in the 733. Which of the following is true?
graph? A. A graph may contain no edges and
many vertices
B. A graph may contain many edges and
no vertices
C. A graph may contain no edges and no
vertices
D. A graph may contain no vertices and
many edges

734. What do you call, a drawing that can be

used to show how sets are related?
A. 2 A. Ben Diagram
B. 4 B. Venn Diagram
C. 5 C. Venn diagram
D. 11 D. Wine Diagram
730. At Papa John’s you are deciding on what 735. if A x B = B x A, (where A and B are
you want for dinner. The pizza offers 8 general matrices) then
different meats, 4 different cheeses, 3 dif- A. A =
ferent crust types and 2 different sauces.
How many different pizzas do you have to B. A = B’
choose from? C. B = A
A. 192 D. A’ = B
B. 55, 000 736. Given the function f (x) = x +9 g (x) =
C. 7965 2x − 5 g f (2)?
D. 255 A. 17

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 77

B. 0 742. ∼ A v ∼ B is logically equivalent to?

C. 8 A. ∼ A → ∼ B

PRACTICE BOOK» NOT FOR SALE

D. 5 B. ∼ A ∧ ∼ B
737. is a statement that is based on inductive C. A → ∼B
reasoning but has not yet been shown to
be true. D. B V A
A. Inductive 743. An example of a simple proposition is:
B. Conjecture
A. Cat
738. “A rhinoceros’ horn is made of hair.”
B. Her cat is brown
C. Is brown
D. Her cat

744. is a shorthand for multiplication of

list of consecutive, descending natural/
counting numbers.
A. Proposition
A. Factorial Notation
B. Not proposition
B. Permutation
739. A is a connected undirected graph
C. Combination
with no simple circuits.
A. Tree D. Counting
B. Acrylic Graph 745. In Cora’s punnet, there are 6 mango, 7
C. General Tree lemon, and 8 strawberries. If one fruit
D. Function is selected randomly, solve the probabil-
ity that she will select a strawberry or a
740. Which of the following is true according mango
to the statement:A = the set of people who
speak Filipino. B = the set of people who A. 1/3
can speak Spanish B. 2/3
A. A ⊆ B C. 8/21
B. A ⊆ B and B ⊆ A
D. 2/7
C. B ⊆ A
D. A ̸⊂ B 746. How many ways can 8 prizes be given
away to 7 students, if each student is eli-
741. If R = {x, y):x, y Î Z, x2 + y2 £4} is a gible for all the prizes?
relation in z, then domain of R is
A. 40325
A. {0, 1, 2}
B. {-2, -1, 0} B. 40520

C. {-2, -1, 0, 1, 2} C. 40320

D. None of these D. 40720

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 78

747. R is an equivalence relationship if R 752. Is the relation a function?

has the following properties except which
one?
A. Symmetric
B. Reflexive
C. Antisymmetric

NARAYAN CHANGDER
D. Transitive

748. Determine the inverse for the function:P

(x) = 2x2 + 1
x2 −1
A. YES
A. P-1(x) = 2
2
B. NO
B. P-1(x) = x 2+1
√ 753. Which statement is true about random
C. P-1(x) = x−1 2 variables?
√
A. is the random value of the result
D. P-1(x) = x+1 2
B. It is an unknown variable in the exper-
749. Find the inverse f(x)=2x-2 iment.

A. f-1(x)=1/2x+1 C. It is a function that connects the pat-

tern of results to real numbers.
B. f-1(x)=-2-1/2x
D. Values are in the range [0, 1].
C. f-1(x)=-7/3x-20/3
754. A sequence of statements, premises, that
D. 2-2/5x
end with a conclusion.
750. What is the set builder notation equiva- A. Arguments
lent of {-4, -3, -2, -1, 0, 1, 2, 3, 4}
B. Fallacy
A. {x | x is an integer such that x = 0}
C. Validity
B. {x ∈ � | x >-4}
D. Statement
C. {x | x is real number less than or equal
to 4} 755. The rank of the incidence matrix of any
connected graph G with n vertices is
D. {x ∈ Z |-5 < x < 5}
A. n
751. The probability that Kathy will not be B. n+1
hired in her job is 1/3. What is the prob-
ability that she will be hired? C. n-1

A. 1/2 D. n-2

B. 1/3 756. p v q:It is raining or it is cold.

C. 1/4 A. Conjunction
D. 2/3 B. Disjunction

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 79

757. The Pizza Palace at the mall offers two 761. Contra-positive of the given statement
different size pizzas and has 15 topping “If two angles are congruent, then they
options. How many different pizzas are have the same measure” is:

PRACTICE BOOK» NOT FOR SALE

possible if no double toppings or half top- A. If two angles are congruent, then they
pings are possible? have not the same measure
A. 65, 536 B. If two angles are not congruent, then
B. 450 they have the same measure
C. 256 C. If two angles do not have the same
D. 210 measure, then they are not congruent
D. None of these
758. If you draw one card from a standard
deck, what is the probability of drawing 762. How many numbers of three digits can be
a 5 or a diamond? formed with digits 1, 3, 5, 7 and 9?
A. 983
B. 120
C. 345
D. 430
763. Let a graph can be denoted as ncfkedn a
kind of
A. cycle graph
B. line graph
C. hamiltonian graph
A. 2/52 D. path graph
B. 4/52
764. A method that allows a programmer to
C. 16/52 represent the algorithm in a more program-
D. 26/52 ming related way; also called false codes.
A. Computer Programming
759. Does this sequence converge or diverge?
1 B. Programming Language
3 , 1, 3, 9,
A. Converges to 0 C. Programming Algorithm
B. Converges to 1 D. Pseudocode
C. Converges to 3 765. Is relation shown a function?
D. Diverges
760. If the degree of any vertex is one, then
that vertex is called
A. Isolated vertex
B. Adjacent vertex
C. Pendent vertex
D. Not Adjacent vertex

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 80

A. YES 771. R is a relation on N given by N = {(x,

y):4x + 3y = 20}. Which of the following
B. NO
belongs to R?
766. Let A={1, 2, 3}, and R is {(1, 1), (1, 2), A. (-4, 12)
(1, 3), (2, 2), (2, 3), (3, 3)}, then R is B. (5, 0)
A. reflexive but not symmetric C. (3, 4)
B. symmetric and transitive D. (2, 4)

NARAYAN CHANGDER
C. reflexive but not transitive 772. Which of the following sets of truth val-
ues would correctly complete this truth ta-
D. neither symmetric nor transitive
ble?
767. {1, i, -i, -1} is
A. subgroup
B. cyclic group
A. F F F T
C. semigroup
B. F T T F
D. abelian group
C. T F T T
768. Which set of values is a function? D. F T F T
A. (9, 5) (10, 5) (9, -5) (10, -5) 773. Collection of ordered pairs is:
B. (3, 4) (4, -3) (7, 4) (3, 8) A. relation
C. (6, -5) (7, -3) (8, -1) (9, 1) B. set

D. (2, -2) (5, 9) (5, -7) (1, 4) C. proposition

D. function
769. The set of prime numbers between 10
774. How many subsets of a set have 5 ele-
and 30 is
ments?
A. {11, 13, 15, 17, 19, 21, 23, 25, 27, 29} A. 10
B. 32
B. {11, 13, 17, 19, 23, 27, 29}
C. 5
C. {11, 13, 17, 19, 23, 29} D. 25
D. {11, 13, 17, 23, 29} E. 15

770. A proof that p → q is true based on the 775. Graph Type:consists of set of vertices V,
fact that q is true, such proofs are known set of Edges E and a function f from E to
as {{u, v}| u, v V}. The edges e1 and e2 are
multiple edges if f(e1) = f(e2).
A. Direct proof
A. Simple Graph
B. Contrapositive proofs B. Multigraph
C. Trivial proof C. Directed Multigraph
D. Proof by cases D. Directed Graph

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 81

776. a from A to B is a set R of ordered 781. All of the y values or outputs are called
pairs where the first element of each or- what?
dered pair comes from A and the second

PRACTICE BOOK» NOT FOR SALE

element comes from B A. Domain

A. Relation B. Range
B. Binary Relation C. Relation
C. Relation on a Set
D. Function
D. Function
777. A partial ordered relation is transitive, 782. Proof involving indirect reasoning. Also
antisymmetric and: called proof by contradiction
A. reflexive A. Direct reasoning
B. bisymmetric B. Indirect reasoning
C. anti reflexive
C. Direct proof
D. none of the above
D. Indirect Proof
778. Which of the following combinations of
truth values would be correct for this truth
783. Given that the roots of the characteris-
table?
tic equation are 2, 3, 3, what will be the
homogeneous solution?
A. an = k1 2n + k2 3n + k3 3n
B. an = k1 2n + k2 3n + k3 n3n
A. T F T F
C. an = k1 + k2 2n + k3 3n
B. T T T F
C. F T F T D. an = 2n + 2n + 3n
D. T F F T
784. Two sets are called disjoint if there is
779. What is the inverse of the points (1, 3)(2, a empty set.
4)(6, 2)
A. ∪nion
A. (2, 6)(3, 1)(4, 2)
B. (-3, -1)(-4, -2)(-2, -6) B. Difference
C. (1, 3)(2, 4)(6, 2) C. Intersection
D. (-1, -3)(-2, -4)(-6, -2) D. Compliment
780. If the outdegree of every node is less
than or equal to 2, the directed tree is 785. Kruskal’s algorithm is used to
called a
A. find minimum spanning tree
A. Binary Tree
B. find single source shortest path
B. Height of Tree
C. Depth of Tree C. find all pair shortest path algorithm
D. Size of Tree D. traverse the graph

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 82

786. At the frozen yogurt shop, there are 12 B. 7/20

different toppings you can add to your C. 7/10
frozen yogurt. If you can get your yo-
gurt plain or with every topping possible, D. 3/10
how many different ways can you get your 790. a * H = H * a relation holds if
frozen yogurt?
A. H is semigroup of an abelian group
A. 4096
B. H is monoid of a group
B. 144

NARAYAN CHANGDER
C. H is a cyclic group
C. 66
D. H is subgroup of an abelian group
D. 132
791. In a group of 267 people how many
787. Let R = {(1, 3), (4, 2), (2, 4), (2, 3), (3, friends are there who have an identical
1)} be a relation on the set A = {1, 2, 3, number of friends in that group?
4}. The relation R is
A. 2
A. A function
B. 202
B. Transitive
C. 266
C. Not symmetric
D. 138
D. Reflexive
792. C = {x|x ∈ P ∧ x � Q} is the same set as
788. Which among the following can be taken which set?
as the discrete object? A. P-Q
A. people B. P � Q
B. Rational numbers C. P ∩ Q
C. all of the options D. P ∆ Q
D. houses
793. An isomorphism of graphs G and H is a bi-
789. What is the probability of pulling a red jection f the vertex sets of G and H. Such
marble out of a jar of marbles that have 10 that any two vertices u and v of G are ad-
green marbles, 7 red marbles and 3 blue jacent in G if and only if
marbles? A. f(u) and f(v) are contained in G but not
contained in H
B. f(u) and f(v) are adjacent in H
C. f(u * v) = f(u) + f(v)
D. f(u) = f(u)2 + f(v)2

794. What content from the Calculus course

can be used to compare the performance
of algorithms?
A. infinite limit
B. infinite series
A. 1/7 C. Irregular integrals

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 83

D. partial derivative 800. The universal relation A x A on A is

E. Sangyut A. anti-symmetric

PRACTICE BOOK» NOT FOR SALE

795. In how many ways can 5 balls be chosen B. an equivalence relation
so that 2 are red and 3 are black C. a partial ordering relation
A. 968 D. not symmetric and not anti-symmetric
B. 990 801. Which is true about sets? (There may be
C. 864 multiple answers. Answer them all.)
D. 1028 A. Member enumeration is written within
a symbol ( ), separating each member with
796. R is a partially ordered relation when a symbol, .
R has which of the following properties?
(There are many answers. Choose all. B. Can have repeat members

A. reflect C. Can have a set of members

B. Antisymmetric D. No membership required.

C. relay E. There is an unlimited number of mem-

bers.
D. symmetrical
802. Simplify this
E. 1-1

797. 3 A group (M, *) is said to be abelian

if A) (x+y)=(y+x)B) (x*y)=(y*x)C)
(x+y)=xD) (y*x)=(x+y)
A. OPTION A
B. OPTION B
C. OPTION C
D. OPTION D

798. Evaluate 7C7 A. 90

A. 5040 B. 2

B. 49 C. 1/2

C. 7 D. none of these

D. 1 803. What is the probability that you choose

blue? *simplify5 green6 yellow8 blue7
799. Graph Type:consists of V, a nonempty brown
set of vertices, and E, a set of unordered
pairs of distinct elements of V called edges
(undirected)
A. Simple Graph
B. Multigraph
C. Pseudograph
D. Directed Graph

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 84

A. 8/26 808. What is the converse of the statement “If

it is Sunday, then I don’t go to school”?
B. 4/13
A. If it is not Sunday, then I do not go to
C. 8/25
school.
D. 1/3 B. If I go to school, then it is not Sunday
804. This symbol, ∧, means? C. If I do not go to school, then it is Sun-
day.
A. and

NARAYAN CHANGDER
D. If it is not Sunday, then I go to school
B. or
809. For the function {(0, 1), (1, -3), (2, -4),
C. not (-4, 1)}, write the domain and range.
D. if, then A. D:{1, -3, -4, } R:{0, 1, 2, -4}

805. If R is a relation “Less Than” from A = B. D:{0, 1, 2, -4} R:{1, -3, -4}
{1, 2, 3, 4} to B = {1, 3, 5} then RoR-1 is C. D:{0, 1, 2, 3, 4} R:{1, -3, -4}
A. {(1, 3), (1, 5), (2, 3), (2, 5), (3, 5), (4, D. none of above
5)}
810. There are numbers of Boolean func-
B. {(3, 3), (3, 5), (5, 3), (5, 5)} tions of degree n.
C. {(3, 3), (3, 4), (3, 5)} A. None of these
D. {(3, 1), (5, 1), (3, 2), (5, 2), (5, 3), (5, B. n
4)} C. Yes
806. A bag contains 25 balls such as 10 balls D. 2(2*n)
are red, 7 are white and 8 are blue. What
811. A relation R is from set A to B and a re-
is the minimum number of balls that must
lation S from set B to C. Then is from
be picked up from the bag blindfolded
(without replacing any of it) to be assured A. Set C to A
of picking at least one ball of each colour? B. Set A to C
A. 10 C. Does not exist
B. 18 D. None of these
C. 63 812. If X = {1, 2, 3, 4, 5} and Y = {2, 4, 5, 6,
D. 35 8} then X-Y equals to
A. {6, 8}
807. A is a binary tree in which all the
B. {1, 3}
leaves are on the same level and every
non-leaf node has two children. C. {4, 5}

A. Full Binary Tree D. {1, 6}

B. Height of Tree 813. What is the number of vertices in an undi-

rected connected graph with 39 edges, 7
C. Depth of Tree
vertices of degree 2, 2 vertices of degree
D. Size of Tree 5 and remaining of degree 6?

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 85

A. 11 819. Determine whether each molecular state-

B. 14 ment below is true or false, or whether it
is impossible to determine. Assume you

PRACTICE BOOK» NOT FOR SALE

C. 18 do not know what my favorite number is
D. 19 (but you do know that 13 is prime). “If
13 is not prime, then 13 is my favorite
814. R is a relation from {11, 12, 13} to {8, number.”
10, 12} defined by y = x-3. The relation
R-1 is A. True

A. {(11, 8), (13, 10)} B. False

B. {(8, 11), (10, 13)}
820. How many edges are there for each ver-
C. {(8, 11), (9, 12), (10, 13)} tices in a complete graph G with n vertices
D. None of the above A. n
815. Which among the choices below is NOT a B. n+1
type of mathematical proof
C. n-1
A. Direct Proof
D. None of the above
B. Proof by Induction
C. Proof by Contrapositive 821. What is the total population after 16
months? round to the whole mammal.
D. Indirect Proof

816. is the ∪niversal logic gate:

A. AND
B. NAND
C. NOT A. 55
D. OR B. 143
817. Which of the following is Absorption C. 170
Law?
D. 449
A. a+(a*b)<=> a
B. a*a <=>a 822. There are four ways to write a real-
tion:listing of ordered pairs, mapping, ta-
C. a*b <=>a*a
ble of values and graphing.
D. a*b <=>a*a
A. TR∪E
818. The primary use of the Boolean algebra
B. FALSE
is :
A. to design the digital computers 823. The Cartesian Product B x A is equal to
B. in circuit theory the Cartesian product A x B.

C. to build the logic symbols A. TR∪E

D. to build algebraic functions B. FALSE

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 86

824. The inclusion of sets into R = {{1, 2}, 829. Picking a team of three people out of a
{1, 2, 3}, {1, 3, 5}, {1, 2, 4}, {1, 2, 3, 4, group of 10.
5}} is necessary and sufficient to make R
a complete lattice under the partial order
defined by set containment.
A. {1}, {2, 4}
B. {1}, {2, 4}

NARAYAN CHANGDER
C. {1}
D. {1}, {1, 3}, {1, 2, 3, 4}, {1, 2, 3, 5} A. Permutation
B. Combination
825. No of variable statement = 2 then the
truth table needs C. Neither

A. 4 rows D. none of above

B. 5 rows 830. It is concerned with statements to which

C. 8 rows the truth values, “true” and “false”, can
be assigned.
D. 2 rows
A. Predicate
826. Which is the method for testing eternal B. Function
truth? (There are many answers. Answer
them all) C. Proposition Logic

A. ∪sing truth tables D. Statement

B. ∪sing proofs contradiction 831. A student has a maximum of 720 words

from a combination of letters of a word
C. ∪sing the rule of analogy
given word is:
D. ∪sing the Equivalence Rule
A. CANADA
E. An example in which a statement has
B. ENGLAND
a truth value is true.
C. WASHINGTON
827. ¬ (A ∨ q) ∧ (A ∧ q) is a
D. None the above
A. Contradiction
832. Determine if the relation is a function
B. None of the mentioned
C. Contingency
D. Tautology

828. Picking a team of three people out of a

group of 10.
A. Permutation
B. Combination
C. Neither A. Not a function, each input has more
D. none of above than one output

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 87

B. Yes it is a function, because each input A. “A positive integer is a composite if it

has exactly on output has divisors other than 1 and itself.”

PRACTICE BOOK» NOT FOR SALE

C. Not a function, input is equal to output B. “If a positive integer has no divisors
D. Yes it is a function, -1/2 is a fraction of other than 1 and itself, then it is not com-
2 posite.”
C. “If a positive integer is not composite,
833. A subset f of B x A is said to be a function then it has no divisors other than 1 and it-
from B to A if the domain of f is B and the self.”
first element of order pairs of f:
D. None of the mentioned
A. does not repeat
B. does not exist 838. A bag has 3 red marbles, 2 blue and 4 yel-
low. What is the theoretical probability of
C. repeat pulling a red?
D. members of A

834. Evaluate

A. A
B. B
C. C
A. 3/10
D. D
B. 3/9
835. ¬ (p ↔ q) is logically equivalent to
C. 1/9
A. q↔p
D. 1/3
B. p↔¬q
839. Set theory was developed in which year.
C. ¬p↔¬q
A. 1895
D. ¬q↔¬p
B. 1900
836. Let R = {(1, 2), (3, 4)}
C. 1995
A. R is reflexive
D. 2000
B. R is symmetric
C. R is an equivalence relation 840. A generalization of the simple concept of
a set of dots, links, edges, or arcs
D. R is Transitive
A. Graph
837. What are the inverse of the conditional B. Edge Type:Directed
statement “ A positive integer is a com-
posite only if it has divisors other than 1 C. Edge Type:∪ndirected
and itself.” D. Edge Type:Loop

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 88

841. Which of the following is an ordered col- 847. f (n) = 2n2 + 3n + 4

lection of objects? A. Na
A. Relation B. n logn
B. Function C. Yes
C. Set D. n
D. Proposition E. that

NARAYAN CHANGDER
842. Evaluate 6! 848. Commutative is not satisfied in
A. 21 A. permutation
B. 30 B. combination
C. 120 849. In an undirected graph the number of
D. 720 nodes with odd degree must be:
A. odd
843. The graph given below is an example of
30.Algebra of logic is termed as B. prime
A. Numerical logic C. even

B. Boolean algebra D. zero

C. Arithmetic logic 850. A is a path that visits each vertex

exactly once.
D. Boolean number
A. Hamiltonian Path
844. (P ∧ Q) →∼ P is a
B. Hamiltonian Cycle
A. Tautology
C. Eulerian Path
B. Contradiction D. Eulerian Cycle
C. Contigency
851. A is a tree in which one vertex has
D. None of these been designated as the root and every
edge is directed away from the root.
845. The total number of degrees of an iso-
lated node is A. External Node/Terminal Node
A. 1 B. Internal Node
B. 4 C. Rooted Trees

C. 3 D. General Trees

D. 0 852. If two cycle graphs Gm and Gn are joined

together with a vertex, the number of
846. The study of reasoning. spanning trees in the new graph is
A. Logic A. m+n-1
B. Gates B. m-n
C. Math C. m*n
D. Numbers D. m*n+1

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 89

853. A proof that can be used when there are

only two possibilities; if one possibility is B.
false, the other must be true.

PRACTICE BOOK» NOT FOR SALE

A. direct proof
B. indirect proof C.
C. conclusion
D. none of above

854. (A�B)∩C=(A∩C)�(B∩C) is the identity of D.

which set?
A. Distributive law 858. How many ways are there to arrange 7
B. De Morgan law chocolate biscuits and 12 cheesecake bis-
cuits into a row of 19 biscuits?
C. Complementary rules (Complementa-
tion law) A. 52347
D. Idempotent law B. 87658
C. 24976
855. Consider the relation R of divisibility on
the set of Z of integers. Then the relation D. 50388
R is 859. Consider two positive numbers a and b
A. Reflexive and anti symmetric less than one, where the maximum values
of Ceil(a+b) and Floor(a+b) is:
B. Reflexive but not anti symmetric
A. Ceil(a+b) is 1 and Floor(a+b) is 2
C. anti symmetric but not reflexive
B. Ceil(a+b) is 2 and Floor(a+b) is 1
D. Neither reflexive nor anti symmetric
C. Ceil(a+b) is 0 and Floor(a+b) is 1
856. Which statement is true about proving D. Ceil(a+b) is 1 and Floor(a+b) is 0
P(x) using mathematical induction?
860. Is the relation a function? Why.
A. The inductive step begins by assuming
that P(k) is true.
B. ∪sed to show that P(x) is true for ev-
ery positive real number.
C. Basically, it only proves that P(1) is
true.
D. Since P(k) is true, we immediately con- A. Yes, because the x-value 11 has two y-
clude that P(n) is true. values pair with it.
857. Which of the following is the identity ma- B. Yes, because each x-value has only
trix I3 one y-value paired with it.
C. No, because the x-value 11 has two y-
values pair with it.
A.
D. No, because each x-value has only one
y-value paired with it.

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 90

861. In drawing a Venn diagram of the three 865. Is the given Graph is regular?
sets A, B, and C, which set is the shaded
region?

NARAYAN CHANGDER
A. Yes
B. No
A. (A ∪ B)-C
B. (A ∩ B)-C 866. The set operation that contains the ele-
ments that the two sets have in common,
C. (A-B) ∩ C
it is where the two sets overlap.
D. C-(A ∪ B)
A. Complementation
E. C-(A ∩ B)
B. Difference
862. The degree of any vertex of graph is C. ∪nion
?
D. Intersection
A. The number of edges incident with ver-
tex 867. An integer n is if, and only if, n is
B. Number of vertex in a graph equals twice some integer.

C. Number of vertices adjacent to that A. Composite

vertex B. Prime
D. Number of edges in a graph C. Even
863. The first step of an indirect proof is to D. Odd
?
868. Which of the following is De-Morgan’s
A. write the given law?
B. assume the negation of the given A. P ∧ (Q v R) ≡ (P ∧ Q) v (P ∧ R)
C. assume the negation of what you are B. P v ∼P ≡ True, P ∧ ∼P ≡ False
trying to prove
C. None of the mentioned
D. contradict the given
D. ∼(P ∧ R) ≡ ∼P v ∼R, ∼(P v R) ≡ ∼P
864. Positive integers that have exactly two ∧ ∼R
different positive integer factors are called
869. A → (A ∨ q) is a
A. Composite A. Tautology
B. Prime B. Contradiction
C. Even C. Contingency
D. Odd D. None of the mentioned

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 91

870. Which statement is true about Simple 875. Consider the binary relation R = {(x, y),
undirected graph? (x, z), (z, x), (z, y)} on the set {x, y, z}.
Which one of the following is TR∪E?

PRACTICE BOOK» NOT FOR SALE

A. There are no parallel lines.
B. no loop A. R is symmetric but NOT antisymmetric
C. no direction B. R is NOT symmetric but antisymmetric
D. not linked C. R is both symmetric and antisymmetric
E. no cycle
D. R is neither symmetric nor antisym-
871. If a and b are given to be integers and metric
a|b where a � 0, which statement is not
true? (There may be many answers. An- 876. The converse of the conditional state-
swer them all) ment q → p is:
A. There is an integer c such that ac = b. A. p → q
B. a/b = 0 B. p → �q
C. If b = 1 then a = 1 or a =-1 C. �p → q
D. b is a factor of a
D. None of the above
E. a ≡ 0 mod b

872. A set of instructions/rules to be followed 877. P→QQ→R∴P→R

by a computer program which should con- A. Hypothetical Syllogism
tain an input, process and an output.
B. Destructive Dilemma
A. Computer Programming
C. Removing Mode
B. Programming Language
C. Programming Algorithm D. Setting Mode
D. Pseudocode
878. Which of the following is true according
873. Which of the following relations is a one- to the statement:A = the set of teachers at
to-one function? PLM. B = the set of teachers at PLM CET
A. A ⊆ B
B. A ⊆ B and B ⊆ A
C. B ⊆ A
D. A ̸⊂ B
A. (a)
B. (b) 879. Which of the following is/are the univer-
sal logic gates?
C. (c)
D. None of these A. NAND and NOR

874. The integer 2821 is a Carmichael number. B. NOT

A. True C. OR and NOR

B. False D. AND

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 92

880. This matrix shows the sales of the local B. 3-7-5-2-0-4

fruit and vegetable store. How many Car-
C. 3-2-0-4
rots were sold over the weekend?
D. 3-7-5-1-4

885. A number of elements in a set is called:

A. Finite
A. 145 B. Cardinality

NARAYAN CHANGDER
B. 100 C. Strength
C. 53 D. None of the above
D. 47
886. Is a proposition and a statement the
881. ‘She is beautiful’ is a same thing?
A. Statement A. Yes
B. Sentence B. Not
C. Cannot determined
887. A graph G is called a if it is a con-
D. None of these nected acyclic graph:
882. Which of the following option is true? A. Cyclic graph
A. If the Sun is a planet, elephants will fly B. Tree
B. 3 +2 = 8 if 5-2 = 7 C. Regular graph
C. 1 > 3 and 3 is a positive integer D. Not graph
D. -2 > 3 or 3 is a negative integer
888. A menu has 6 different sandwiches, with
883. Which is not true about the proof of func- 3 choices of potato chips, 3 types of salad
tion 1-1? and 5 different beverages. How many dif-
A. Verify 1-1 by assuming f(x1) = f(x2) ferent lunch combinations consisting of a
and getting x1 = x2. sandwich, chips and beverage can be or-
dered?
B. 1-1 can be rejected by selecting y with
two x such that f(x) = y. A. 330
C. A linear function is a 1-1 function. B. 25
D. A polynomial function is a 1-1 function. C. 489
884. What is the shortest path from 3 to 4? D. 270

889. The minimized expression of ABC +

A BC + ABC + ABC is
A. A +
B. BC
C. C
A. 3-7-5-0-4 D. C

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 93

890. Which graph does NOT pass the vertical 894. Which type of graph has all the vertex of
line test? the first set connected to all the vertex of
the second set?

PRACTICE BOOK» NOT FOR SALE

A. Regular Graph
B. Wheel
C. Bipartite Graph
D. Complete Bipartite Graph

895. What is the number of edges present in

a complete graph having n vertices?
A. (n*(n+1))/2
A. Graph 1
B. (n*(n-1))/2
B. Graph 2
C. Graph 3 C. n

D. Graph 4 D. Information given is insufficient

891. A is a sequence of edges that be- 896. This graph will have a Euler Circuit.
gins at a vertex of a graph and travels
along edges of the graph, always connect-
ing pairs of adjacent vertices.
A. Simple Graph
B. Subgraph
C. Path
D. Directed Graph
A. True
892. What rule of inference is used here¿‘It is B. False
cloudy and drizzling now. Therefore, it is
cloudy now.” 897. If P = {0, 1, 2, 3, 4}, Q = {4, 6, 8} R = {6,
A. Addition 12, 18} Then what is (P ∩ Q) � (Q ∩ R)?
B. Simplification A. {4}
C. Resolution B. {4, 6}
D. Conjunction C. {4, 6, 8}
893. If k is a positive integer and k + 1 or more D. {1, 2, 3, 4, 6, 8}
objects are placed into k boxes, then there
is at least one box containing two or more 898. The complete graph with four vertices
objects. has k edges where k is:

A. Pigeonhole Principle A. 3
B. Sum Rule B. 4
C. Subtraction Rule C. 5
D. Division Rule D. 6

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 94

899. Which of the following is the Leslie Ma- 903. A relation R is defined on the set of pos-
trix for this Model? itive integers as xRy if 2x + y ≤ 5. The
realation R is
A. reflexive
B. transitive
C. symmetric
D. none

NARAYAN CHANGDER
A.
904. An incorrect reasoning or mistake which
leads to invalid arguments.
A. Contra-Positive
B. B. Arguments
C. Fallacy
D. Validity

C. / ⊂ {0,
905. {{0}} / {0}}
/
A. true
B. false
D. none of above
906. A ∧ ¬(A ∨ (A ∧ T)) is always
900. Which of the following is not a well
formed formula? A. True
A. ∀x [P (x) → f (X) ∧ x] B. False
B. ∀x1 ∀x2 ∀x3 [(x1 = x2 ∧ x2 = x3 ) =⇒ x1 C.= Neither
x3 ] true nor false
D. None of the above
C. ∼ (p → q) → q
907. The logical connective used for the com-
D. [T ∨ P (a, b)] → ∃zQ (z) pound statement p and q is?

901. Discrete Mathematics plays important A. →

role in B. V
A. Cryptography C. ∧
B. Tamil literature D. ↔
C. game theory
908. If A = {1, 3, 5, 7, 9} and B = {2, 3, 5, 7},
D. inventory what is A ∩ B?

902. The is ∃ and is read “there exists” or A. {3, 5, 7}

“there is.” B. {2, 3, 5, 7}
A. existential quantifier C. {2, 3, 5, 7, 9}
B. universal quantifier D. {1, 2, 3, 5, 7, 9}

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 95

909. Choose the correct option 913. ∪PS creates each employee a 10 digit ID
number using the numbers 0-9. The num-
bers cannot be repeated, how many differ-

PRACTICE BOOK» NOT FOR SALE

ent ID numbers are possible?
A. 3, 628, 800
B. 362, 880
C. 100
A. K4 is planar while Q3 is not
D. 90
B. K4 and Q3 both are planar
914. Which is incorrect regarding “problems”
C. Q3 is planar while K4 is not
and “algorithms”? (There may be multi-
D. Neither of K4 nor Q3 is planar ple answers. Answer them all)
910. What is the largest prime number used A. A computational problem has only one
in division to test whether 83 is a prime solution.
number or not? B. An algorithm is a sequence of compu-
A. 7 tational steps that converts an input into
B. 11 a desired output.
C. 3 C. The size of a computational problem is
the number of variables contained in the
D. 79
problem.
E. 9
D. Example of a set problem is to sort
911. If G1 and G2 are isomorphic then G1 and data
G2 have
915. This symbol, ∨, means?
A. The same number of vertices and
edges A. and
B. The different number of vertices and B. or
edges C. not
C. The different number of vertices and D. if, then
same number of edges
D. None of the above 916. Calculate the determinant

912. What element is at a32

A. 7 A. 0
B. 1 B. none
C. 3 C. -32
D. 5 D. -8

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 96

917. Permutation, Combination or Nei- 921. Which is not an application of number the-
ther?Choosing 3 toppings for your sundae ory?
out of a list of 15. A. Finding the highest and lowest value of
a function
B. Message encoding
C. Hash data structure
D. base number conversion

NARAYAN CHANGDER
922. What is the number of edges present in
a cycle having n vertices?
A. Permutation A. n+1
B. that
B. Combination
C. n/2
C. Neither
D. n
D. none of above
923. The is the total number of nodes.
918. Euclidean method of division to find the A. Binary Tree
base 8 number of 317. What are the first B. Height of Tree
and second rounds of division? (Choose 2
C. Depth of Tree
answers)
D. Size of Tree
A. 317 = 8 * 39 + 5
924. A function is defined by f(x)=2x and f(x
B. 39 = 8 * 4 + 7
+ y) = f(x) + f(y) is called
C. 39 = 5 * 7 + 4 A. isomorphic
D. 312 = 39 * 8 B. homomorphic
E. 317 = 16 * 19 + 13 C. cyclic group
D. heteromorphic
919. How many different bit strings are there
of length ten? 925. Representing a set by using the set
builder notation is called (Select all
A. 32 that APPLIES.)
B. 64 A. Definition by property
C. 456 B. Roster Method
D. 1024 C. Rule Method
D. Listing
920. Which of the following pair is not congru-
ent modulo 7? 926. In an undirected graph, The numbers of
odd degree vertices are
A. 10, 32
A. Odd
B. -21, 23 B. Odd and Even
C. 25, 56 C. Even
D. None of the above D. None of the above

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS

1.1 DISCRETE MATHEMATICS 97

927. What is logically equivalent to the follow- 932. For summer reading, students must
ing statements? “ I pass only if you pass” choose one of 5 novels, one of 4 biogra-
(Note that is equivalent to not pass.) phies, one of 7 non-fiction book, and one

PRACTICE BOOK» NOT FOR SALE

of 6 self-improvement books. How many
A. You pass only if I pass
ways can students choose 4 books for sum-
B. If you fail then I fail mer reading?
C. If you pass then I pass A. 840
D. You fail if I pass B. 212, 520
C. 8855
928. If the bits of Y = 100110 and the bits
of X = 001101, then the output of the X D. 1680
(Ex-or) Y will be:
933. A of a graph G = (V, E) is a graph H
A. 101011 =(V’, E’) where V’ is a subset of V and E’
is a subset of E
B. 1101010
A. Simple Graph
C. 101000
B. Subgraph
D. 0010101
C. Directed Multigraph
929. Negative/positive. They are those D. Directed Graph
propositions that:
934. Let P:You are wonderfully created.;
A. Express a state of affairs (the positive Q:You are always loved.; then p → q (p
ones) or the very absence of that state implies q) is?
(the negative ones).
A. If you are wonderfully created, then
B. Express a state of affairs (the negative you are always loved.
ones) or the very absence of that state
(the positive ones). B. If you are always loved, then you are
wonderfully created.
930. x ∈ {x} C. You are not wonderfully created and
A. true you are not always loved.
D. You are not always loved if you are not
B. false
wonderfully created.
931. One card is drawn from a standard deck 935. If p= It is raining q = She will go to col-
of 52 cards. What is the probability that lege “It is raining and she will not go to
the card drawn is a face card? college” will be denoted by:
A. 5/13 A. p ∧ �q
B. 3/13 B. q ∧ �p
C. 1/4 C. q ∧ p
D. 1/13 D. None of these

CHECK GOOGLE PLAY BOOKS FOR ANSWERS KEYS