- #1

General_Sax

- 446

- 0

**Boolean function - minterms -- literals**

## Homework Statement

(a) Describe the circuit in a form of a Boolean function F(A, B, C, D, E). Convert this

expression to the sum of products form that includes minimal number of literals, and next

express this function as a sum of minterms, namely F(A, B, C, D, E) = m(….).

## Homework Equations

xx

## The Attempt at a Solution

I wrote out a truth table for the function and have a total of 11 terms. I might as well write it out here:

F = A'B'CD'E + A'B'CDE + A'BC'DE + A'BCD'E + A'BCDE + AB'C'DE + AB'CD'E + AB'CDE + ABC'DE + ABCD'E + ABCDE

next step: Convert this expression to the sum of products form that includes minimal number of literals.

Do they want me to K-map the function, or do they want me to simplify the expression algebraically (boolean algebra obviously)?EDIT: one more question: What is the difference between a complement and a dual??

Last edited: