• Skip to main content
  • Skip to secondary menu
  • Skip to primary sidebar
  • Skip to footer

CBSE Tuts

CBSE Maths notes, CBSE physics notes, CBSE chemistry notes

  • NCERT Solutions
    • NCERT Solutions for Class 12 English Flamingo and Vistas
    • NCERT Solutions for Class 11 English
    • NCERT Solutions for Class 11 Hindi
    • NCERT Solutions for Class 12 Hindi
    • NCERT Books Free Download
  • TS Grewal
    • TS Grewal Class 12 Accountancy Solutions
    • TS Grewal Class 11 Accountancy Solutions
  • CBSE Sample Papers
  • NCERT Exemplar Problems
  • English Grammar
    • Wordfeud Cheat
  • MCQ Questions

NCERT Solutions for Class 12 Computer Science (C++) – Boolean Algebra

Contents

NCERT Solutions for Class 12 Computer Science (C++) – Boolean Algebra

TOPIC-1
Basics of Boolean Algebra

Very Short Answer Type Questions    [1 mark each]

Question 1:
Which gates are known as universal gates ? Why?
Аnswer:
Universal gates are the ones which can be used for implementing any gate like AND, OR and NOT or any combination of these basic gates. NAND and NOR gates are universal gates.

Check the boolean algebra calculator, Look at How easily to solve Boolean Expressions.

Question 2:
Draw the equivalent logic circuit for the following Boolean expression :
Аnswer:
ncert-solutions-class-12-computer-science-c-boolean-algebra-(178-1)

Question 3:
Express the OR operator in terms of AND and NOT operator.
Аnswer:
(A . B)’ = \(\overline { A }\) + \(\overline { B }\)
(\(\overline { A }\) + \(\overline { B }\))’ = A + B

Question 4:
Specify which axioms/theorems are being used in the following Boolean reductions :
(a) (be)’ + be = 1
(b) xyz + zx = xz
Аnswer:
(a) x + x’ = 1 & Complementary law
(b) y + x = x & Absorption law.

Question 5:
State and verify Associative law using Truth Table.
Аnswer:
Associative Law: This law states that:
(A + B) + C = A + (B + C)
(A.B).C = A. (B.C)
Proof:
ncert-solutions-class-12-computer-science-c-boolean-algebra-(178-2)
∴ From above truth table,
(A + B) + C = A + (B + C)
Similarly, we can prove,
A. (B.C) = (A. B).C
ncert-solutions-class-12-computer-science-c-boolean-algebra-(179-1)

Short Answer Type Questions-I    [2 mark each]

Question 1:
Correct the following boolean statements :
1. X+1 = X
2. (A’)’ = A’
3.  A+A’ = 0
4.  (A+B)’ = A.B
Аnswer:
1. X+l=l or X+0=X
2. ((A’)’) = A
3. A + A’ = 1 or A. A’ = 0
4. (A 4- B)’ = A’.B1

Question 2:
Write the POS form of a Boolean Function F, which is represented in a truth table as follows :
ncert-solutions-class-12-computer-science-c-boolean-algebra-(179-2)
Аnswer:
(P+Q+R).(P’+Q+R).(P’+Q’+R)

Short Answer Type Questions-II  [3 mark each]

Laws and Theorems
Question 1:
State and Verify Absorption law algebraically.
Аnswer:
Absorption law states that :
A + AB = A and A. (A + B) = A
Algebraic method :
Taking LHS
A + AB = (A.l) + (A.B) by Identity
= A. (1 + B) by Distribution
= A.l by Null Element
= A

Question 2:
State and define principle of duality. Why is it so important in Boolean Algebra ?
Аnswer:
Principle of duality : Duality principle states that from every boolean relation another boolean relation can be derived by :
(i) Changing each OR sign (+) to an AND sign (-).
(ii) Changing each AND sign (-) to an OR sign (+)
ex : Dual of A + A’B = A. (A’ + B)
Importance in Boolean Algebra : The principle of duality is an important concept in Boolean algebra, particularly in proving various theorems. The principle of duality is used extensively in proving Boolean algebra theorem. Once we prove that an expression is valid, by the principle of duality, its dual is also valid. Hence, our effort in proving various theorems is reduced to half.

