Scribd
Upload
65 views2 pages

Questions On Boolean Algebra - Karnaugh Map

This document discusses Boolean algebra and Karnaugh maps. It defines the duality principle, which states that changing the operators (AND to OR and vice versa) and operands (0 to 1 and 1 to 0) of a Boolean expression derives another valid expression. It also defines De Morgan's theorem and using Karnaugh maps to minimize Boolean expressions into sum of products form. Several examples are provided of applying these concepts to derive dual expressions, use De Morgan's theorem, minimize using Karnaugh maps, and prove logical circuit equivalences.

Uploaded by

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

Questions On Boolean Algebra - Karnaugh Map

This document discusses Boolean algebra and Karnaugh maps. It defines the duality principle, which states that changing the operators (AND to OR and vice versa) and operands (0 to 1 and 1 to 0) of a Boolean expression derives another valid expression. It also defines De Morgan's theorem and using Karnaugh maps to minimize Boolean expressions into sum of products form. Several examples are provided of applying these concepts to derive dual expressions, use De Morgan's theorem, minimize using Karnaugh maps, and prove logical circuit equivalences.

Uploaded by

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

BOOLEAN ALGEBRA & KARNAUGH MAPS

DUALITY PRINCIPLE:
This states that starting with a Boolean relation, another Boolean relation can be derived
(a) Changing each OR sign (+) to an AND sign (.)
(b) Changing each AND sign (.) to an OR sign (+)
(c) Replacing each 0 by 1 and each 1 by 0
BREAK THE LINE CHANGE THE SIGN
Break the line, change the sign” – Is the demorganization which is performed by the following
steps:
(a) Complement the entire function
(b) Change all ANDs (.) to OR (+) and all ORs (+) to ANDs (.)
(c) Complement each of the individual variables.
1. Write out the dual of the following Boolean Expressions:

(a) (b)
(c) (d)

2. Find the complement of the following functions applying De’Morgan’s theorem:.


(a) (b)
(c) Use De’Morgan’s to show that:

3. What would be the complement of the following functions::


(a) (b)
(c)

4. Find the sum of products (SOP) and product of sums (POS) expressions for F1 and F2
from the table below:

1
Inputs Outputs
x y z F1 F2
0 0 0 0 0
0 0 1 0 1
0 1 0 1 1
0 1 1 1 0
1 0 0 1 0
1 0 1 0 0
1 1 0 0 1
1 1 1 1 1

5. Using the Karnaugh map technique obtain the simplified expressions as sum of products
(SOP) for the following maps
(a) (b)
P' P'Q PQ P' P'Q PQ
PQ Q ' ' PQ Q ' '
R 1     1 R     1 1
R' 1     1 R'     1 1
6. Draw and simplify the Karnaugh maps of x, y, z for
(a) (b)

(c) (d)
7. Using K-Map, simplify the following expressions, using sum of products (SOP) form:

(a)

(b)

8. Draw the logical circuit for the following Boolean expressions:


(a) (b)
(c) (d)

9. Prove that the two logical circuits are equivalent:

You might also like