Subject code: 17UMA6C15 Title of the Paper: DISCRETE MATHEMATICS

JAMAL MOHAMED COLLEGE (Autonomous)

TIRUCHIRAPPALLI - 620 020

Department of MATHEMATICS Semester: 6 UG: III year

Objective type questions

1. A compound proposition that is always ______ is called a tautology.

a) True b) False c) Contingency d) None

2. A compound proposition that is always ______ is called a Contradiction.

a) True b) False c) Contingency d) None

3. If A is any statement, then which of the following is a tautology?

a) 𝐴 ⋀ 𝐹 b) 𝐴 ⋁𝐹 c) 𝐴⋁ ⇁ 𝐴 d) 𝐴 ⋀ 𝑇

4. If A is any statement, then which of the following is not a contradiction?

a) 𝐴⋁ ⇁ 𝐴 b) 𝐴 ⋁𝐹 c) 𝐴 ⋀ 𝐹 d) None

5. The contrapositive of 𝑝 → 𝑞 is the proposition:

a) ⇁ 𝑝 →⇁ 𝑞 b) ⇁ 𝑞 →⇁ 𝑝 c) 𝑞 → 𝑝 d) ⇁ 𝑞 → 𝑝

6. The inverse of 𝑝 → 𝑞 is the proposition:

a) ⇁ 𝑝 →⇁ 𝑞 b) ⇁ 𝑞 →⇁ 𝑝 c) 𝑞 → 𝑝 d) ⇁ 𝑞 → 𝑝

7. (𝐴 ⋁𝐹)⋁(𝐴 ⋁𝑇) is always

a) T,T,T,T b) T,F,F,F c) T,T,F,F d) T,F,T,F

8. 𝐴 → (𝐴 ⋁𝑞) is a ______

a) Tautology b) Contradiction c) Contingency d) None

9. The compound propositions p and q are called logically equivalent if ______ is a tautology.

a) 𝑝 ⇋ 𝑞 b) 𝑝 → 𝑞 c) ⇁ (𝑝 ⋁ 𝑞) d) ⇁ 𝑝 ⋁ ⇁ 𝑞

10. 𝑝 → 𝑞 is logically equivalent to

a) ⇁ 𝑝 ⋁ ⇁ 𝑞 b) 𝑝 ⋁ ⇁ 𝑞 c) ⇁ 𝑝 ⋁ 𝑞 d) ⇁ 𝑝 ⋀ 𝑞

11. 𝑝 ⋀ 𝑞 is logically equivalent to:

a) ⇁ ( 𝑝 → ⇁ 𝑞) b) ( 𝑝 → ⇁ 𝑞) c) (⇁ 𝑝 → ⇁ 𝑞) d) ( ⇁ 𝑝 → 𝑞)
12. Which of the following statement is correct?

a) 𝑝 ⋁ 𝑞 ≡ 𝑞 ⋁ 𝑝 b) ⇁ (𝑝 ⋀𝑞) ≡⇁ 𝑝 ⋁ ⇁ 𝑞

c) (𝑝⋁ 𝑞)⋁ 𝑟 ≡ 𝑝⋁( 𝑞 ⋁𝑟) d)All of mentioned

13. 𝑝 ⇋ 𝑞 is logically equivalent to:

a) (𝑝 → 𝑞) → (𝑞 → 𝑝) b) (𝑝 → 𝑞)⋁(𝑞 → 𝑝)

c) (𝑝 → 𝑞)⋀(𝑞 → 𝑝) d) (𝑝⋀ 𝑞) → (𝑞⋀ 𝑝)

14. (𝑝 → 𝑞)⋀(𝑝 → 𝑟) is logically equivalent to:

a) 𝑝 → (𝑞⋀ 𝑟) b) 𝑝 → (𝑞⋁ 𝑟) c) 𝑝 ⋀(𝑞⋁ 𝑟) d) 𝑝 ⋁(𝑞 ⋀ 𝑟)

