100% found this document useful (1 vote)
124 views

Propositional Logic and Boolean Algebra

1. The document discusses propositional logic and Boolean algebra through examples of evaluating logical statements and expressions. 2. It provides the solutions to 40 multiple choice questions related to topics like Boolean operations, logic gates, Karnaugh maps, and digital circuits. 3. The questions cover concepts in propositional logic, Boolean algebra, logic gate operations, reduction of Boolean functions, and the design of basic digital circuits.

Uploaded by

Bilal Muhammad
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
100% found this document useful (1 vote)
124 views

Propositional Logic and Boolean Algebra

1. The document discusses propositional logic and Boolean algebra through examples of evaluating logical statements and expressions. 2. It provides the solutions to 40 multiple choice questions related to topics like Boolean operations, logic gates, Karnaugh maps, and digital circuits. 3. The questions cover concepts in propositional logic, Boolean algebra, logic gate operations, reduction of Boolean functions, and the design of basic digital circuits.

Uploaded by

Bilal Muhammad
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 18

Propositional Logic and Boolean Algebra

1. Let P: If Sahil bowls, Saurabh hits a century.; 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 century
d) Sahil bowled and Saurabh got out
Answer: c
Explanation: Either hypothesis should be false or both (hypothesis and conclusion) should be true.

2. The truth value ‘9 is prime then 3 is even’.


a) False
b) True
Answer: b
Explanation: The first part of the statement is false, hence whole is true.

3. Let P: I am in Delhi.; Q: Delhi is clean.; then q ^ p (q and p) is?


a) Delhi is clean and I am in Delhi
b) Delhi is not clean or I am in Delhi
c) I am in Delhi and Delhi is not clean
d) Delhi is clean but I am in Mumbai
Answer: a
Explanation: Connector should be ‘and’, that is q and p.

4. 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) ~P V ~Q
b) P ∧ ~Q
c) P V Q
d) P ∧ Q
Answer: b
Explanation: The second part of the statement is negated, hence negation operator is used.

5. Let P: We should be honest., Q: We should be dedicated., R: We should be overconfident. Then ‘We


should be honest or dedicated but not overconfident.’ is best represented by?
a) ~P V ~Q V R
b) P ∧ ~Q ∧ R
c) P V Q ∧ R
d) P V Q ∧ ~R
Answer: d
Explanation: The third part of the statement is negated, hence negation operator is used, for (‘or’ –V) is used
and for(’but’- ∧)

6. Negation of statement (A ∧ B) → (B ∧ C) is _____________


a) (A ∧ B) →(~B ∧ ~C)
b) ~(A ∧ B) v ( B v C)
c) ~(A →B) →(~B ∧ C)
d) None of the mentioned
Answer: a
Explanation: ~(A →B) Ξ A ∧ ~B using this we can easily fetch the answer.
7. Which of the following satisfies commutative law?
a) ∧
b) V
c) ↔
d) All of the mentioned
Answer: d
Explanation: All of them satisfies commutative law.

8. If the truth value of A v B is true, then truth value of ~A ∧ B can be ___________

a. True if A is false
b. False if A is false
c. False if B is true and A is false
d. None of the mentioned
Answer: a
Explanation: If A is false then both the condition are obeyed.

9. If P is always against the testimony of Q, then the compound statement P→(P v ~Q) is a __________
a) Tautology
b) Contradiction
c) Contingency
d) None of the mentioned
Answer: a
Explanation: Since either hypothesis is false or both (hypothesis as well as conclusion) are true.

10. If A and B are the inputs of a half adder ,the sum is given by:
a) A OR B
b) A AND B
c) A XOR B
d) A XNOR B

11. EX-OR Gates can be constructed from _____________ logic gates


a) OR Gates only
b) AND Gates
c) AND Gates, OR Gates and NOT Gates
d) OR Gates and NOT Gates

12. The Universal Gate is


a) NAND GATE
b) OR GATE
c) AND GATE
d) None of these

13. Difference between half adder and full adder is


a) Half adder has 2 inputs while full adder has 4 inputs
b) Half adder has 1 input while full adder has 2 inputs
c) Half adder has 2 inputs while full adder has 3 inputs
d) None of these

