Scribd
Upload
1K views2 pages

Computer Science (083) Boolean Algebra Worksheet

This document contains 14 questions about Boolean algebra and logic circuits. The questions cover topics such as designing NAND-to-NAND and NOR-to-NOR logic circuits, using Karnaugh maps to simplify Boolean expressions, writing Boolean expressions in sum of products and product of sums form, evaluating logic circuits and Boolean expressions, simplifying Boolean expressions using algebraic methods, writing duals, complements, and verifying logic laws.

Uploaded by

Niti Arora
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
Download as doc, pdf, or txt
1K views2 pages

Computer Science (083) Boolean Algebra Worksheet

This document contains 14 questions about Boolean algebra and logic circuits. The questions cover topics such as designing NAND-to-NAND and NOR-to-NOR logic circuits, using Karnaugh maps to simplify Boolean expressions, writing Boolean expressions in sum of products and product of sums form, evaluating logic circuits and Boolean expressions, simplifying Boolean expressions using algebraic methods, writing duals, complements, and verifying logic laws.

Uploaded by

Niti Arora
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
Download as doc, pdf, or txt
Download as doc, pdf, or txt
You are on page 1/ 2

Computer Science (083)

Boolean Algebra
Worksheet
Q1. Design NAND-to-NAND circuit for the following expressions
a. XYZ’ + X’Y’Z
b. (X + Y’).Z
c. Y’ Z + Z X’
d. (A+B) (B+D)
g. 3 input AND gate
e. 3 input OR gate
Q2. Design NOR-to-NOR circuit for the following expressions
a. X(Y’ + Z’) + XY’
b. X.Y’ + Z
c. (X + Y) (Y + Z) (X+Z)
d. F(A,B,C) = (A+B’) (B+C)
e. F(X,Y,Z) = (X’+Y) (Y’+Z)
f. (A’+B’+C’) (A+B’+C’) (A+B+C’)
Q3. Obtain a simplified form of a Boolean Expression using Karnaugh Map
a. F(W,X,Y,Z)=(2,3,6,10,11,14)
b. F(A,B,C,D)=(0,1,3,45,6,7,9,10,11,13,15)
c. F(A,B,C,D)=(0,1,3,45,6,7,9,10,11,13,15)
d. F(X,Y,Z)=(3,4,5,6,7)
e. F(A,B,C,D)=(0,1,2,5,6,8,9,10,13,15)
f. F(W,X,Y,Z)=(2,3,6,10,11,14) Find expression in POS form
g. F(X,Y,Z)=(3,4,5,6,7)
h. F(U,V,W,X)=(7,9,10,11,12,13,14,15)
i. F(U,V,W,X)=(0,2,3,7,8,10,11)
j. F(U,V,W,X)=(3,4,5,6,7,9,11,12,13,14,15)
Draw circuit diagrams for the simplified Boolean Expressions
Q4. Find the minimal SOP expressions for F1 and F2 using K-Map for the given
truth table for a function F(X,Y,Z),
X Y Z F1 F2
0 0 0 0 1
0 0 1 1 0
0 1 0 0 0
0 1 1 1 1
1 0 0 0 1
1 0 1 1 0
1 1 0 0 1
1 1 1 1 1
Q5. A combination circuit has 4 inputs and single output. Output is 1 if
i. All inputs are 1
ii. Even number of inputs are 1
iii. All inputs are 0
Make the truth table
Write Canonical SOP and POS forms of expressions
Simplify using K-Map (Both SOP and POS expressions)
Draw logic circuit diagram for simplified expression
Q6. A truth table having 4 input variables ( A, B, C, D) has an output 1 when
ABCD=0001 ABCD=0110 ABCD=1110
Express in SOP and POS
Q7. Evaluate logic circuit diagram

a b c
For i) a=1, b=1, c=0
ii) a=0, b=0, c=0
iii) a=1, b=1, c=1
Q8. Evaluate Boolean expression (w.x.y’ + (x’. y)’) for w=1, x=1, y=0, z=1
Q9. Simplify using algebraic method
1. AC+A’BC
2. XZ’ + X’Y’Z + X’YZ’ + Y’Z
3. (A+B)(A+B’)
4. abc+a’bc+ab’c+abc’+ab’c’+a’bc’a’b’c’
5. AB+AB’+A’C+(AC)’
6. XY ( X’YZ’+XY’Z’)
Q10. Verify the following :
1. A + A’B = A+B
2. (A+B)’ . (A’ + B’) = 0
3. AB + AB’ = A
4. X’Y+Z = (X’+Y’+Z).(X’+Y+ Z).(X+Y+Z)
5. (X+Y)(X+Z) = X+YZ
6. x’y’z’+x’y’z+x’yz+x’yz’+xy’z’+xy’z = x’+y’
7. a.(a+b)=a
8. (a’+b’).(a’+b).(a+b’) = a’b’
Q11. Write dual of following:
1. (x+y’) 3. a+1.bc
2. xy+xy’+x’y 4. a.a’=0
Q12. Write complement of following:
1. x’yz’ + x’y’z 3. xy(y+z)
2. Ab’ +c’d’ 4. x(y’z+yz)
Q13. State and verify Absorption Law using truth table.
Q14. State and verify Involution Law using truth table.
State and verify Idempotent Law using truth table.
State and verify Distriutive Law using truth table.
State and verify DeMorgan’s Law using truth table.

You might also like