Scribd
Upload
258 views

Problems: A. Is An SOP Expression C. Is An SOP Expression

This document contains 10 problems related to boolean algebra and digital logic circuits. The problems ask the reader to identify sum-of-products expressions, derive truth tables from expressions, convert between SOP and POS forms, draw digital circuits, and identify reasons for using NAND gates. Several truth tables and boolean expressions are provided as examples to work through.

Uploaded by

Cameron Hulse
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
258 views

Problems: A. Is An SOP Expression C. Is An SOP Expression

This document contains 10 problems related to boolean algebra and digital logic circuits. The problems ask the reader to identify sum-of-products expressions, derive truth tables from expressions, convert between SOP and POS forms, draw digital circuits, and identify reasons for using NAND gates. Several truth tables and boolean expressions are provided as examples to work through.

Uploaded by

Cameron Hulse
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

Problems

Cameron Hulse

1. Which of the following boolean expressions are in proper sum-of-products form?


a. Is an SOP expression
c. Is an SOP expression
2. If a POS expression uses five input variables and has a sum within it that uses
only three variables, how many rows in the POS expression's truth table have
zeros as a result of that sum?

3. Draw the digital circuit corresponding to the following SOP expressions.

a.

b.

c.
4. Draw the NAND-NAND digital logic circuit for each of the SOP expressions shown
in problem 3.
Problems
Cameron Hulse

a.

b.

c.
5. List the two reasons why the NAND-NAND implementation of an SOP expression
is preferred over an AND-OR implementation.
a. Much shorter digital circuits, less inverters
Problems
Cameron Hulse

b. NAND gates are some of the fastest gates


6. Put the following boolean expression into the proper SOP format.
(A * !C) + (!A * B) + (!B * C)
7. Which form of boolean expression, SOP or POS, would best be used to implement
the following truth table?
Because there are 3 0’s but there are 5 1’s it would be best to use POS.
8. Derive the SOP and POS expressions for each of the truth tables shown below.
a. POS: (A+B+C)(A+!B+C)(A+!B+!C)(!A+B+C)(!A+B+!C)
SOP: (!A*!B*C)+(A*B*!C)+(A*B*C)

b. POS: (A+B+C)(A+!B+C)(!A+B+!C)(!A+!B+C)
SOP: (!A*!B*C)+(!A*B*C)+(A*!B*!C)+(A*B*C)

c. POS: (A+B+!C)(!A+B+!C)(!A+!B+!C)
SOP: (!A*!B*!C)+(!A*B*!C)+(!A*B*C)+(A*!B*!C)+(A*B*!C)
9. Derive the truth table for each of the following SOP expressions.
a.
A B C X

0 0 0 0

0 0 1 1

0 1 0 1

0 1 1 0

1 0 0 0

1 0 1 1

1 1 0 0

1 1 1 0

b.
A B C X

0 0 0 1
Problems
Cameron Hulse

0 0 1 1

0 1 0 1

0 1 1 1

1 0 0 1

1 0 1 0

1 1 0 1

1 1 1 0

c.
A B C X

0 0 0 1

0 0 1 0

0 1 0 0

0 1 1 1

1 0 0 1

1 0 1 0

1 1 0 1

1 1 1 0

10. Derive the truth table for each of the following POS expressions.
a.
A B C X

0 0 0 1
Problems
Cameron Hulse

0 0 1 1

0 1 0 0

0 1 1 1

1 0 0 1

1 0 1 0

1 1 0 0

1 1 1 1

b.
A B C X

0 0 0 0

0 0 1 0

0 1 0 1

0 1 1 1

1 0 0 1

1 0 1 0

1 1 0 1

1 1 1 0

c.
A B C X

0 0 0 1

0 0 1 0

0 1 0 1
Problems
Cameron Hulse

0 1 1 0

1 0 0 0

1 0 1 1

1 1 0 1

1 1 1 0

You might also like