14. The only function of NOT Gate is to


a) stop the signal
b) Invert the input signal
c) Acts as a universal gate
d) None of these
15. Which of the examples below expresses the commutative law of multiplication?
a) A + B = B + A
b) A • B = B + A
c) A • (B • C) = (A • B) • C
d) A • B = B • A
Answer: d
Explanation: The commutative law of multiplication is (A * B) = (B * A).
The commutative law of addition is (A + B) = (B + A).

16. The Boolean expression Y = (AB)’ is logically equivalent to what single gate?
a) NAND
b) NOR
c) AND
d) OR
Answer: a
Explanation: If A and B are the input for AND gate the output is obtained as AB and after inversion
we get (AB)’, which is the expression of NAND gate. NAND gate produces high output when any of
the input is 0 and produces low output when all inputs are 1.

17. The NOR gate output will be high if the two inputs are __________
a) 00
b) 01
c) 10
d) 11
Answer: a
Explanation: In 01, 10 or 11 output is low if any of the I/P is high. So, the correct option will be 00.

18. The canonical sum of product form of the function y(A,B) = A + B is __________
a) AB + BB + A’A
b) AB + AB’ + A’B
c) BA + BA’ + A’B’
d) AB’ + A’B + A’B’
Answer: b
Explanation: A + B = A.1 + B.1 = A(B + B’) + B(A + A’) = AB + AB’ + BA +BA’ = AB + AB’ +
A’B = AB + AB’ + A’B.

19. The expression Y=(A+B)(B+C)(C+A) shows the _________ operation.


a) AND
b) POS
c) SOP
d) NAND
Answer: b
Explanation: The given expression has the operation sum as well as the product of that. So, it shows
POS(product of sum) operation. SOP will be the sum of product terms.

20. The boolean function A + BC is a reduced form of ____________


a) AB + BC
b) (A + B)(A + C)
c) A’B + AB’C
d) (A + C)B

Answer: b
Explanation: The DeMorgan’s law states that (AB)’ = A’ + B’ & (A + B)’ = A’ * B’, as per the Dual Property.
21. Complement of the expression A’B + CD’ is _________
a) (A’ + B)(C’ + D)
b) (A + B’)(C’ + D)
c) (A’ + B)(C’ + D)
d) (A + B’)(C + D’)

Answer: b
Explanation: (A’B + CD’)’ = (A’B)'(CD’)’ (By DeMorgan’s Theorem) = (A” + B’)(C’ + D”) (By DeMorgan’s
Theorem) = (A + B’)(C’ + D).

22. Simplify Y = AB’ + (A’ + B)C.


a) AB’ + C
b) AB + AC
c) A’B + AC’
d) AB + A

Answer: a
Explanation: Y = AB’ + (A’ + B)C = AB’ + (AB’)’C = (AB’ + C)( AB’ + AB’) = (AB’ + C).1 = (AB’ + C).
B + BC (By Commutative Property) = A(1 + C + B) + BC = A + BC (1 + B + C =1 By 1’s Property).

23. A(A + B) = ?
a) AB
b) 1
c) (1 + AB)
d) A

Answer: d
Explanation: A(A + B) = AA + AB (By Distributive Property) = A + AB (A.A = A By Commutative Property) = A(1
+ B) = A*1 (1 + B = 1 by 1’s Property) = A.

24. DeMorgan’s theorem states that _________


a) (AB)’ = A’ + B’
b) (A + B)’ = A’ * B
c) A’ + B’ = A’B’
d) (AB)’ = A’ + B

Answer: a
Explanation: The DeMorgan’s law states that (AB)’ = A’ + B’ & (A + B)’ = A’ * B’, as per the Dual Property.

25. Given the Boolean function F(A,B,C,D) = Σ(0,1,2,3,4,5,8,9,10,11,12,13,14). While reducing using K-map,
what are the groups formed? (*ignore redundant groups if any)
a) 1 Octet and 2 Quads
b) 2 Octets and 1 Pair
c) 3 Quads and 1 Pair
d) 2 Octets and 1 Quad

