Important Questions for Class 12 Computer Science (C++) – Boolean Algebra

Important Questions for Class 12 Computer Science (C++) – 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

Answer:

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

Answer:

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

Answer:

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

Answer:

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

Answer:

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

Answer:

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


Answer:

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

Answer:

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

Answer:

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

Answer:

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

Answer:

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

Answer:

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

Answer:

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

Answer:

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

Answer:

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

Answer:

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

Answer:

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

Answer:

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

Answer:

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

Answer:

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

Answer:

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

Question 23:
Verify the following using boolean laws:

Answer:

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

Answer:

Question 25:
Verify the following using Boolean Laws:

Answer:

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

Answer:

Question 27:
Verify the following using boolean laws:

Answer:

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

Answer:

Question 29:
Verify the following using boolean laws.

Answer:

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

Answer:

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

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

Answer:

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

Answer:

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

Answer:

——————————————–34——————————————

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

Answer:

——————————————–35——————————————

Question 36:
Verify the following using boolean laws

Answer:

——————————————–36——————————————

Question 37:
Verify the following using boolean laws

Answer:

——————————————–37——————————————

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

Answer:

——————————————–38——————————————

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

Answer:

——————————————–39——————————————

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

Answer:

——————————————–40——————————————

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

Answer:

——————————————–41——————————————

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

Answer:

——————————————–42——————————————

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

Answer:

——————————————–43——————————————

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

Answer:

——————————————–44——————————————

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

Answer:

——————————————–45——————————————
——————————————–45-1——————————————

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

Answer:

——————————————–46——————————————

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

Answer:

——————————————–47——————————————

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

Answer:

——————————————–48——————————————

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

Answer:

——————————————–49——————————————

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

Answer:

——————————————–50——————————————

Question 51:
Verify the following algebraically:

Answer:

——————————————–51——————————————

Question 52:
Verify the following algebraically:

Answer:

——————————————–52——————————————

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

Answer:

——————————————–53——————————————

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

Answer:

——————————————–54——————————————

Question 55:

Answer:

——————————————–55——————————————

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

Answer:

——————————————–56——————————————

Question 57:

Answer:

——————————————–57——————————————

Question 58:
State and verify absorption law in boolean algebra. All India 2009
Answer:
——————————————–58——————————————

Computer ScienceImportant Questions for Computer ScienceNCERT Solutions

The post Important Questions for Class 12 Computer Science (C++) – Boolean Algebra appeared first on Learn CBSE.