Question 3:
Name the law shown below & verify it using a . truth table.
X+ \(\overline { X }\).Y = X + Y.
Аnswer:
This law is called “Absorption Law” also referred as redundance law.
ncert-solutions-class-12-computer-science-c-boolean-algebra-(180-1)

Question 4:
Draw a logic circuit for the following Boolean expression : ab + c.d’.
Аnswer:
ncert-solutions-class-12-computer-science-c-boolean-algebra-(180-2)

Question 5:
Write the SOP form of a Boolean function F, which is represented in a truth table as follows :
ncert-solutions-class-12-computer-science-c-boolean-algebra-(180-3)
Аnswer:
A’B’C + A’BC + AB’C + AB’C

Question 6:
Draw the Logic Circuit for the following Boolean Expression :
(U + V). w + z
Аnswer:
ncert-solutions-class-12-computer-science-c-boolean-algebra-(180-4)

Question 7:
Verify the following using Boolean Laws :
LT + V = LTV + LP.V + U.V
Аnswer:
L.H.S.
= U’ + V
= U’ . (V + V) + V (LP + U)
= U’ . V + LP . V + U . V + U. V
= U’. V + LP. V + U. V
= R.H.S.

OR

R.H.S.
= U’V’ + U’. V + U. V
= LP . (V + V) + U. V
= U’ 1 + U.V
= U’ + U.V
= U’ +V
= L.H.S.

Question 8:
Draw the Logic Circuit for the following Boolean Expression :
(X’ + Y). Z + W’
Аnswer:
ncert-solutions-class-12-computer-science-c-boolean-algebra-(180-5)

Question 9:
Write the equivalent boolean expression for the following logic circuit.
ncert-solutions-class-12-computer-science-c-boolean-algebra-(180-6)
Аnswer:
((X’.Y)’ + (X.Y’)’)’

Question 10:
Write the equivalent Boolean Expression for the. following Logic Circuit :
ncert-solutions-class-12-computer-science-c-boolean-algebra-(180-7)
Аnswer:
Z = (A+B)(B’ +C)
= A.B’ + AC + B.B’ + BC
= A.B’ + AC + BC

Question 11:
Obtain the Boolean Expression for the logic circuit shown below :
ncert-solutions-class-12-computer-science-c-boolean-algebra-(181-1)
Аnswer:
F = \(\left( \overline { A } .B \right) +\left( \overline { C+\overline { D } }\right)\)
= \(\left( \overline { A } .B \right) +\overline { C } .D\)

Question 12:
Name the law shown below & verify it using a truth table.
A + B . C = (A + B). (A + C).
Аnswer:
This law is called “Distributive Law”.
Prove by Truth table
ncert-solutions-class-12-computer-science-c-boolean-algebra-(181-2)

Question 13:
Obtain the Boolean Expression for the logic circuit shown below :
ncert-solutions-class-12-computer-science-c-boolean-algebra-(181-3)
Аnswer:
F = ( X.\(\overline { Y }\) ) + ( \(\overline { Z }\) + W).
F = \(\overline { X }\) + Y + \(\overline { Z }\) + W.

Question 14:
State Demorgan’s law. Verify one of them using truth table.
Аnswer:
There are two Demorgan’s law :
(i)  \(\overline { A.B }\) = \(\overline { A }\) + \(\overline { B }\)
(ii)  \(\overline { A+B }\) = \(\overline { XA}\) . \(\overline { B }\)
Proof :
(i)  \(\overline { A.B }\) = \(\overline { A }\) + \(\overline { B }\)

ncert-solutions-class-12-computer-science-c-boolean-algebra-(181-4)

Question 15:
Draw a logic Circuit for the boolean expression:
A . \(\overline { B }\) + (C + \(\overline { B }\)). \(\overline { A }\)
Аnswer:
ncert-solutions-class-12-computer-science-c-boolean-algebra-(181-5)

Question 16:
Obtain the Boolean Expression for the logic circuit shown below :
ncert-solutions-class-12-computer-science-c-boolean-algebra-(181-6)
F = P’ Q + (Q + R’)
= Q. (P’ + R’)