15. The converse of 𝑝 → 𝑞 is the proposition:

a) ⇁ 𝑝 → ⇁ 𝑞 b) ⇁ 𝑞 → ⇁ 𝑝 c) 𝑞 → 𝑝 d) ⇁ 𝑞 → 𝑝

16. What is the contrapositive of the conditional statement? “The home team misses whenever it
is drizzling? ”

a) If it is drizzling, then home team misses

b) If the home team misses, then it is drizzling

c) If it is not drizzling, then the home team does not misses

d) If the home team wins, then it is not drizzling

17. (𝑝 → 𝑟)⋁(𝑞 → 𝑟) is logically equivalent to:

a) (𝑝⋀𝑞)⋁ 𝑟 b) (𝑝 ⋁𝑞) → 𝑟 c) (𝑝⋀𝑞) → 𝑟 d) (𝑝 → 𝑞) → 𝑟

18. ⇁ (𝑝 ⇋ 𝑞) is logically equivalent to:

a) 𝑝 ⇋ ⇁ 𝑞 b) ⇁ 𝑝 ⇋ 𝑞 c) ⇁ 𝑝 ⇋⇁ 𝑞 d) ⇁ 𝑞 ⇋⇁ 𝑝

19. 𝑝 ⋁𝑞 is logically equivalent to:

a) ⇁ 𝑞 → ⇁ 𝑝 b) 𝑞 → 𝑝 c) ⇁ 𝑝 →⇁ 𝑞 d) ⇁ 𝑝 → 𝑞

20. (𝐴 ⋁ ⇁ 𝐴 )⋁(𝑞 ⋁ 𝑇) is a _______

a) Tautology b) Contradiction c) Contingency d) None

21. A product of the variable and their negation in a formula is called an______

a) Sum of product
b) Product of sum
c) Elementary product
 d) Elementary sum

22. A sum of the variable and their negation in a formula is called an______

a) Sum of product
b) product of sum
c) Elementary product
d) Elementary sum

23. Any part of an elementary sum or product which is itself an elementary sum or product is
called a______

a) Sum of the factors

b) Factor
c) Product of the factor
d) None

24. A formula which is equivalent to a given formula and which consists of a sum of
elementary products is called _______ normal form.

a) Conjunctive
b) Disjunctive
c) Connective
d) None

25. The problem of determining in a finite number of steps whether a given statement formula
is a tautology or a contradiction or at least satisfiable is known as a _______ problem.

a) Decision
b) Normal
c) Satisfiable
d) None

26. The disjunctive normal form of a given formula is ______

a) One
b) Two
c) Three
d) Not unique

27. A formula which is equivalent to a given formula and which consists of a product of
elementary sum is called _______ normal form.

a) Disjunctive
b) Conjunctive
c) Connective
d) None
28. Principal disjunctive normal form is also called _____ canonical form

a) Sum of products
b) Connective sum
c) Product of sum
d) Connective product

29. From the following which is not elementary products.

a) 𝑃˄¬𝑃
b) ¬𝑃˄𝑄
c) ¬𝑃𝑉𝑄
d) 𝑄˄¬𝑃

30. From the following which is not elementary sum.

a) 𝑄˄¬𝑃
b) ¬𝑃𝑉𝑄
c) ¬𝑄𝑉𝑃
d) ¬𝑃𝑉𝑃

31. From the following which is not a factor of (¬𝑄˄𝑃˄¬𝑃 )

a) ¬𝑄
b) 𝑃˄¬𝑃
c) ¬𝑄𝑉𝑃
d) ¬𝑄˄𝑃

32. Obtain disjunctive normal form of 𝑃˄(𝑃 → 𝑄)

