Scribd
Upload
79 views

Assignment1 Solution

This document contains solutions to a digital logic design assignment involving simplifying Boolean expressions using sum-of-products form, canonical SOP form, Boolean algebra, Karnaugh maps, and truth tables. It includes 6 questions with multiple parts analyzing and minimizing logic expressions and developing their truth tables and logic diagrams.

Uploaded by

Syed Abdullah Hasan Chishti
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
79 views

Assignment1 Solution

This document contains solutions to a digital logic design assignment involving simplifying Boolean expressions using sum-of-products form, canonical SOP form, Boolean algebra, Karnaugh maps, and truth tables. It includes 6 questions with multiple parts analyzing and minimizing logic expressions and developing their truth tables and logic diagrams.

Uploaded by

Syed Abdullah Hasan Chishti
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Digital Logic Design - Fall 2022 – Assignment-1 - Solution

Q1. Convert the following expressions to standard and canonical sum-of-product (SOP) forms.
a) 𝐵𝐶(𝐶̅ 𝐷
̅ + 𝐶𝐸)

b) (𝐵 + 𝐶𝐷)(𝐶 + 𝐵𝐷)

c) 𝐵 + 𝐶[𝐵𝐷 + (𝐶̅ + 𝐷)𝐸]


Q2. Develop a truth table for each of the following SOP expressions:
a) 𝐴̅𝐵 + 𝐴𝐵̅𝐶 + 𝐴̅𝐶̅ + 𝐴𝐵𝐶̅

Truth Table
INPUT OUTPUT
A B C Y
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 0
b) 𝐴̅𝐵𝐶𝐷
̅ + 𝐴𝐵𝐶̅ 𝐷 + 𝐴̅𝐵̅𝐶𝐷 + 𝐴𝐵𝐶𝐷

Truth Table
INPUT OUTPUT
A B C D Y
0 0 0 0 0
0 0 0 1 0
0 0 1 0 0
0 0 1 1 1
0 1 0 0 0
0 1 0 1 0
0 1 1 0 1
0 1 1 1 0
1 0 0 0 0
1 0 0 1 0
1 0 1 0 0
1 0 1 1 0
1 1 0 0 0
1 1 0 1 1
1 1 1 0 0
1 1 1 1 1

Q3. Using Boolean algebra techniques, simplify the following expressions as much as possible:
a) 𝐴(𝐴̅ + 𝐴𝐵)
b) 𝐴𝐵̅ 𝐶 + 𝐴̅𝐵𝐶 + 𝐴̅𝐵̅ 𝐶

c) (𝐶 + 𝐶𝐷)(𝐶 + 𝐶̅ 𝐷)(𝐶 + 𝐸)

d) 𝐵𝐶 + (𝐵̅ + 𝐶̅ )𝐷 + 𝐵𝐶
Q4. For the Boolean function
𝐹 = 𝐴𝐵̅𝐶 + 𝐴̅𝐵̅𝐶 + 𝐴𝐵𝐷
̅ + 𝐴̅𝐵𝐷 + 𝐴𝐵𝐷

a) Obtain the truth table of F.


Truth Table
INPUT OUTPUT
A B C D Y
0 0 0 0 0
0 0 0 1 0
0 0 1 0 1
0 0 1 1 1
0 1 0 0 0
0 1 0 1 1
0 1 1 0 0
0 1 1 1 1
1 0 0 0 0
1 0 0 1 0
1 0 1 0 1
1 0 1 1 1
1 1 0 0 1
1 1 0 1 1
1 1 1 0 1
1 1 1 1 1

b) Draw the logic diagram, using the original Boolean expression.


c) Use Boolean algebra to simplify the function to a minimum number of literals.

d) Obtain the truth table of the function from the simplified expression and show that it is
the same as the one in part (a).
Truth Table
INPUT OUTPUT
A B C D Y
0 0 0 0 0
0 0 0 1 0
0 0 1 0 1
0 0 1 1 1
0 1 0 0 0
0 1 0 1 1
0 1 1 0 0
0 1 1 1 1
1 0 0 0 0
1 0 0 1 0
1 0 1 0 1
1 0 1 1 1
1 1 0 0 1
1 1 0 1 1
1 1 1 0 1
1 1 1 1 1
e) Draw the logic diagram from the simplified expression, and compare the total number
of gates with the diagram of part (b).

Q5. Use a Karnaugh map to find the minimum SOP form for each expression and draw the logic
diagram of reduced expression:
a) 𝐴̅𝐵̅ 𝐶̅ + 𝐴𝐵̅ 𝐶̅ + 𝐴̅𝐵𝐶̅ + 𝐴𝐵𝐶̅

b) 𝐴̅𝐵̅ + 𝐴𝐵̅ + 𝐶̅ 𝐷
̅ + 𝐶𝐷
̅
Q6. Use a Karnaugh map to find the minimum POS form for each expression and draw the logic
diagram of reduced expression:
a) 𝐴(𝐵 + 𝐶̅ )(𝐴̅ + 𝐶)(𝐴 + 𝐵̅ + 𝐶)(𝐴̅ + 𝐵 + 𝐶̅ )

b) (𝑋 + 𝑌̅)(𝑊 + 𝑍̅)(𝑋̅ + 𝑌̅ + 𝑍̅)(𝑊 + 𝑋 + 𝑌 + 𝑍)

You might also like