Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
167 views

D.A.V Public School, Pratap Vihar, Ghaziabad Holiday Home, Session 2021-22 Class XI, Subject: Computer Science

This document contains questions for students in Class XI on the topic of Boolean Algebra from D.A.V. Public School in Pratap Vihar, Ghaziabad. It includes 39 short answer and multiple choice questions testing concepts such as Boolean expressions, logic circuits, Boolean laws including De Morgan's laws and duality, and truth tables. It also includes an assignment to create a PowerPoint presentation on one of seven specified computer science topics.

Uploaded by

Dhruv Pandita
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
167 views

D.A.V Public School, Pratap Vihar, Ghaziabad Holiday Home, Session 2021-22 Class XI, Subject: Computer Science

This document contains questions for students in Class XI on the topic of Boolean Algebra from D.A.V. Public School in Pratap Vihar, Ghaziabad. It includes 39 short answer and multiple choice questions testing concepts such as Boolean expressions, logic circuits, Boolean laws including De Morgan's laws and duality, and truth tables. It also includes an assignment to create a PowerPoint presentation on one of seven specified computer science topics.

Uploaded by

Dhruv Pandita
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

D.A.

V Public School, Pratap Vihar, Ghaziabad


Holiday Home, Session 2021-22
Class XI, Subject: Computer Science

QA) Do following question in class note book


Toipic: Basics of Boolean Algebra
Question 1:
Express the OR operator in terms of AND and NOT operator.
Question 2:

Question 3:
Which gates are known as universal gates? Why?
Question 4:
State and verify Associative law using Truth Table.
Question 5:
Draw the equivalent logic circuit for the following Boolean experession :

Short Answer Type Questions


Question 1:
State and define principle of duality. Why is it so important in Boolean Algebra?
Question 2:
Write the equilent boolean expression for the following logic circuit.

Question 3:
Write the equilent boolean expression for the following logic circuit.

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

Question 5:
Name the law shown below & verify it using a truth table.

Question 6:
Obtain the Boolean Expression for the logic circuit shown below.
Question 7:
Verify the following using truth table:
(i) X+0=X
(ii) X+x’=1
Question 8:
Obtain the Boolean Expression for the logic circuit shown below.

Question 9:
State Demorgan’s law. Verify one of them using truth table

Question 10:
Draw a logic circuit for the Boolean expression

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

Question 12:
Verify the following using Boolean Lawas:
X+Z=X+X’Z+Y.Z

Question 13:
Verify the following using Boolean Lawas:
A+C=A+A’.C+B.C

Question 14:
Obtain the Boolean Expression for the logic circuit shown below:
Question 15:
Verify the following using truth table:
(i) X.X’=0
(ii) X+1=1
Question 16:
Write the equivalent boolean expression for the following logic circuit:

Question 17:
State and prove Distribution law
Question 18:
Name the law shown below & verify it using a truth table.
A+B.C=(A+B).(A+C).
Question 19:
Write the Boolean Expression for the result of the Logic Circuit as shown below:

Question 20:
Correct the following boolen statements:

Question 21:
Write the Boolen Expression for the result of the Logic Circuit shown below:

Question 22:
Verify the following using Boolen Laws
P’+Q’.R=P’.Q’.R’+P’.Q.R’+P’.Q.R+P’.Q’.R+P.Q’.R
Question 23:
Verify the following using Boolen Laws x’+y’z = x’y’z’+x’y’z’+x’yz+x’y’z+xy’z
Question 24:
State and prove De-Morgan’s laws in boolean algebra.
DeMorgan’s theorem states that:
(i) (X+Y)’=X’.Y’
(ii) (X.Y)’=X’+Y’
Question 25:
Write the equivalent boolean expression for the following logic circuit:

Question 26:
Verify the following using truth table:
Question 27:
Write the equivalent boolean expression for the following logic circuit:

Question 28:
Verify the following using truth table:
X+Y.Z=(X+Y).(X+Z)
Question 29:
Write the equivalent boolean expression for the following logic circuit:

Question 30:
State abd cerify De-Morgan’s laws algebraically
Question 31:
Write the equivalent boolean expression for the following logic circuit:

Question 32:
State and algebraically verify Absorption law
Question 33:
Write the equivalent boolean expression for the following logic circuit:

Question 34:
Represent the expression X’.Y+Y’.Z+Z’X using NAND gates
Question 35:
Write the equivalent expression for the following logical circuit:

Question 36:
Verify the following algebraically.
(A’+B’).(A+B)=A’.B+A.B’
Question 37:
Write the equivalent boolean expression for the following logic circuit:

Question 38:
Verify the following algebrically:
X’.Y+X.Y’=(X’+Y’).(X=Y)
Question 39:
Write the equivalent boolean expression for the following logic circuit:

Q B) Make a PPT on any one of the following Topics:

i. Computer Memory
ii. Computer hardware devices
iii. Number System
iv. Encoding Scheme
v. Boolean gate
vi. Boolean laws
vii. Truth table

You might also like