a) (𝑃˄¬𝑃)𝑉(𝑃˄𝑄)
b) (𝑃𝑉¬𝑃)𝑉(𝑃˄𝑄)
c) (𝑃𝑉𝑄)˄(𝑃𝑉¬𝑃)
d) (𝑃˄¬𝑃)˄(𝑃𝑉𝑄)

33. Obtain conjunctive normal form of 𝑃˄(𝑃 → 𝑄)

a) (𝑃˄¬𝑃)𝑉(𝑃˄𝑄)
b) (𝑄𝑉¬𝑃)˄𝑃
c) (𝑃𝑉𝑄)˄(𝑃𝑉¬𝑃)
d) (𝑄˄¬𝑃)𝑉𝑃)

34. Obtain the given formula 𝑄𝑉(𝑃˄¬𝑄)𝑉(¬𝑃˄¬𝑄) is a _____

a) Contradiction b) Tautology
c) Contra positive d) None
35. In minterm if in the ith location from the left there appears 1, then the ith variable appears in
the _______

a) Disjunction
b) Conjunction
c) Negation
d) Normal form

36. In minterm if in the ith location from the left there appears 0, then the ith variable appears in
the ______.

a) Disjunction
b) Conjunction
c) Negation
d) Normal form

37. In maxterm if in the ith location from the left there appears 1, then the ith variable appears
in the _______ .
a) Disjunction
b) Conjunction
c) Negation
d) Normal form
38. In maxterm if in the ith location from the left there appears 0, then the ith variable appears in
the ______
a) Disjunction
b) Conjunction
c) Negation
d) Normal form
39. A formula which is equivalent to a given formula and which consists of disjunctions of
minterms only is known as its _______ normal form.
a) Principal disjunctive b) Principal conjunctive
c) Principal connective d) None

40. A formula which is equivalent to a given formula and which consists of conjunctions of
maxterms only is known as its _______ normal form.
a) Principal disjunctive
b) Principal conjunctive
c) Principal connective
d) None
41. This painting is red can be symbolized by _________

a) P(r) b) R(p) c) P(t) d) T(p)

42. Jack is taller than Jill can be translated as ________

a) G(j1,j2) b) J(g1,g2) c) G(j1,2) d) J(g1,2)

43. Susan sits between Ralph and Bill can be translated as ____

a) S(a1,a2,…..,an) b) B(t) c) S(r,b) d) None

44. This table is a bachelor can be translated as _______

a) T(b) b) B(t) c) T(t) d) B(b)

45. A ____of one variable is defined t be an expression consisting of a predicate symbol and
an individual variable.

a) Function b) statement function

c) Quantifiers d) simple statement function

46. A statement function becomes a statement when a _____ is replaced by the name of any
object.

a) Function b) Statement
c) Quantifier d) Variable

47. The statement resulting from a replacement is called_____

a) Statement function b) Statement variable

c) Substitution d) Substitution instance

48. Combining one or more simple statement functions and the logical connectives we can get
______

a) Disjunction b) Statement function

b) Negation d) Compound statement function

49. Let P(x) dente the statement “x>7” which of these have truth value true.

a) P(0) b) P(6) c) P(4) d) P(9)

50. The statement “every comedian is funny” where C(x) is “x is a comedian” and F(x) is “ x
is funny” and the domain consists of all people.

a) ∃x(C(x)˄F(x)) b) ∀x(C(x)˄F(x))
c) ∃x(C(x) → F(x)) d) ∀x(C(x) → F(x))

51. The statement “At least one of your friends is perfect”. Let P(x) be x is perfect” and let
F(x) be “x is your friend” and let the domain be all people.

a) ∀x(F(x) → P(x)) b) ∀x(F(x)˄P(x))

c) ∃x(F(x)˄P(x)) d) ∃x(F(x) → P(x))

51. “Everyone wants to learn cosmology” this argument may be true for which domains.

a) All students in your cosmology class

 b) All the cosmology learning students in the world
c) Both (a) and (b)
d) None

