Write down the Truth Table and give the SOP and POS forms of the following
boolean functions, also simplify them using the rules of boolean algebra and then
draw a minimised logic diagram for each function:

1. F = xy + x'y'z' + x'yz'

2. F = x'y' + yz + x'yz'

3. F = B'D + A'BC' + AB'C + ABC'

4. F = (A' + B' + D')(A + B' + C')(A' + B + D')(B + C' + D')

Here is a Truth Table, first write the SOP and POS expressions for this function, then simplify if possible, and draw a
logic diagram for it.

ABCD    F
0000       1
0001       0
0010       0
0011       1
0100       0
0101       1
0110       0
0111       0
1000       0
1001       0
1010       1
1011       0
1100       0
1101       0
1110       0
1111       1

Derive a logic diagram for a FULL SUBTRACTOR..... can it be implemented using 2 HALF subtractors ??????

EL10B Homepage