26. Given the Boolean function F(P,Q,R,S) = π(4,5,6,9,10,11,13,14,15). While reducing using K-map, what are
the groups formed? (*ignore redundant groups if any)
a) 1 Quad and 3 Pairs
b) 2 Quads and 2 Pairs
c) 3 Quads and 1 Pair
d) 2 Quads and 1 Pair
27. Which of the following represents the canonical POS expression for a 3 variable XNOR gate?
a) (X' + Y' + Z) . (X + Y + Z') . (X + Y + Z) . (X' + Y + Z')
b) (X + Y' + Z) . (X + Y + Z) . (X' + Y' + Z) . (X' + Y + Z')
c) (X + Y + Z') . (X + Y' + Z) . (X' + Y + Z) . (X' + Y' + Z')
d) (X + Y + Z) . (X + Y' + Z') . (X' + Y + Z') . (X' + Y' + Z)

28. Select the correct option for the following laws of Boolean Algebra:

Associative De Morgan's Complementarity Distributive Involution


law Law law Law law
P+P'.Q = P+Q Correct
~(~P) = P Correct

29. If C1 = X.Y and C2 = Z.(X⊕Y). Find the simplified expression for C1 + C2


a) X'.Y'.Z + X.Y'.Z' + X'.Y.Z'
b) X'.Y + Y'.Z + Z'.X
c) X.(Y' + Z')
d) X.Y + Y.Z + Z.X

30. If A=1, B=0, C=0 and D=1. Select the correct option for minterm and Maxterm
a) A.B.C'.D' and A'+B'+C+D
b) A'.B.C.D and A+B'+C'+D
c) A.B'.C'.D and A'+B+C+D'
d) A'.B'.C.D and A+B+C'+D'

31. What is the expression for contrapositive of the conditional: ~(P.Q) ⇒ R


a) (~P + ~Q) ⇒ R
b) P.Q ⇒ ~R
c) R ⇒~(P.Q)
d) ~R ⇒ P.Q

32. Convert the following to its canonical form: F(A,B,C) = Σ (0,2,4,7)


a) A'.B'.C + A'.B.C + A.B'.C + A.B.C'
b) A'.B'.C' + A.B'.C + A.B.C' + A.B.C
c) A'.B'.C' + A'.B.C' + A.B'.C' + A.B.C
d) A.B.C + A.B'.C + A.B.C' + A'.B'.C'

33. Find the Dual of: AB' + BC' + 1 = 1


a) A'B + B'C + 0 = 0
b) (A+B') . (B+C') . 0 = 0
c) (A'+B) . (B'+C) . 0 = 0
d) (A+B') . (B+C') + 1 = 1

34. If A, B and C are the inputs of full adder then carry is given by:
a) A AND B OR (A OR B) AND C
b) A OR B OR (A AND B) OR C
c) A XOR B XOR C
d) A AND B OR B AND C OR A AND C
35. Decoders are constructed from
a) NOT gates
b) AND gates
c) NOT and And gates
d) None of these

36. What is a Multiplexer?


a) It is a type of decoder which decodes several inputs and gives one output
b) A multiplexer is a device which converts many signals into one
c) It takes one input and results into many outputs
d) It is a type of encoder which decodes several inputs and gives one output

37. How many AND gates are required to realize the following expression:
Y = A.B + B.C
a) 4
b) 8
c) 1
d) 2

38. Decoder converts n inputs to __________ outputs.


a) n
b) 2 ^ n
c) n ^ 2
d) n ^ n

39. Which of the following circuit can be used as parallel to series converter?
a) Multiplexer
b) De-Multiplexer
c) Decoder
d) Encoder

40. Determine the Boolean functions for output F as a function of four inputs A, B, C and D in figure:

a) (A'.D)' . (A+ (B.C)' + D)'


b) (A' . (A'.D)' )' . (A' +B.C)
c) (A' . (A'.D)' )' . (A' + (B.C.D)' )
d) (A.D)' . ((A+B+C)' + D)'

41. GIVE THE DUAL OF FOLLOWING EXPRESSION (A’ + 0).(B’ + 1) = A’