Question 17:
Verify the following using Boolean Laws X + Z = X + X’. Z + Y. Z
Аnswer:
Taking RHS
X + X’Z + YZ
= (X + X’). (X + Z) + YZ (Distribution Law)
= 1. (X + Z) + YZ    (A + A’ = 1)
= X + Z + YZ
= X + Z (1 + Y)
= X + Z    (1 + A = 1; 1. A = A)
= Hence verified

Question 18:
Verify the following using Boolean Laws : A + C = A + A. C + B.C
Аnswer:
A + C = A + A’.C + BC
Solve RHS
A + A’C + BC
(A + A). (A + C) + BC [Using distributive law]
1. (A + C) + BC
= A + C + BC
= A + C(1 + B)
= A + C.1
= A + C
= LHS (Hence, verified)

Question 19:
Obtain the Boolean Expression for the logic circuit shown below :
ncert-solutions-class-12-computer-science-c-boolean-algebra-(182-1)
Expression at F :
( \(\overline { X }\) . Y) + (Y + \(\overline { Z }\) )
( \(\overline { X }\) + 1) Y + \(\overline { Z }\)    [Distributive law]
Y + \(\overline { Z }\)    [ ∴ 1 + Z = 1]

Question 20:
Verify the following using truth table :
(i) X . X’ = 0
(ii) X + 1 = 1
Аnswer:
ncert-solutions-class-12-computer-science-c-boolean-algebra-(182-2)

Question 21:
Write the equivalent boolean expression for the following logic circuit :
ncert-solutions-class-12-computer-science-c-boolean-algebra-(182-3)
Аnswer:
Y = U \(\overline { V }\) + \(\overline { U}\) \(\overline { W }\)

Question 22:
Write the equivalent boolean expression for the following logic circuit :
ncert-solutions-class-12-computer-science-c-boolean-algebra-(182-4)
Аnswer:
Y = (U + \(\overline { V }\) ). (U + \(\overline { W }\) )

Question 23:
Verify the following using truth table :
(i) X + 0 = X
(ii) X + X’ = 1
Аnswer:
ncert-solutions-class-12-computer-science-c-boolean-algebra-(182-5)
ncert-solutions-class-12-computer-science-c-boolean-algebra-(182-6)

Question 24:
Derive a Canonical SOP expression for a Boolean function F, represented by the following truth table :
ncert-solutions-class-12-computer-science-c-boolean-algebra-(182-7)
Аnswer:
F(A, B, C) = A’B’C + A’BC + AB’C + ABC
OR
F(A,B,C) =∑(0, 3,4,7)

Question 25:
Derive a Canonical POS expression for a Boolean function F, represented by the following truth table :
ncert-solutions-class-12-computer-science-c-boolean-algebra-(182-8)
Аnswer:
F(RQ,R) = (P+Q+R’)(P+Q,+R)(P’+Q,+R’) (P’+Q’+R)
OR
F(RQ,R)=II(1,2,5,6)

Question 26:
Obtain a simplified form for a Boolean expression :
F(U, V, W, Z) = II (0,1,3,5, 6, 7,15)
Аnswer:
ncert-solutions-class-12-computer-science-c-boolean-algebra-(183-1)
(u + v + w).(u+z’).(v’+w’).(u’+w’+z)

Question 27:
Reduce the following Boolean Expression to its simplest form using K-Map :
F (X, X Z, W) = X (0,1, 6, 8, 9,10,11,12,15)
Аnswer:
ncert-solutions-class-12-computer-science-c-boolean-algebra-(183-2)
ncert-solutions-class-12-computer-science-c-boolean-algebra-(183-3)
Simplified Expression : XY + Y’Z’ + XZ’W’ + XZW + X’YZW’

Question 28:
Reduce the following Boolean Expression to its simplest form using K-Map :
F(X, Y, Z, W) = X (0,1,4, 5,6, 7,8, 9,11,15)
Аnswer:
ncert-solutions-class-12-computer-science-c-boolean-algebra-(183-4)
ncert-solutions-class-12-computer-science-c-boolean-algebra-(184-1)
Simplified Expression : Y’Z’ + XY + XZW

