# Important Questions for CBSE Class 12 Computer Science (C) Chapter 12 Boolean Algebra

## CBSE Class 12 Computer Science (C++) Chapter 12 Boolean Algebra Important Questions – Free PDF Download

Free PDF download of Important Questions for CBSE Class 12 Computer Science (C++) Chapter 12 Boolean Algebra prepared by expert Computer Science (C++) teachers from latest edition of CBSE(NCERT) books, On CoolGyan.Org to score more marks in CBSE board examination.

## CBSE Class 12 Computer Science (C++) Important Questions Chapter 12 Boolean Algebra

### Previous Years Examination Questions [TOPIC 1] 1 Mark Questions

Question 1:
Derive a Canonical POS expression for a Boolean function G, represented by the following truth table: All India 2017

Question 2:
Derive a canonical POS expression for a Boolean function F, represented by the following truth table: Delhi 2016

Question 3:
Derive a canonical SOP expression for a boolean function G, represented by the following truth table: All India 2016

Question 4:
Derive a canonical SOP expression for boolean function F, represented by the following truth table: Delhi 2015

Question 5:
Derive a canonical POS expression for a boolean function F, represented by the following truth table: All India 2015

Question 6:
Convert the following Boolean expression into its equivalent canonical sum of products (SOP) form:

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

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

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

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

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

Question 12:
Write the POS form of boolean function G, which is represented in a truth table as follows: Delhi 2012

Question 13:
Write the SOP form of boolean function F, which is represented in a truth table as follows: All India 2012

Question 14:
Write the POS form of a boolean function F, which is represented in a truth table as follows: Delhi 2011

Question 15:
Write the SOP form of a boolean function F, which is represented in a truth table as follows: All India 2011

Question 16:
Write the SOP form of a boolean function F, which is represented in a truth table as follows: Delhi (c) 2011

Question 17:
Write the POS form of boolean function H, which is represented in a truth table as follows: Delhi 2010

Question 18:
Write the SOP form of boolean function G, which is represented in a truth table as follows: All India 2010

Question 19:
Write the POS form of a boolean function H, which is represented in a truth table as follows: Delhi 2009

Question 20:
Write the POS form of a boolean function G, which is represented in a truth table as follows: All India 2009

### 2 Marks Questions

Question 21:
State DeMorgan’s Laws of Boolean Algebra and verify them using truth table. All India 2017
Or
State DeMorgan’s laws. Verify one of the DeMorgan’s laws using a truth table Delhi 2013C
Or
State and prove DeMorgan’s laws in boolean algebra. Delhi 2011C,2009C

Question 22:
Draw the Logic Circuit of the following Boolean Expression using only NOR Gates: All india 2017
(A+B). (C+D)

Question 23:
Verify the following using boolean laws:

Question 24:
Write the boolean expression for the result of the logic circuit as shown below:

Question 25:
Verify the following using Boolean Laws:

Question 26:
Write the boolean expression for the result of the Logic Circuit as shown below:

Question 27:
Verify the following using boolean laws:

Question 28:
Draw the logic circuit for the following boolean expression:

Question 29:
Verify the following using boolean laws.

Question 30:
Draw the logic circuit for the following boolean expression:

Question 31:
State distributive law and verify it using truth table. All India 2014C

Question 32:
Name the law shown below and verify it using a truth table.

Question 33:
Obtain the boolean expression for the logic circuit shown below: Delhi 2014

Question 34:
Name the law shown below and verify it using a truth table.

Question 35:
Obtain the boolean expression for the logic circuit shown below: All India 2014

Question 36:
Verify the following using boolean laws

Question 37:
Verify the following using boolean laws

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

Question 39:
Draw a logic circuit for the following boolean expression.

Question 40:
Obtain the boolean expression for the logic circuit shown below:.

Question 41:
Verify the following boolean expression using truth table:

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

Question 43:
Verify the following boolean expression using truth table:

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

Question 45:
Verify the following boolean expression using truth table:

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

Question 47:
Verify the following boolean expression using truth table:

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

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

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

Question 51:
Verify the following algebraically:

Question 52:
Verify the following algebraically:

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

Question 54:
Write the equivalent boolean expression for the following logic circuit:.

Question 55: