[go: up one dir, main page]
Scribd
Upload
9 views1 page

Tutorial 9 K Map

Uploaded by

doaalbedwy18
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
9 views1 page

Tutorial 9 K Map

Uploaded by

doaalbedwy18
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/ 1

Fundamentals of Logic Design , Winter Semester, 2023

College Of Electronic Technology


Tutorial 9- K- map

1. Draw the SOP K-map and give the minimized logic expression for the
following. (Show the groupings made in the K-map)

o f (x,y,z) = Σ m (0,1,2,4)

o f (x,y,z) = Σ m (0,1,2,3,4)

o f(a,b,c)=Σm(1,2,3,4,5,6)

o f(a,b,c,d)=Σm(2,3,9,10,11,13)

o f(a,b,c,d)=Σm(3,4,5,6,7,9,11,12,13,14,15)

o f(a,b,c,d)=Σm(0,1,2,3,4,6,8,9,10,12,13,14)

o f(a,b,c,d)=Σm(1,3,4,6,,9,12,13,14)

o f(a,b,c,d)=Σm(0,1,2,3,4,6,8,9,10,12,13,14)

2. Using Karnaugh maps, write the minimized Boolean expressions for


the following .
a) y = A BC+ AB C + ABC+A B C
b) F = A B C + AB C +A B C +A B C +ABC

3. Simplify the following Boolean expression using k- map


o f(A,B,C;D)=Π M(0,2,6,7,,8,10,12,13) Ans: f= (B+D)(A+𝐁+𝐂 )(A+B+𝐂 )

o f(A,B,C)=Π M(0,1,3) Ans: f= (A+B)(A+𝐂 )

4. For the Boolean equation f(A,B,C,D)= Σm(1,3.4,5,9,11,14,15) write


the maxterm and simplify K- map using SOP &POS and compare
the result for both.

Ismail youssef

You might also like