Question 29:
Verify the following using Boolean Laws.
X + Y’ = X. Y + X. Y + X’. Y
Аnswer:
L. H. S.
= X + Y’
= X. (Y+Y’) + (X + X’). Y’
= X. Y + X. Y’ + X. Y’ + X’. Y’
= X. Y + X. Y’ + X’. Y’
= R. H. S
OR
= X. Y + X. Y’ + X’. Y’
= X. (Y + Y’) + X’. Y’
= X. 1 + X’. Y’
= X + X’. Y’
= X + Y
= L. H. S

Question 30:
State Distributive law and verify it using truth table.
Аnswer:
Distributive law : This law states that
(i) x(y + z) = xy + x.z.
(ii) x + yz = (x + y)(x + z)
ncert-solutions-class-12-computer-science-c-boolean-algebra-(184-2)

Question 31:
Reduce the following Boolean Expression using KMap :
F(A, B, C, D) = ∑{0,1,3, 5, 6, 7,9,11,13,14,15}
Аnswer:
ncert-solutions-class-12-computer-science-c-boolean-algebra-(184-3)
A’B’C’+D+BC

TOPIC-2
Karnaugh Map Minimization and Applications of Boolean Algebra

Very Short Answer Type Questions [1 mark each]

Question 1:
Write Product of Sum expression of the function F (a, b, c, d) from the given truth table
ncert-solutions-class-12-computer-science-c-boolean-algebra-(186-1)
Аnswer:
F (a, b, c, d) =
(a + b + c + d).(a + b + c + d’). (a + b’ + c + d) . (a + b’ + c’ + d’). (a’ + b + c + d).
(a’ + b + c + d’). (a’ + b’ + c + d). (a’ + b’ + c + d’) . (a’ + b’ + c’ + d)

Question 2:
Convert the following boolean expression inti! its equivalent Canonical Sum of Products form (SOP) :
(U + V + W) (U + V + W’) (U’ + V + W) (U’ + V’ + W’)
Аnswer:
π (0,1, 4, 7)
∑(2, 3, 5, 6)
010 011 101 110
= U’VW’ + U’VW + UV’W + UVW’

Question 3:
Write the Sum of Product form of the function F(R Q, R) for the following truth table representation of F :
ncert-solutions-class-12-computer-science-c-boolean-algebra-(186-2)

Question 4:
Write the Product of Sum form of the function F(X, Y, Z) for the following truth table representation of F :
ncert-solutions-class-12-computer-science-c-boolean-algebra-(186-3)

Question 5:
Write the Product of Sum form of the function G(U, V W) for the following truth table representation of G :
ncert-solutions-class-12-computer-science-c-boolean-algebra-(186-4)

Question 6:
Write the Product of Sum form of function G(U, V, W) for the following truth table representation of G :
ncert-solutions-class-12-computer-science-c-boolean-algebra-(186-5)
ncert-solutions-class-12-computer-science-c-boolean-algebra-(187-1)

Question 7:
Write the Sum of Product form of the function F(A, B, C) for the following truth table reprsentation of
ncert-solutions-class-12-computer-science-c-boolean-algebra-(187-2)
ncert-solutions-class-12-computer-science-c-boolean-algebra-(187-3)
SOP = A’BC’ + A’BC + AB’C’ + ABC

Question 8:
Write the SOP form of a boolean function F, which is represented in a truth table as follows:
ncert-solutions-class-12-computer-science-c-boolean-algebra-(187-4)
Аnswer:
F(X, Y, Z) = X’.Y’. Z’ + X’. Y. Z’ + X. Y’. Z’+ X.Y.Z

Question 9:
Write the POS form of boolean function G, which is represented in a truth table as follows :
ncert-solutions-class-12-computer-science-c-boolean-algebra-(187-5)
Аnswer:
G (A, B, C) = (A + B + C). (A + B’ + C’). (A’ + B + C). (A’ + B + C’)

Short Answer Type Questions-II

Question 1:
Obtain the minimal SOP form for the following Boolean expression using K-Map.
F(A,B,C,D) = ∑ (0,2,3,5,7,8,10,1143,15)
Аnswer:
ncert-solutions-class-12-computer-science-c-boolean-algebra-(187-6)
Quad 1 = m0 + m2 + m8 + m10 = B’D’
Quad 2 = m3 + m7 + m15 + m11 = CD
Quad 3 = m5 + m7 + m15 + m13 = BD
Minimal SOP = B’D’ + CD + BD