52. Let the domain of m includes, P (m) be the statement “m spends more than 2 hours in
playing polo”. Express ∀m¬P(m) quantification in English.

a) A student is there who spends more than 2 hours in playing polo

b) there is a student who does not spend more than 2 hours in playing polo
c) All students spends more than 2 hours in playing polo
d) No students spends more than 2 hours in playing polo

53. A formula containing a part of the form (x) P(x) or (∃x) P(x) such a part is called _____.

a) Free occurrence of x b) Bound occurrence of x

c) Scope d) Factor

54. Any occurrence of x or any variable that is not a bound occurrence is called ____

a) Free occurrence of x b) Bound occurrence of x

c) Scope d) Factor

55. The unique inverse of an element a∈X, if it exists is denoted by a-1 , so that

a) a-1*a=a*a-1=e b) a-1*a=a*a-1=1
c) a-1*a=a*a-1=0 d) a-1*a=a*a-1=a

56. An element a∈X is called cancellable with respect to a binary operation * on X , if for
every x,y∈X then(a*x=a*y)V(x*a=y*a)=>

a) (x=y) b) (y=x) c) (x≠y) d) (y≠x)

57. In the files that we consider here and more generally, each record contains a field which is
designated as a ____ to that record.

a) File b) Record c) Field d) Key

58. Ordering the records in some way by using the key values is called_____

a) Hashing b) Sorting c) Sequential file d) Binary search

59. The average time to complete such a search is proportional to n/2 where n is the number
of records in the file. This process is very time consuming and an alternate procedure known
as _____

a) Binary search b) Sorting c) Hashing d) Sequential

 60. The average time to complete such a search is proportional to n/2 where n is the number
of records in the file. This process is very time consuming and an alternate procedure known as
_____

a) Binary search b) Sorting c) Hashing d) Sequential

61. A lattice is a partially ordered set < L,≤ > in which every pair of elements a,b∈ L has a
______

a) UB & LB
b) LUB &GLB
c) GUB & GLB
d) LUB & LLB

62. The greatest lower bound of a subset {a,b}⊆ L will be denoted by

a) a⊕b b) a*b c) {a ,b} d) none

63. From the following which is another symbol used to denote meet and join respectively.

b) ∪,∩ b) ∩,∪ c) *,V d) ⊕,˄

64. Let S be a non empty set and the set of all partitions of S is denoted by.

a) 𝜌(S) b) 𝜋(S) c) < S,≥ > d) < S,≤ >

65. A partially ordered relation is transitive, reflexive and ____

a) Anti symmetric b) bisymmetric

c) Anti reflexive d) asymmetric

66. Let N= {1, 2, 3, …} be ordered by divisibility which of the following subset is totally
ordered.

a) 2,6,4 b)3,5,15 c)2,9,16 d)4,15,30

67. Let D30 = {1,2,3,4,5,6,10,15,30} and relation I be partial ordering on D30 . the all lower
bounds of 10 and 15 respectively are

a) 1,3
b) 1,5
c) 1,3,5
d) None

68. The idempotent law is defined as ___

a) a*a=a
b) a*a=1
c) a*a=0
 d) none

69. A self complemented , distributive lattice is called

a) Boolean algebra
b) Modular lattice
c) Complete lattice
d) Self dual lattice

70. Let D30 = {1,2,3,4,5,6,10,15,30} and relation I be partial ordering on D30 . the all lub of 10
and 15 respectively are

a) 30
b) 15
c) 10
d) 6

71. Let <L,≤ > be a lattice for any a,b,c∈ L the following holds a ≤ c  a⊕(b*c) ≤(a⊕ b)*c
is called ____

a) Modular inequality
b) Boolean inequality
c) Complete lattice
d) None

72. Principal of duality is defined as

a) ≤ is replaced by ≥
b) LUB becomes GLB
c) All properties are unaltered when ≤ is replaced by ≥
d) All properties are unaltered when ≤ is replaced by ≥ other than 0 and 1 element