a) (A'+1)+(B'.1)=A'
b) B).(A'.1)+(B'.0)=A'
c) C)(A+0).(B'.1)=A'
d) D) (A'.0)+(B'.1)=A'
42. CONVERT THE FOLLOWING EXPRESSIONS IN CANONICAL POS: F(P.Q)=∏(0,2)
a) (P'.Q')+(PQ')
b) B)(P'+Q')(P+Q')
c) C)(P+Q)(P'+Q)
d) D) (PQ)(PQ')

43. CONVERT THE FOLLOWING EXPRESSIONS IN CANONICAL SOP: XYZ+Y.Z’


a) XYZ+XYZ'+X'YZ'
b) B)XY'Z+XYZ+XYZ'
c) C)X'YZ+XYZ'+X'YZ'
d) D) XYZ'+X'Y'Z'+XYZ'

44. Define Maxterm


a) it is the product of all the literals in their barred and non barred form
b) it is the product of all the literals
c) it is the sum of all the literals in their barred and non barred form
d) it is the sum of all the literals

45. Define Minterm


a) it is the product of all the literals in their barred and non barred form
b) it is the product of all the literals
c) it is the sum of all the literals in their barred and non barred form
d) it is the sum of all the literals

46. IF p'->q then write its inverse


a) p->q
b) p->q'
c) p'->q'
d) q->p'

47. Cardinal Expression for carry of a full adder is


a) ∑(0,2,4,7)
b) ∑(3,5,6,7)
c) ∑(1,3,5,7)
d) ∑(1,2,4,7)

48. EXAMPLE OF TAUTOLOGY


a) A + A'
b) A + 0
c) A + 1
d) BOTH 1 AND 3

49. The Propositional operator < = > represents


a) conditional elimination
b) Bi Conditional Elimination
c) Disjunction
d) Conjunction

50. The Simplification of Boolean expression a.[b+c(a.b+a.c)’]


a) ab
b) 1
c) 0
d) none of these
51. How many selection lines are there in 8:1 mux
a) 4
b) 2
c) 8
d) 3

52. NAME THE BASIC GATES


a) NAND, NOT, NOR
b) NOT, OR, AND
c) OR, NOR, XOR
d) XNOR, XOR

53. APPLICATION OF MULTIPLEXER


a) CONVERTS HLL TO LLL
b) CONVERTS LLL TO HLL
c) PARALLEL TO SERIAL CONVERSION
d) TO ADD THE BINARY DIGITS

54. Given the Boolean function F(A,B,C,D)=∑ (2,3,4,5,6,7,8,10,11) .Reduce the above expression by using 4-
variable Karnaugh map, showing the various groups (i.e. octal, quads and pairs).

(A) What will be the least number of groups and their types formed by the reduction?
a) 3 quads,1 pair
b) 2 quads,1 pair
c) 1 octet,1 pair
d) 4 quads,1 pair

(B) What will be the reduced expression for it?


a) A’B+B’C+AB’D’
b) A’B+B’C+A’C+AB’D’
c) AB’+A’B+B’C+A’C+AB’D’
d) A+AB’C

55. Given the Boolean function F(P,Q,R,S)=∏ (0,1,2,3,5,7,8,9,10,11) .Reduce the above expression by using 4-
variable Karnaugh map, showing the various groups (i.e. octal, quads and pairs.

(A) What will be the least number of groups and their types formed by the reduction?
a) 1quads,2 pair
b) 2 quads,1 pair
c) 1 octet,1 quad
d) 1 octet,1 pair

(B) What will be the reduced expression for it?


a) Q.(P+S’)
b) (P+Q).(P’+Q).(P+Q’+R)
c) Q+(P’+Q)(P’+S)
d) Q.(P+Q’+R)
56. Study the diagram given below and answer the questions that follow:

X
A

(A) Name the basic gate which is represented by the diagram.


a) AND
b) OR
c) NOT
d) NOR

(B) What will be the value of X when A=1 and B=0?


a) 0
b) 1
c) error
d) none of the above

57. What is the relationship between XOR AND XNOR GATE?


a) COMPLEMENT
b) SAME
c) NONE OF ABOVE

58. How many AND gates and OR gates are required for 4:1 Multiplexer?
a) 1 AND , 4 OR
b) 4 AND , 1 OR
c) 2 AND ,1 OR
d) 2 AND, 4 OR