Question 2:
Reduce the following Boolean expression using
K-Map :
F(A,B,C,D) = 7r (0,1,2,4,5,6,8,10)
Аnswer:
ncert-solutions-class-12-computer-science-c-boolean-algebra-(188-1)
F(A, B, C, D) = π(0,1,2,4, 5, 6,8,10) F = (A + C).(A + D).(B + D)

Question 3:
Reduce the following using K-Map :
F (A, B,C,D) = ∑(1,3,4,5,6,7,12,13)
Аnswer:
ncert-solutions-class-12-computer-science-c-boolean-algebra-(188-2)

Question 4:
Reduce the following boolean expression using
K-map.
F(EQ,R,S) = 2(0,2,4,5,6,7,8,10,13,15).
Аnswer:
\(\overline { P }\) Q + \(\overline { Q }\)\(\overline { S }\) + QS.
ncert-solutions-class-12-computer-science-c-boolean-algebra-(188-3)

Question 5:
Reduce the following Boolean Expression using K-Map :
F(P, Q, R, S) = ∑(1,2, 3,4,5, 6, 7, 8,10)
Аnswer:
ncert-solutions-class-12-computer-science-c-boolean-algebra-(188-4)
F(P, Q, R, S) = P’Q + P’S + P’R’S’ + PQ’S’

Question 6:
Reduce the following Boolean Expression using
K-Map :
F (A, B, C, D) = ∑(2, 3,4,5, 6, 7,8,10,11)
ncert-solutions-class-12-computer-science-c-boolean-algebra-(188-5)
F (A, B, C, D) = A’B + A’C + B’C + ABD’

Long Answer Type Questions [4 marks each]

Question 1:
Verify the following using Boolean Laws :
[Delhi, 2016]
A ‘ + B’ . C=A’ . B ‘ . C ‘ + A’ . B . C ‘ + A’ .B.C + A’ .B’ .C+ A.B’ .C
Аnswer:
A’+ B’C = A’B’C’ + A,BCI + A’BC’ + A’BC + A’B’C + ABC
=A’C'(B’+B)+A’C (Grouping)
(B+B’)+AB’C
=> A’C’+ A’C + AB’C
(x+x’y=x+y)
=> A’ (C+C’ ) +AB’ C
=> A’+AB’C
(x+x’=1)
=> A’+B’C
X=A’ y=B’C
= LHS
Hence Proved.

Question 2:
Write the Boolean Expression for the result of the Logic Circuit as shown below :
ncert-solutions-class-12-computer-science-c-boolean-algebra-(189-1)
Аnswer:
F = (u+v’).(u+w).(v+w’)

Question 3:
Derive a Canonical POS expression for a Boolen function F, represented by the following truth table :
ncert-solutions-class-12-computer-science-c-boolean-algebra-(189-2)
Аnswer:
F = ∑(0, 3,4,5)
= (P + Q + R) (P + Q’ + R’) (P’ + Q + R) (P’ + Q + R’)

Question 4:
Reduce the following Boolean Expression to its simplest form using K-Map :
F (X, Y, Z, W)
∑(2,6,7,8,9,10,11,13,14,15)
Аnswer:
∑(2,6,7,8,9,10,11,13,14,15)
ncert-solutions-class-12-computer-science-c-boolean-algebra-(189-3)
F = XY’ + ZW’+ XW + YZ

Question 5:
Write the Boolean Expression for the result of the Logic Circuit as shown below :
ncert-solutions-class-12-computer-science-c-boolean-algebra-(189-4)
Аnswer:
G = PQ’ + PR + QR’

