This document discusses Boolean operations and Karnaugh maps. It introduces simplifying Boolean expressions using Boolean laws and Karnaugh maps. Examples of two-variable and three-variable Karnaugh maps are shown, along with techniques for looping pairs, quads and octets to simplify expressions. Students are assigned exercises simplifying Boolean expressions using Karnaugh maps and are directed to resources for more practice. The document provides an overview of using Boolean logic and Karnaugh maps to minimize logic circuits.

1. CHAPTER 2 :
BOOLEAN OPERATIONS
Part C

2. 2.4 Simplify combinational Logic
Circuits using:
a. Boolean Laws
( Already Discuss in Part B notes)
b. Karnough Map

3. Review:Boolean Simplification
Question: Using Boolean Rules/Laws/De Morgan
Theorem, simplify the expression below:
a. Y = AC (A B D) + A B C D + A B C
(5m)
b. Y = ABC (BD + CDE) + AC
(5m)
NOTES: Do and pass up to me tomorrow in my class.
This is to HELP u to COVER your QUIZ 1 MARK.

4. KARNAUGH MAP
� Provides a systematic method for
simplifying a Boolean expression or a
truth table function
� The K-map is a table consisting of N = 2n
cells, where n is the number of input
variables.
� The table format is such that there is a
single variable change between any
adjacent cells

5. Two variables K-map with
assume A and B as variable
Three variable K-map with
assume A, B and C as variable

6. � Looping
1. Looping of PAIR/TWO
� Looping a PAIR of adjacent 1s in a K-map
eliminates the variable that appears in
complemented and uncomplemented form

7. 2. Looping group of FOUR/QUAD
�
Looping a QUAD of adjacent 1s eliminate the two
variables that appear in both complemented and
uncomplemented form

8. 3.
Looping group of EIGHT/OCTET
� Looping an OCTET of adjacent 1s eliminates the
three variables that appear in the both
complemented and uncomplemented form

9. � Examples
Simplify this Boolean equation by using K-maps
F = X Y Z+ X Y Z + X Y Z

10. � Examples
Find out the equation based on the given

11. � Solution

12. More Exercises in K-Map

13. Question:
Use a K-map to minimize the following SOP
Boolean Expression
a. A B C + A B C + A B C + A B C + A B C
b. A B C D + A B C D + A B C D + A B C D + A B C D +
ABCD+ABCD+ABCD+ABCD
c. C ( A B + B ) + A B C + A B

14. � Discuss the answer with your lecturer.
� Do exercises in Tutorials.
END OF CHAPTER 2

15. REFERENCES: ]
1. "Digital Systems Principles And Application"
Sixth Editon, Ronald J. Tocci.
2. "Digital Systems Fundamentals"
P.W Chandana Prasad, Lau Siong Hoe,
Dr. Ashutosh Kumar Singh, Muhammad Suryanata.
Download Tutorials Chapter 2: Boolean Operations
@ CIDOS
http://www.cidos.edu.my