59. Name the circuit used to convert LLL TO HLL


a) Encoder
b) Decoder
c) Multiplexer
d) Adder

60. Reduce F(A,B,C,F)=∑ (0,1,4,5,7,12,13,14,15) using k-map and choose the correct reduced SOP expression
given below
a) a) A'C' + A.B'.C'+B'.D'+A'.B.D
b) b) A'.C'+B'.C' + A'.B.D+ B'.C.D'
c) c) A'C'+B.D + ABC
d) d) NONE OF THE ABOVE

correct answer : d

61. Reduce F(A,B,C,D)=∏ (1,3,4,5,6,7,9,10,12,13,14,15) using k -map and choose the correct POS expression
given below
a) B'.(C+D').(A'+C'+D).(A+C'+D')
b) (B'+C).(B'+C').(A+D').(A'+C+D').(A'+C'+D)
c) (A+D').(A'+C'+D).(C+D').B'
d) NONE OF THE ABOVE

correct answer : c
62. Simplify using laws of boolean algebra and chose the correct answer from the given list
A.(A'+B) + AC(C+C')+A.A'.C + A.C'
a) B.C
b) A
c) 1
d) 0

correct answer : b

63. Make truth table of given expression and check for tautology, contradiction or contingency
F(A, B, C) = ((A' + B).(B -> C)) -> (A -> C)
a) CONTINGENCY
b) CONTRADICTION
c) TAUTOLOGY
d) none of the above

Correct answer : c

64. If F = (a + b') . (a . b' + c') then find F' using De Morgan's law
a) a'.b + a'+b.c
b) a.b' + (a'+b.c)
c) a'b. + (a'+b).c'
d) a'.b + (a'+b).c

Correct answer : d

65. Choose the equivalent cardinal POS expression of F(A,B,C)=(A'+B+C'.(A+B'+C').(A'+B'+C)(A+B+C')


a) F(A, B, C)=∑(1, 2, 4, 6)
b) F(A, B, C)=∏(1, 3, 5, 6)
c) F(A, B, C)=∏(2, 4, 6, 7)
d) None of the above

Correct answer : b

66. What will be the output for ~(A V ~B), if A = 1 and B = 0?


a) 1
b) 2
c) 0
d) None of the above

67. Assume p: You are vaccinated, q: You will develop immunity. Which one will be considered as
contrapositive of q -> p?
a) If you are vaccinated then you will develop immunity.
b) If you will not develop immunity then you are not vaccinated.
c) If you are not vaccinated then you will not develop immunity.
d) None of the above

68. The output of A+A.B.C+A’ is:


a) Tautology
b) Contradiction
c) Contingency
d) None of the above
69. According to which law(s) (a’+b’)’=a.b:
a) Distributive Law, Complementarity Law
b) Associative Law, Involution Law
c) De Morgans’ First Theorem, Involution Law
d) De Morgan’s Second Theorem, Involution Law

70. The Boolean expression of biconditional elimination of x and y is:


a) x’.y+x.y’
b) x.y+x’.y’
c) (x+y)’
d) x’+y’

71. What is a proposition?


a) A declarative sentence to which we can assign a truth value of EITHER true or false, but not both.
b) A declarative sentence to which we can assign a truth value of BOTH true or false
c) A declarative sentence to which we cannot assign a truth value of either true or false
d) None of the above

72. With respect to Property of 1, select the correct option:


a) A + 1 = 1
b) A.1=A
c) Both A, B
d) None of the above

73. The Dual of A+B’.C+1=1 is?


a) A’+B.C’+0=0
b) A.B+C’+0=0
c) A.(B’+C)+0=0
d) A.B’+C+0=1

74. The complement of (A+B’)’ is?


a) A’.B
b) A+B’
c) A.B
d) A’.B’’

75. Find the minterm and maxterm for w = 1, x = 1, y = 1, z = 0 are:

a) w’.x’.y’.z’ , (w’+x’+y’+z’)
b) w.x.y.z , (w+x+y+z)
c) w.x.y.z’ ,w’+x’+y’+z
d) w+x+y+z’ w’.x’.y’.z

76. Select the correctminterm designation and maxterm designation forabcd’.