73. The commutative law is defined as

a) a*b=b*a
b) a*a=a
c) b*b=b
d) a*b=0

74. The absorption law is defined as

a) a*(a*b) = b
b) a*(a⊕b) =b
c) a*(a*b) =a⊕b
d) a*(a⊕b) =a

75. A partial order is defined on the set S ={x, a1,a2,….,an,y} as

 x ≤ a i for all i and ai ≤ y for all i , where n≥ 1.number of total orders on the set S which
contain partial order ≤ is
a) 1
b) n
c) n+2
d) n!

76. Let L be set with a relation R which is transitive, antisymmetric and reflexive and for any
two elements a,b ∈ L. Let the lub (a,b) and the glb (a,b) exist. Which of the following is true

a) L is a poset
b) L is a Boolean algebra
c) L is a lattice
d) None

77. If lattice (C,≤) is a complemented chain, then

a) |𝐶| ≤ 1
b) |𝐶| ≤ 2
c) |𝐶| > 1
d) C does not exist

78. A self-complemented, distributive lattice is called

a) Boolean algebra
b) Modular lattice
c) Complete lattice
d) Self-dual lattice

79. The less than relation, <, n reals is

a) A partial ordering since it is asymmetric and reflexive

b) A partial ordering since it is anti-symmetric and reflexive
c) Not a partial ordering because it is not asymmetric and not reflexive
d) Not a partial ordering because it is not anti-symmetric and not reflexive

80. The minimized expression of AB𝐶̅ +𝐴̅ 𝐵𝐶̅ + 𝐴𝐵𝐶

̅̅̅̅ + ̅̅̅̅̅̅
𝐴𝐵𝐶 is

a) A+𝐶̅
b) 𝐵̅C
c) 𝐶̅
d) C

81. If B is a Boolean algebra then which of the following is true.

a) B is a finite but not complemented lattice

b) B is a finite , complemented and distributive lattice
c) B is a finite, distributive but not complemented lattice
d) B is not distributive lattice
82. In the Boolean algebra a variable has ____ different states

a) 1
b) 2
c) 3
d) 4

83. In Boolean algebra a*a is equal to _____

a) a
b) a2
c) 2a
d) 1

84. In Boolean algebra meet operation is equal to ___

a) Division
b) Union
c) Intersection
d) Both (b) and (c)

85. In Boolean algebra join operation is equal to ____

a) Division
b) Union
c) Intersection
d) Both (b) and (c)

86. In Boolean algebra AND is represented by ____

c) ⊕
d) –
e) /
f) *

87. In Boolean algebra OR is represented by

a) ⊕
b) –
c) /
d) *

88. x⊕x*y = ____

a) 1
b) 0
c) x
d) y

89. Truth table is used to express

 a) Boolean expression
b) Boolean map
c) Boolean matrix
d) Boolean addition

90. A*A is equal to___

a) A
b) ̅
A
c) 0
d) 1

91. A⊕A is equal to ___

a) A
b) ̅
A
c) 0
d) 1

92. A binary number system is a base of ____

a) 1
b) 2
c) 4
d) 10

93. Which law of Boolean algebra emphasizes the elimination from logical expression along
with the rearrangement of grouping variables?

a) Distributive law
b) Commutative law
c) Associative law
d) None

94. According to property of commutative law, the order of combining terms does not affect
____.

a) Initial result of combination

b) Final result of combination
c) Mid-term result of combination
d) None

95. What is the cardinality of the power set of the set {0,1,2}.

a) 8
b) 6
c) 7
d) 9
96. Power set of empty set has exactly ___ subset.

a) One
b) Two
c) Zero
d) three

97. The direct product of any two distributive lattices is a ____

a) Complete lattice
b) Complement lattice
c) Complemented lattice
d) Distributive lattice

