• Skip to main content
  • Skip to primary sidebar
  • Skip to footer
  • NCERT Solutions
    • 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

CBSE Tuts

CBSE Maths notes, CBSE physics notes, CBSE chemistry notes

Chapterwise Question Bank CBSE Class 12 Computer Science (C++) – Boolean Algebra

Contents

  • 1 Chapterwise Question Bank CBSE Class 12 Computer Science (C++) – Boolean Algebra
    • 1.1 Topic – 1 Boolean Operations and Logic Gates
    • 1.2 Topic – 2 Karnaugh Map (K-Map)

Chapterwise Question Bank CBSE Class 12 Computer Science (C++) – Boolean Algebra

Topic – 1
Boolean Operations and Logic Gates

Exam Practice
Short Answer Type Questions [2 Mark]

Question 1:
Write the Sum of Product (SOP) form of the function F(P, Q, R)for the following truth table representation of F: Delhi 2014

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(310-1)

Question 2:
Write the Product of Sum (POS) form of the function F(X, Y, Z)for the following truth table representation of F: All India 2014

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(310-2)

Аnswer:

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(310-3)–

Question 3:
Write the Product of Sum (POS) form of the function G (U,V,W) for the following truth table representation ofG: Delhi 2013

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(310-4)

Question 4:
Write the Sum of Product (SOP) form of the function F(A, B, C) for the following truth table representation of F: All India 2013

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(311-1)

Question 5:
Write the dual of the boolean expression
(A+0).(A.1.\(\overline { A } \)).
Аnswer:
Using duality principle, changing (+) to (.) and vice-versa and by replacing 0’s with l’s and l’s with 0’s, the dual for the given expression is as follows:
(A.1) + (A + 0 + \(\overline { A } \))

Question 6:
Give the dual of the boolean function \(\overline { X } \).(Y + Z) + \(\overline { X } \) .(\(\overline { Y } \) + \(\overline { Z } \))
Аnswer:
Using duality principle, changing (+) to (.) and vice-versa and by keeping the form of variables as such the dual of the expression is:
(\(\overline { X } \) + Y.Z) .(\(\overline { X } \) + \(\overline { Y } \).\(\overline { Z } \))

Question 7:
Seven inverters are cascaded one after another. What is the output, if the input is 1?
Аnswer:
The logic circuit is given:

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(311-2)–

Question 8:
Represent F(a, b) = a.b using only NOT and OR gates.
Аnswer:
The expression F(a, b) = a.b using only NOT and OR gates is:

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(311-3)

Question 9:
Find the complement of the following boolean function F1 = A.B + \(\overline { C } \).\(\overline { D } \);
Аnswer:
chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(311-4)

Question 10:
State the distributive laws of boolean algebra. How do they differ from the distributive laws of ordinary algebra?
Аnswer:
Distributive laws of boolean algebra state that:

  1. X.(Y + Z) = X.Y + X.Z
  2. X + Y.Z = (X + Y).(X+Z)
    Law X.(Y + Z) = X.Y + X.Z satisfies ordinary algebra for all values, whereas X + Y.Z = (X + Y).(X +‘Z) satisfies only for two values (0, 1) of X, Y and Z.

Question 11:
How many input combinations can be there in the truth table of a logic system having (N) input binary variables?
Аnswer:
2N input combinations can be there in the truth table of a logic system.

Question 12:
Why are NAND and NOR gates called Universal gates?
Or
Which gates are called Universal gates and why?
Аnswer:
NAND and NOR gates are easier to design and basic functions like AND, OR and NOT, etc., can be easily implemented using NAND/NOR gates. So, these gates are called Universal gates.

Question 13:
Draw a logic circuit diagram for the boolean expression A.(B + \(\overline { C } \)). All India2008
Аnswer:
Logic circuit diagram for the boolean expression:
A.(B + \(\overline { C } \))

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(311-5)

Question 14:
Draw a logic circuit diagram for the boolean expression \(\overline { A } \).(B + C).
Аnswer:
Logic circuit diagram for the boolean expression: \(\overline { A } \).(B + C)

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(311-6)

Question 15:
Express P + \(\overline { Q } \).R in canonical SOP form.
Аnswer:
chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(312-1)

Question 16:
Draw a logic circuit diagram for the following
boolean expression \(\overline { X } \). (\(\overline { Y } \)+ Z) Delhi 2008
Аnswer:
A logic diagram for the boolean expression \(\overline { X } \).(\(\overline { Y } \) +Z)

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(312-2)

Short Answer Type Questions [2 Marks]

Question 17:
Write the equivalent boolean expression for the following logic circuit:

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(312-3)

Question 18:
Interpret the following logic circuit as boolean expression:

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(312-4)

Question 19:
Verify the following using boolean laws:
A + C = A + \(\overline { A } \).C + B.C Delhi 2013
Аnswer:
A+C = A + \(\overline { A } \).C + B.C
R.H.S =A + \(\overline { A } \).C + B.C
=(A + \(\overline { A } \)).(A + C)+B.C [By using Distributive law]
= 1. (A + C)+B.C [By using A+\(\overline { A } \)=1]
= A+C+B.C = A+C.(1 + B)
= A + C.( 1 ) = A+C [∵ 1 + B = 1]
= L.H.S

Question 20:
Obtain the boolean expression for the logic circuit shown below:

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(312-5)

Question 21:
Represent the boolean expression X.\(\overline { Y } \) + Y.\(\overline { Z } \) using only NAND gate.
Аnswer:

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(312-6)

Question 22:
Represent the boolean expression (X + \(\overline { Y } \))Z with the help of NAND gate only.
Аnswer:
The boolean expression (X + \(\overline { Y } \)). Z can be implemented as:

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(313-1)

Question 23:
Write the equivalent boolean expression for the following logic circuit:

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(313-2)

Question 24:
Verify the following boolean expression using truth table:
(i) X.X = 0
(ii)X+ 1=1 All India 2012
Аnswer:

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(313-3)

Question 25:
Name the law shown below and verify it using a truth table. Delhi 2014
A+B.C = (A+B).(A + C)
Аnswer:
A + B.C = (A + B).(A+C)
The above stated law is called distributive law.

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(313-4)
Since, column five and column eight are identical, hence, the given law A + B.C = (A + B).(A + C) is verified.

Question 26:
Name the law shown below and verify it using a tru th table: All India 2014
X + \(\overline { X } \).Y = X+Y
Аnswer:
Name of the given law is redundant literal law.

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(313-5)
Since, last two columns of the above tmth table are identical, hence, X+\(\overline { X } \). Y=X+Y is verified.

Question 27:
Draw the logic circuit for a half adder using NOR gate only.
Аnswer:
The boolean expression for the half adder,
Sum (S) = A.\(\overline { B } \) + \(\overline { A } \).B
Carry (C) = A.B

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(313-6)

Question 28:
Draw the logic circuit for a half adder using NAND gate only.
Аnswer:
The boolean expression for the half adder,
Sum (S) = A.\(\overline { B } \) + \(\overline { A } \).B
Carry (C ) = A.B

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(314-1)

Question 29:
State and prove DeMorgan’s laws in boolean algebra. Delhi 2011C, 2009C, 2008
Or
State DeMorgan’s laws. Verify one of the DeMorgan’s laws using a truth table. Delhi 2013C
Аnswer:
Refer to text on page no. 303-304.

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(314-2)
chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(314-3)

Question 30:
Draw a logic circuit diagram for full adder. Give the truth table for full adder.
Аnswer:
Boolean function for full adder

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(314-4)

Question 31:
Verify the following algebraically:
\(\overline { X } \).Y + X.\(\overline { Y } \) = (\(\overline { X } \) + \(\overline { Y } \)).(X + Y) All India 2010
Аnswer:

Question 32:
Given the following circuit:

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(314-5)

Question 33:
Write the equivalent boolean expression for the following logic circuit: All India 2010

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(314-6)