a) m14, M1
b) m1, M14
c) M14, m1
d) m14, m1
77. The techniques to reduce a wff are:
a) Truth Table method
b) Algebraic Method
c) Karnaugh Method
d) All of above

78. A groups of 1s or 0s whose all members are overlapped by other groups is called as:

a) Redundant group
b) Free Group
c) Base Group
d) Induction Group

79. The Cardinal POS of F(X,Y,Z)=∑(0, l, 5, 7) will be:

a) Π(2,3,4,6)
b) Π(2,3,4,6,8,9,10,11,12,13,14,15)
c) Π(0,1,5,7)
d) ∑(2,3,4,6)

80. For 4 variable SOP K-MAP F(A,B,C,D) = ∑(0,2,3,4,5,6,8,10,11,12,13), the total number of quads and pairs
formed will be:

a) 0 quads, 6 pairs
b) 2 quads, 2 pairs
c) 3 quads, 1 pair
d) 4 quads, 0 pairs

81. In a 3 Variable K-Map, if eight 1s are plotted then the result will be:

a) Tautology
b) Contradiction
c) Contingency
d) All of the above

82. In a 3 Variable K-Map, if eight 1s are present then the result will be:

a) Tautology
b) Contradiction
c) Contingency
d) All of the above

83. For the logical expression (A.B + C)’, what will be the result if A=1, B=0 and C=1 ?
a) 1
b) 2
c) 0
d) None of the above
84. Assume p: You are vaccinated, q: You will develop immunity. Which one of the following will be
considered as contrapositive of q->p?
a) If you are vaccinated then you will develop immunity.
b) If you will not develop immunity then you are not vaccinated.
c) If you are not vaccinated then you will not develop immunity.
d) None of the above

85. The output of A+A.B.C+A’ is:


a) Tautology
b) Contradiction
c) Contingency
d) None of the above

86. According to which law(s) (a’+b’)’=a.b:


a) Distributive Law, Complementarity Law
b) Associative Law, Involution Law
c) De Morgans’ First Theorem, Involution Law
d) De Morgan’s Second Theorem, Involution Law

87. The Boolean expression of biconditional elimination of x and y is:


a) x’.y+x.y’
b) x.y+x’.y’
c) (x+y)’
d) x’+y’

88. In the following 4-Variable SOP K-Map, how many groups can be formed?

a) 1 Octet, 2 pairs
b) 1 Octet, 1 Quad, 1 pair
c) 2 quads, 2 pairs
d) 3 quads, 1 pair

89. With respect to the following circuit diagram, answer the question number A & B :

Question A. What will be the Boolean expression at output Y?


a) ((A.B)+C’)
b) ((A.B)+C’)’
c) ((A+B).C’)’
d) (A+B’+C)’
Question B. What will be the output Y if A=1, B=1 and C=1?
a) 0
b) 1
c) 2
d) None of the above

90. Which of the following gates are considered as Universal Gates?


a) NAND, NOR
b) XOR, XNOR
c) NAND, XOR
d) NOR, XNOR

91. Which of the following gates produce 0 when all the Inputs are 1?
a) NAND, NOR
b) OR, AND,
c) NAND, OR
d) NOR, OR

92. Which gate(s) should be added to the circuit at OUTPUT X to get final output 0 if A=1, B=1, C=1?

a) NAND, NOR
b) NAND, NOT
c) NAND
d) NOT

93. Which of the following gates produce 0 when all the Inputs are 1?
a) NAND, NOR
b) OR, AND,
c) NAND, OR
d) NOR, OR

94. Encoder is an electronic circuit which can convert a _________ number to its_______equivalent.
a) Decimal/Octal/Hexadecimal, Binary
b) Binary, Decimal/Octal/Hexadecimal
c) Binary, Octal only
d) Hexadecimal, Octal only

95. A 2 to 4 Decoder two ______ I/Ps and gives 4 _____O/Ps


a) Binary, Decimal
b) Binary, Binary
c) Decimal, Decimal
d) Hexadecimal, Octal
96. Two Half adders and one OR gate can construct the following circuit:

a) 4 to 1 Multiplexer
b) Full Adder
c) Half Subtractor
d) Octal to Binary Encoder