98. A lattice is called ___ if each of its non empty subsets has a least upper bound &a greatest
lower bound.

a) Complemented
b) Complement
c) Complete
d) Distributive

99. In a bounded lattice < L,*, ⊕,0,1> an element b∈L is called a _____ of an element a∈L if
a*b=0 & a⊕b=1.

a) Complemented
b) Complement
c) Complete
d) Distributive

100.A lattice < L,*, ⊕,0,1> is said to be ____ lattice If every element of L has at least one
complement.

a) Complemented
b) Complement
c) Complete
d) Distributive
ANSWERS

1. a) True
2. b) False
3. c) 𝐴⋁ ⇁ 𝐴
4. b) 𝐴 ⋁𝐹
5. b) ⇁ 𝑞 →⇁ 𝑝
6. a) ⇁ 𝑝 →⇁ 𝑞
7. a) T,T,T,T
8. a) Tautology
9. a) 𝑝 ⇋ 𝑞
10. c) ⇁ 𝑝 ⋁ 𝑞
11. a) ⇁ ( 𝑝 → ⇁ 𝑞)
12. d)All of mentioned
13. c) (𝑝 → 𝑞)⋀(𝑞 → 𝑝)
14. a) 𝑝 → (𝑞⋀ 𝑟)
15. c) 𝑞 → 𝑝
16. d) If the home team wins, then it is not drizzling
17. c) (𝑝⋀𝑞) → 𝑟
18. a) 𝑝 ⇋ ⇁ 𝑞
19. d) ⇁ 𝑝 → 𝑞
20. a) Tautology
21. elementary product
22. D) elementary sum
23. B) factor
24. B) disjunctive
25. A) decision
26. D) not unique
27. B) conjunctive
28. A) sum of products
29. C) ¬𝑃𝑉𝑄
30. A) 𝑄˄¬𝑃
31. C) ¬𝑄𝑉𝑃
32. A) (𝑃˄¬𝑃)𝑉(𝑃˄𝑄)
33. B) (𝑄𝑉¬𝑃)˄𝑃
34. B) Tautology
35. B) conjunction
36. C) negation
37. C) negation
38. A) disjunction
39. A) principal disjunctive
40. B) principal conjunctive
41. B) R(p)
42. A) G(j1,j2)
43. A) S(a1,a2,…..,an)
44. B) B(t)
45. D) simple statement function
46. D) variable
47. D) substitution instance
48. D) compound statement function
49. D) P(9)
50. D)∀x(C(x) → F(x))
51. C) ∃x(F(x)˄P(x))
52. C) both (a) and (b)
53. D) No students spends more than 2 hours in playing polo
54. B) bound occurrence of x
55. Free occurrence of x
56. A)a-1*a=a*a-1=e
57. A)(x=y)
58. D)key
59. B) sorting
60. A) binary search
61. B) LUB & GLB
62. B) a*b
63. B)∪,∩
64. B)𝜋(S)
65. A) anti symmetric
66. A) 2,6,4
67. B) 1,5
68. A) a*a=a
69. A) Boolean algebra
70. A) 30
71. A) modular inequality
72. D) All properties are unaltered when ≤ is replaced by ≥ other than 0 and 1 element
73. A) a*a=b*a
74. D) a*(a⊕b) =a
75. D) n!
76. C) L is a lattice
77. B)|𝐶 | ≤ 2
78. A) Boolean algebra
79. D) Not a partial ordering because it is not anti-symmetric and not reflexive
80. C) 𝐶̅
81. B) B is a finite , complemented and distributive lattice
82. B) 2
83. A) a
84. C) intersection
85. B) union
86. D) *
87. A) ⊕
88. C) x
89. A) Boolean expression
90. D) 1
91. C) 0
92. B) 2
93. C) associative law
94. B) final result of combination
95. A) 8
96. A) one
97. D) distributive lattice
98. C) complete
99. B) complement
100. A) complemented