Question 34:
Verify \(\overline { X } \).Y + X.\(\overline { Y } \) + \(\overline { X } \).\(\overline { Y } \) = \(\overline { X } \) + \(\overline { Y } \) using truth table.
Delhi 2009
Аnswer:

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(314-7)

Question 35:
State and verify absorption law using truth table. All India 2009,2008
Аnswer:
Absorption Law It states that for boolean variables X and Y,
(i) X + X.Y = X
(ii) X.(X + Y) = X

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(315-1)

Question 36:
Represent (P + \(\overline { Q } \) R) in POS form. Delhi 2009C

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(315-2)
To get the POS form, we need to product maxterms for all those input combinations that produce output as 0.
Thus, P + \(\overline { Q } \).R = (P +Q + R).(P + \(\overline { Q } \) + R).(P +\(\overline { Q } \)+\(\overline { R } \))

Question 37:
Convert the following boolean expression into the equivalent canonical Product of Sum (POS) form
A.\(\overline { B } \).C + \(\overline { A } \).B.C + \(\overline { A } \).B.\(\overline { C } \) All India 2008
Аnswer:

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(315-3)

Question 38:
State and verify distributive law in boolean algebra. Delhi 2008C
Аnswer:
Distributive law state that:
(i) X.(Y + Z) = X.Y + X.Z
(ii) X + Y.Z = (X +Y).(X + Z)
Verification:
(i) Truth table of: X.(Y + Z) = X.Y + X.Z

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(315-4)

Both columns identical. X.(Y + Z) and X.Y + X.Z are identical
∴ X.(Y + Z) = X.Y + X.Z
Hence Proved.
(ii)Truth table for X + Y.Z = (X + Y).(X + Z)

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(315-5)
Both columns X + Y.Z and (X + Y).(X + Z) are identical.
X + Y.Z = (X + Y). (X + Z)
Hence Proved.

Question 39:
Convert the following boolean expression into its equivalent canonical Sum of Product (SOP) form. Delhi 2008C
(\(\overline { U } \) + v + \(\overline { W } \)).(u + \(\overline { V } \) + \(\overline { W } \)).(u + v + w)
Аnswer:
chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(317-5)

Question 40:
State and verify associative law.
Аnswer:
The associative law states:
(i) X + (Y + Z) = (X + Y) + Z
(ii) X.(Y.Z) = (X.Y).Z
Verification:
(i) Truth table of X+ {Y + Z) = (X+ Y) +Z

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(316-1)
Both columns X + (Y + Z) and (X + Y) + Z are identical.
∴ X +(Y + Z) = (X + Y) + Z Hence Proved.
(ii) Truth table of X.(Y.Z) = (X.Y).Z

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(316-2)

Both columns X.(Y.Z) and (X.Y).Z are identical.
X .(Y .Z) = (X ,Y).Z Hence Proved.

Question 41:
Given the following truth table, derive a Sum of Product (SOP) and Product of Sum (POS) form of boolean expression from it:

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(316-3)

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(316-4)

Question 42:

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(316-5)

Question 43:

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(316-6)

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(317-1)

Question 44:
Design a circuit (3 inputs) which gives a high output only when there is even number of low or high inputs.
Аnswer:
High output when even number of low inputs or even number of high inputs, i.e.

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(317-2)

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(317-3)

Question 45:
A boolean function F defined on three input variables X, Y and Z is, if and only if number of 1 input is odd. Draw the truth table for the above function and express it in canonical SOP form.
Аnswer:
Truth table

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra-(317-4)

Topic – 2
Karnaugh Map (K-Map)

Exam Practice
Short Answer Type Questions [3 Mark]

Question 1:
Obtain the minimal form for the following boolean expression using Karnaugh’s map: All India 2014
F(A, B, C, D) = ∑(1,3, 4,5,6,7,12,13)
Аnswer:
F (A, B,C, D) = ∑(1,3, 4,5,6,7,12,13)
chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra(321-1)

Question 2:
Obtain the minimal form for the following boolean expression using Karnaugh’s map:
H (P, Q, R, S)=∑(0, 1,2, 3, 5, 7, 8, 9, 10, 14, 15) Delhi 2013
Аnswer:

chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra(321-2)
chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra(321-3)

Question 3:
What is the simplified boolean expression for the following K-map:
chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra(321-4)

Question 4:
Simplify the expression:
chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra(321-5)
chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra(322-1)

Question 5:
Reduce the following boolean expression using K-map: F (A, B, C,D) = ∑(2,3, 4,5,6,7,8,10,11 ) All India 2012
Аnswer:
F (A, B,C, D) = ∑(2,3,4,5,6,7,8,10,11)
chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra(323-6)

Question 6:
Reduce the following boolean expression using K-map: F(U, V, W, Z) = ∑(0, 1, 2, 4, 5, 6, 8, 10)
Аnswer:
F(U,V,W,Z) = ∑(0,1,2,4,5,6,8,10)
chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra(322-3)
chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra(322-4)

Question 7:
Reduce the following boolean expression using K-map:
F(A,B, C, D) = ∑(3, 4,5,6,7,13,15) All India 2010
Аnswer:
F (A, B,C,D) = ∑(3,4,5,6,7,13,15)
chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra(323-7)

Question 8:
Reduce the following boolean expression using K-map:
F(A,B,C,D) = ∑(0,1,2,3,4,5,10,11,15)
Аnswer:
chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra(322-6)
chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra(323-1)

Question 9:
Reduce the following boolean expression using K-map :
F(P, Q, R, S) = ∑(1,2,3,5,6,7,9,11,12,13,15) Delhi 2009
Аnswer:
F (P,Q, R,S) = ∑(1,2,3, 5,6,7,9,11,12,13,15)
chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra(323-2)

Question 10:
Simplify using Karnaugh’s map for:
chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra(323-3)

Question 11:
In the K-map shown below, which of the groupings shown in the K-map represents legal grouping?
chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra(323-4)

Аnswer:
Groups must contain 2,4, 8 or in general 2n cells either in horizontally or vertically. So, grouping A and E are legal groupings.

Question 12:
Draw the K-map and give the reduced SOP expression for the following truth table:
chapterwise-question-bank-cbse-class-12-computer-science-c-boolean-algebra(323-5)

Computer ScienceChapterwise Question Bank for Computer ScienceNCERT Solutions

Primary Sidebar

NCERT Exemplar problems With Solutions CBSE Previous Year Questions with Solutoins CBSE Sample Papers

Recent Posts

  • CBSE Sample Papers for Class 12 History Paper 1
  • ML Aggarwal Class 7 Solutions for ICSE Maths Chapter 16 Perimeter and Area Ex 16.3
  • Article Writing Class 11 Format, Topics, Examples, Samples
  • Paragraph on Madhur Vani in Hindi | मधुर वाणी पर अनुच्छेद लेखन
  • Coordinate Geometry Class 10 Maths CBSE Important Questions With Solutions
  • Paragraph on Morning Walk in Hindi | प्रात: काल भ्रमण पर अनुच्छेद लेखन
  • Sambandh Bodhak in Hindi | संबंधबोधक (Preposition) की परिभाषा एवं उनके भेद और उदाहरण (हिन्दी व्याकरण)
  • NCERT Solutions for Class 7 Maths Chapter 12 Algebraic Expressions InText Questions
  • CBSE Revision Notes for Class 10 English First Flight Chapter 8 Mijbil the Otter
  • Maharashtra Board Class 10 Solutions for Marathi कुमारभारती – कथालेखन
  • NCERT Class 10 Science Lab Manual CO2 is Released During Respiration
  • NCERT Solutions for Class 12 Hindi Core – कार्यालयी हिंदी और रचनात्मक लेखन – कार्यालयी पत्र
  • NCERT Solutions for Class 7 Maths Chapter 13 Exponents and Powers InText Questions
  • NCERT Class 10 Science Lab Manual Dicot Seed
  • NCERT Exemplar Problems Class 7 Maths – Exponents and Powers

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