Scribd
Upload
10 views6 pages

Document

Ok

Uploaded by

thisisme461461
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
10 views6 pages

Document

Ok

Uploaded by

thisisme461461
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/ 6

Digital Logic Design

(CS302)
Assignment # 01
Spring 2024
Question No 01
Answer: To simplify the
given Boolean expression
using Karnaugh Map (K-
map) method, we need to
first construct a 5-
variable K-map. Then,
we’ll
group the adjacent 1s to
form the simplified
expression. Let’s begin
by
constructing the K-
map:CD
AB 00 01 11 10
00 - - - -
01 - - - -
11 - - - -
10 - - - -Now, let’s
mark the given minterms
and don’t care conditions
on the K-map:CD
AB 00 01 11 10
00 - - 6 7
01 - 8 9 10
11 15 16 17 18
10 19 - 24
25Grouping adjacent
1s:CD
AB 00 01 11 10
00 - - X X
01 - X X -
11 X X X X
10 X - X -This gives
us the simplified
expression: [ f(A,B,C,D,E)
= \Sigma
(0, 1, 13, 14, 27, 28, 29)
+ \Sigma m(7, 8, 9, 10,
15, 16, 17, 18, 19, 24,
25) ]Let me know if you
need further clarification

You might also like