Scribd
Upload
36 views

Assignment 1

This document contains an assignment with multiple questions related to digital logic design. It asks students to: 1) Convert Boolean expressions to standard and canonical SOP forms. 2) Develop truth tables for SOP expressions. 3) Simplify Boolean expressions using algebraic techniques. 4) Analyze and simplify a Boolean function using various methods. 5) Use Karnaugh maps to find minimum SOP and POS forms and draw logic diagrams.

Uploaded by

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

Assignment 1

This document contains an assignment with multiple questions related to digital logic design. It asks students to: 1) Convert Boolean expressions to standard and canonical SOP forms. 2) Develop truth tables for SOP expressions. 3) Simplify Boolean expressions using algebraic techniques. 4) Analyze and simplify a Boolean function using various methods. 5) Use Karnaugh maps to find minimum SOP and POS forms and draw logic diagrams.

Uploaded by

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

Digital Logic Design - Fall 2022 – Assignment-1

Q1. Convert the following expressions to standard and canonical sum-of-product (SOP) forms.
a) BC (C D+CE)
b) ( B+CD)(C + BD)
c) B+C [ BD+(C + D) E]

Q2. Develop a truth table for each of the following SOP expressions :
a) A B+ A B C+ A C+ ABC
b) A BC D+ AB C D+ A BCD + ABC D

Q3. Using Boolean algebra techniques, simplify the following expressions as much as possible:
a) A( A+ AB )
b) A BC + A BC + A B C
c) (C+ CD)(C+ C D)(C+ E)
d) BC +( B+C ) D+ BC

Q4. For the Boolean function


F= A B C + A B C + AB D+ A BD+ ABD
a) Obtain the truth table of F.
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).
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) A BC + A B C + A B C + AB C
b) A B+ A B+ C D+C D

Q6. Use a Karnaugh map to find the minimum POS form for each expression and draw the logic
diagram of reduced expression:
a) A(B+C)( A +C)( A+ B+C)( A+ B+C )
b) (X + Y )(W + Z )( X +Y + Z)(W + X +Y + Z)

You might also like