Scribd
Upload
36 views2 pages

CS302 Assignment1 Solution

The document presents a solution to an assignment on Digital Logic Design, specifically focusing on a six-variable Boolean function. It details the process of expressing the function in canonical form and simplifying it using a Karnaugh map, ultimately concluding that the function simplifies to F(a,b,c,d,e,f) = c'd'. The work is attributed to Muhammad Umair Sarwar, a student in Spring 2025.

Uploaded by

Muhammad Umair
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
36 views2 pages

CS302 Assignment1 Solution

The document presents a solution to an assignment on Digital Logic Design, specifically focusing on a six-variable Boolean function. It details the process of expressing the function in canonical form and simplifying it using a Karnaugh map, ultimately concluding that the function simplifies to F(a,b,c,d,e,f) = c'd'. The work is attributed to Muhammad Umair Sarwar, a student in Spring 2025.

Uploaded by

Muhammad Umair
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

Digital Logic Design (CS302)

Assignment #01 Solution


Name: Muhammad Umair Sarwar

Student ID: bc200407168

Semester: Spring 2025

Question 1:
We are provided with a six-variable Boolean function:

F(a,b,c,d,e,f) = a'b'c'd'e'f + a'b'c'd'ef + a'b'c'de'f + a'b'c'def + a'bc'd'e'f + a'bc'd'ef + a'bc'de'f


+ a'bc'def + ab'c'd'e'f + ab'c'd'ef + ab'c'de'f + ab'c'def + abc'd'e'f + abc'd'ef + abc'de'f +
abc'def

Step 1: Expressing as Canonical Sum


To simplify this function, It is written as a sum of minterms by identifying the binary
values of each product term based on the presence or absence (i.e., complemented or
uncomplemented) of the variables:

 a'b'c'd'e'f → 000000 → m0
 a'b'c'd'ef → 000001 → m1
 a'b'c'de'f → 000010 → m2
 a'b'c'def → 000011 → m3
 a'bc'd'e'f → 001000 → m8
 a'bc'd'ef → 001001 → m9
 a'bc'de'f → 001010 → m10
 a'bc'def → 001011 → m11
 ab'c'd'e'f → 010000 → m16
 ab'c'd'ef → 010001 → m17
 ab'c'de'f → 010010 → m18
 ab'c'def → 010011 → m19
 abc'd'e'f → 011000 → m24
 abc'd'ef → 011001 → m25
 abc'de'f → 011010 → m26
 abc'def → 011011 → m27

Thus, the function can now be written in canonical form as:

F(a,b,c,d,e,f) = Σm(0, 1, 2, 3, 8, 9, 10, 11, 16, 17, 18, 19, 24, 25, 26, 27)
Step 2: K-Map Simplification
Since the function contains 6 variables, the K-map will be 64 cells in size. When I placed
all 16 specified minterms on the map, I noticed that they form a continuous block—a 4x4
square—where only variables c and d remain unchanged (specifically, c = 0, d = 0)
throughout all terms.

This allows grouping all 16 minterms into one large group, which results in a highly
simplified expression.

From K-map simplification, the function reduces to:

F(a,b,c,d,e,f) = c'd'

Final Solution:
After carrying out the canonical conversion and applying the K-map grouping strategy,
the Boolean function simplifies down to:

F(a,b,c,d,e,f) = c'd'

You might also like