0% found this document useful (0 votes)
18 views3 pages

cs302 Assignment 1 Spring 2024

The document describes a digital logic design assignment to simplify a Boolean expression using a Karnaugh map. It provides the minterms, don't care conditions and variables. It then shows the Karnaugh map and groupings obtained from it, resulting in a final simplified expression of c' + b + a'd.

Uploaded by

zain chaudhary
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
0% found this document useful (0 votes)
18 views3 pages

cs302 Assignment 1 Spring 2024

The document describes a digital logic design assignment to simplify a Boolean expression using a Karnaugh map. It provides the minterms, don't care conditions and variables. It then shows the Karnaugh map and groupings obtained from it, resulting in a final simplified expression of c' + b + a'd.

Uploaded by

zain chaudhary
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/ 3

Digital Logic Design (CS302)

Assignment # 01
Spring 2024

VU ID: bc210415864 Total marks = 20


Deadline
st
1 of May 2024
Solution

Question No 01 Marks (20)


Consider the below given five (5) variable canonical sum:
∑ ( 6 ,7 , 8 , 9 , 10 ,11 ,12 , 15 ,16 , 17 , 18 , 19 ,24 ,25 , 26 , 30 , 31 )
( A , B ,C , D , E)

With the Don’t Care Conditions:


∑ ( 0 , 1 , 2, 3 , 13 ,14 ,27 ,28 , 29 )
( A , B ,C , D , E)

Simplify the given Boolean expression using the Karnaugh Map simplification method.

Note: Please consider the Don’t Care conditions and perform all steps of this method. In case of missing
steps, marks will be deducted.

Answer:

Given data:

Minterm = 6,7,8,9,10,11,12,15,16,17,18,19,24,25,26,30,31
DontCare = 0,1,2,3,13,14,27,28,29
Variable = a,b,c,d,e
using Karnaugh Map (Kmap solver)

00 11
A,B\C,D,E 000 011 010 111 101 100
1 0

00 0 1 3 2 6 7 5 4

01 8 9 11 10 14 15 13 12

11 24 25 27 26 30 31 29 28

10 16 17 19 18 22 23 21 20
Minterm = 6,7,8,9,10,11,12,15,16,17,18,19,24,25,26,30,31

0,1,2,3,13,14,27,28,29

A,B\C,D,E 000 001 011 010 110 111 101 100

00 X X X X 1 1 0 0
01 1 1 1 1 X 1 X 1
11 1 1 X 1 1 1 X X
10 1 1 1 1 0 0 0 0

Group-1 16 Cell Grouping

Positions = 0,1,2,3,8,9,10,11,16,17,18,19,24,25,26,27
Simplified Expression = c'
Group-2 16 Cell Grouping

Positions = 8,9,10,11,12,13,14,15,24,25,26,27,28,29,30,31
Simplified Expression = c' + b

Group-3 8 Cell Grouping

Positions = 2,3,6,7,10,11,14,15
Simplified Expression = c' + b + a'd

Final Expression = c' + b + a'd

THE END

You might also like