Scribd
Upload
19 views2 pages

Boolean Algebra

The document contains a series of Boolean algebra questions categorized into one mark, two marks, three marks, and five marks questions. It covers definitions, laws, proofs, and applications of Boolean algebra, including logic circuits, minterms, maxterms, and various theorems. Additionally, it includes tasks such as drawing logic diagrams, constructing truth tables, and reducing Boolean functions using Karnaugh maps.

Uploaded by

akhil2024mm333
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
19 views2 pages

Boolean Algebra

The document contains a series of Boolean algebra questions categorized into one mark, two marks, three marks, and five marks questions. It covers definitions, laws, proofs, and applications of Boolean algebra, including logic circuits, minterms, maxterms, and various theorems. Additionally, it includes tasks such as drawing logic diagrams, constructing truth tables, and reducing Boolean functions using Karnaugh maps.

Uploaded by

akhil2024mm333
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

BOOLEAN ALGEBRA QUESTIONS

One mark questions:

1. Define logic Circuit.


2. what is a binary variable.
3.What is another name of Boolean algebra?
4.What is logic function . Give a example.
5. Draw the symbol of OR Gate.
6. What is a minterm?
7.What is a maxterm?

Two marks questions:

1.Define principle of Duality.


2. State indempotence law.
3. Prove indempotence law using truth table.
4.Draw the Venn diagram of AND operation
5. Draw logic diagram to represent Involution law.
6.Use Duality theorem find the Dual of : A + AB=A+B
7. What is meant by tautology and fallacy?
8. Prove the 1+Y is a tautology and 0.Y is a fallacy.
9. Prove that X+XY = X
10. Prove that XY + XY = X
11. Prove that (X+Y)(X+Y) = X
12. Prove that X + X Y = X + Y.
13. Find the minterm for XY + Z.
14. Find the maxterm for (X + Y + Z).
15.What is the canonical form of Boolean expression?
16. What are the fundamental products for each of the input words;
ABCD = 0010, ABCD = 1100, ABCD = 1110. Write SOP expression.

Three marks questions:

1. Briefly explain the Boolean Postulates.


Prove algebraically that ( X + Y ) ( X + Z ) = X + YZ
2. Prove algebraically that X +XY = X + Y.
3.State and prove commutative law using Truth table.
4. Find the complement of the following :
̅ (B𝑪
a. 𝑨 ̅ +𝑩
̅ C) b. A𝑩̅ +𝑪
̅𝑫̅ c. XY+𝒀 ̅ Z +Z𝒁̅
5. Convert the following expressions to canonical Sum-of-Product form:
̅ Y+𝑿
a. X+𝑿 ̅𝒁̅ b. YZ+𝑿 ̅ Y c. A𝑩
̅ (𝑩
̅ +𝑪
̅)
6. Convert the following expressions to canonical Product-of-Sum form:
a. (A+C)(C+D) b. ( A(B+C)(𝑪 ̅ +𝑫̅ ) c. (X+Y)(Y+Z)(X+Z)
7. Construct a Boolean function of three variables X, Y and Z that has an output 1 when exactly two of X,
Y and Z are having values 0, and an output 0 in all other cases.
8. Construct a truth table for three variables A, B and C that will have an output 1 when XYZ = 100, XYZ =
101, XYZ = 110 and XYZ = 111. Write the Boolean expression for logic network in SOP form.
9 . Draw a general K-map for four variables A, B, C and D.
10. Write S-O-P expression corresponding to the function F in the following truth table and draw the
logic gate diagram ( use OR and AND gates)

A B C F
0 0 0 0
0 0 1 0
0 1 0 1
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 1

Five marks questions:


1.Briefly explain the working of all the Basic gates .
State and prove properties of 0 and 1 of Boolean algebra.
2. State and prove De Morgan’s first theorem by the method of perfect induction.
3. Using basic gates, construct a logic circuit for the Boolean expression(𝑿̅ +Y).(X+Z).(𝒀
̅ +Z).
4. State and prove De Morgan’s second theorem algebraically.
5. Given the Boolean function F (x, y, z) = Ʃ(0,2,4,5,6). Reduce it using Karnuagh map method.
6. Given the Boolean function F(A,B,C,D) = Ʃ (5,6,7,8,9,10,14) reduce the function using K-map. Write a
logic gate diagram for the reduced SOP expression.
7. Given the Boolean function F(A,B,C,D) = Π (0,2,4,6,8,10,14)reduce the function using K-map. Write a
logic gate diagram for the reduced POS expression.

You might also like