97. The Boolean expression for Difference in a half subtractor circuit is:

a) A+B
b) A’.B
c) A.B
d) (A+B)’

98. The output sum in a Half Adder can be obtained by which of the following gates?

A.

B.

C.

D.

99. In a Hexadecimal to binary encoder, if the I/P is 'B', the output will be :

a) F3: 1, F2: 0, F1: 1, F0:1


b) F3: 1, F2: 1, F1: 1, F0:1
c) F3: 1, F2: 0, F1: 0, F0:1
d) F3: 0, F2: 0, F1: 1, F0:1

100. In a 4 to 1 multiplexer, the total number of select lines are:

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

101. The Boolean expression for equivalence proposition is represented by:


a) A=>B.B=>A
b) A’B’+A.B
c) AB
d) All of these.

102. 2. If the input in a decoder is A’BC’D’, then the decimal equivalent output will be:
a) 5
b) 4
c) 6
d) 8
103. With reference to the given proposition Q’ =>P’, Answer the following questions:
(A) The converse of the proposition is:
a) Q => P
b) P => Q
c) P’ => Q’
d) ~P => ~Q

(B) The contra-positive of the proposition is:


a) P’ => Q’
b) P => Q
c) Q => P
d) Q’ => P’

104. For the given the Boolean expression   F (A, B, C, D) = Σ (1, 3, 5, 7, 8, 9, 10, 11, 14, 15):
(A) The total of groups are:
a) 2 quads, 2 pairs
b) 1 octet, 2 quads
c) 4 quads
d) 1 quad, 3 pairs

(B) the reduced expression for the following Boolean expression is:
a) A’D+A’C’D+B’D’+ACD
b) A’+A’D+A’D
c) A’D +CD+A’D+AC
d) A’D’+A’BD+ACD’

105. The following expression is a : F(W,X,Y,Z) = W’X’Y + WY’Z’ + W’X’Y’Z


a) Sum of product
b) Product of sum
c) CanonicalSum of product
d) Canonical Product of sum

106. Determine the values of A,B,C and D , that makes the sum term A’+B+C’+D
a) A=0,B=1,C=0,D=1
b) A=1,B=0,C=1,D=0
c) A=1,B=1,C=0,D=

107. From the given truth table, the SOP expression is:-

a) X=A’B’C’+ABC+AB’C
b) X=ABC+ABC’+A’B’C’
c) x=A’B’C+A’BC+ABC’
108. What is the primary motivation for using Boolean Algebra to simplify logic expression.
a) It may take it easier to understand the overall function of the circuit.
b) It may reduce the number of gates.
c) It may reduce the number of inputs required.
d) All of the above.

109. The law which represents the Boolean equation (A’)’ =A is:
a) Involution Law
b) Identity Law
c) Idempotence Law
d) Complementarity Law

110. The dual of the Boolean equation (X + X.Y’) +1 = 1 is:


a) X’.X’Y.0=0
b) X.X+Y’.0=0
c) ( X’+X’.Y)+0=0
d) ( X’+X’+Y).1=1

111. If A=1, B=1, C=0 and D=1, then the MINTERM will be:
a) A’.B’.C.D’
b) A’+B’+C+D’
c) A.B.C’.D
d) A+B+C’+D

112. The compliment of the Boolean expression F(A,B,C) =A’.(B’+C) is:


a) A’+B’.C
b) A’+B’+C’
c) A’.B’.C
d) A+(B.C’)

113. The expression for ABSORPTION LAW is given as.


a) W’+WZ=W’+Z
b) A+A’B=A+B
c) A+A.B=A
d) All of these

114. The simplified form of Y = AB’ + (A’ + B).C is:-


a) A.B’
b) AB’+C
c) 0
d) 1

115. A variable on its own or in its complemented form is known as a :


a) Product Term
b) Literal
c) Sum Term
d) Word
116. The combinational circuit which adds three binary bits is:
a) Full Adder
b) Decoder
c) Half Adder
d) Multiplexer

117. The output of an EX-NOR gate is 1. Which input combination is correct?


a) A=0, B=1
b) A=0 , B=0
c) A=1 B=0
d) A=0,B’=1

You might also like