Question 6:
Derive a Canonical SOP expression for a Boolean function G, represented by the following truth table :
ncert-solutions-class-12-computer-science-c-boolean-algebra-(189-5)
Аnswer:
G = ∑{(0,2,6,7)
= A’B’C’ + A’BC’ + ABC’ + ABC

Question 7:
Verify the following using Boolean Laws :
X’+ Y’Z = X’ .Y’ .Z’+X’ .Y.Z’+X’ .Y.Z+X’ .Y’ .Z + X.Y’.Z.
Аnswer:
X ‘+Y’ Z=X ‘ Y ‘ Z ‘ +X ‘ YZ ‘ +X ‘ YZ+X ‘ Y ‘ Z+XY ‘ Z
Taking RHS
Grouping terms
=> x’Z’ (Y’+Y)+X’ Z(Y+Y’)+XY’Z
=> X’Z’+X’Z+XY’Z
(Y+Y’=1)
=> X'(Z’+Z)+XY’Z
(Grouping)
=> X’+XY’Z (Z+Z’=l)
=> X’+Y’Z (Substitute X=X’ Y=Y’Z X+X’ Y = X+Y)
= LHS

Question 8:
Reduce the following Boolean Expression to its simplest form using K-Map :
F(P,Q,R,S) = ∑(0,4,5,8,9,10,11,12,13,15)
Аnswer:
F(P,Q,R,S) = ∑(0,4,5,8,9,10,11,12,13,15)
ncert-solutions-class-12-computer-science-c-boolean-algebra-(190-1)
F = R’ S ‘ + PQ ‘ + QR’ + PS

NCERT SolutionsComputer scienceEnglishHindiHumanitiesCommerceScience

Primary Sidebar

NCERT Exemplar problems With Solutions CBSE Previous Year Questions with Solutoins CBSE Sample Papers
  • The Summer Of The Beautiful White Horse Answers
  • Job Application Letter class 12 Samples
  • Science Lab Manual Class 9
  • Letter to The Editor Class 12 Samples
  • Unseen Passage For Class 6 Answers
  • NCERT Solutions for Class 12 Hindi Core
  • Invitation and Replies Class 12 Examples
  • Advertisement Writing Class 11 Examples
  • Lab Manual Class 10 Science

Recent Posts

  • Understanding Diversity Question Answer Class 6 Social Science Civics Chapter 1 NCERT Solutions
  • Our Changing Earth Question Answer Class 7 Social Science Geography Chapter 3 NCERT Solutions
  • Inside Our Earth Question Answer Class 7 Social Science Geography Chapter 2 NCERT Solutions
  • Rulers and Buildings Question Answer Class 7 Social Science History Chapter 5 NCERT Solutions
  • On Equality Question Answer Class 7 Social Science Civics Chapter 1 NCERT Solutions
  • Role of the Government in Health Question Answer Class 7 Social Science Civics Chapter 2 NCERT Solutions
  • Vital Villages, Thriving Towns Question Answer Class 6 Social Science History Chapter 9 NCERT Solutions
  • New Empires and Kingdoms Question Answer Class 6 Social Science History Chapter 11 NCERT Solutions
  • The Delhi Sultans Question Answer Class 7 Social Science History Chapter 3 NCERT Solutions
  • The Mughal Empire Question Answer Class 7 Social Science History Chapter 4 NCERT Solutions
  • India: Climate Vegetation and Wildlife Question Answer Class 6 Social Science Geography Chapter 8 NCERT Solutions
  • Traders, Kings and Pilgrims Question Answer Class 6 Social Science History Chapter 10 NCERT Solutions
  • Environment Question Answer Class 7 Social Science Geography Chapter 1 NCERT Solutions
  • Understanding Advertising Question Answer Class 7 Social Science Civics Chapter 7 NCERT Solutions
  • The Making of Regional Cultures Question Answer Class 7 Social Science History Chapter 9 NCERT Solutions

Footer

Maths NCERT Solutions

NCERT Solutions for Class 12 Maths
NCERT Solutions for Class 11 Maths
NCERT Solutions for Class 10 Maths
NCERT Solutions for Class 9 Maths
NCERT Solutions for Class 8 Maths
NCERT Solutions for Class 7 Maths
NCERT Solutions for Class 6 Maths

SCIENCE NCERT SOLUTIONS

NCERT Solutions for Class 12 Physics
NCERT Solutions for Class 12 Chemistry
NCERT Solutions for Class 11 Physics
NCERT Solutions for Class 11 Chemistry
NCERT Solutions for Class 10 Science
NCERT Solutions for Class 9 Science
NCERT Solutions for Class 7 Science
MCQ Questions NCERT Solutions
CBSE Sample Papers
NCERT Exemplar Solutions LCM and GCF Calculator
TS Grewal Accountancy Class 12 Solutions
TS Grewal Accountancy Class 11 Solutions