2.

1 Simplify the following Boolean expressions to a minimum number of

literals:
(a) xy + xy’ = x ( y + y’ ) = x ( 1 ) = x

(b) ( x+y ) ( x+y’ ) = xx + xy’ + xy + yy’ = x + x ( y + y’ ) + 0 = x+x(1) = x

(c) xyz' + x'yz + xyz + x'yz' = xy ( z + z’ ) + x’y ( z + z’ ) = xy + x’y

= y ( x + x’ ) = y

(d) (x + y + z')(x' + y' + z) = xx’ + xy’ + xz + x’y + yy’ + yz + x’z’ + y’z’ + zz’

= xy’ + xz + yz + x’y + x’z’ + y’z’

( xy’ & x’y are xor ) , ( xz & x’z’ are xnor ) , ( yz & y’z’ are xnor )

= ( x⨁y ) + ( x⊙z ) + ( y⊙z )

(e) (a+b)’ (a’+b’) = ( a’b’ ) ( a’+b’) = a’a’b’ + a’b’b’ = a’b’ + a’b’ = a’b’

(f) (x + y' + z')(x' + z') = xx’ + xz’ + x’y’ + y’z’ + x’z’ + z’z’

= xz’ + x’y’ + y’z’ + x’z’ + z’ = z’ ( x+x’) + x’y’ + y’z’ + z’ = x’y’ + y’z’ + z’

(g) (a + b +c')(a'b' + c) =aa’b’ + ac + a’b’b + bc + a’b’c’ + cc’ = ac + bc + a’b’c’

(h) (bc' + a'd)(ab' + cd') = abb’c’ + bcc’d’ + aa’b’d + a’cdd’ = 0

(i) (a + b)' (a’ + b')' = ( a’b’) ( ab ) = 0

________________________________________________________________

2.2 Draw logic diagram of the circuits that implements the Simplified
expressions in problem 1.
(a) (b)

(c)

(d)
(e)

(f)

(g)

________________________________________________________________
2.3 Determine whether the following Boolean functions is true or false
(a) y’z’+yz’+x’z = x’+xz’

L.H.S : y’z’ + yz’ + x’z = z’ (y+y’) +x’z = z’+x’z = (z’+x’) (z’+z) = x’+ z’
R.H.S : x’+xz’ = (x’+ x ) (x’+z’) = x’+z’ { True }

Another Solution : L.H.S : y’z’ + yz’ + x’z = ∑ (𝟎, 𝟏, 𝟐, 𝟑, 𝟒, 𝟔)

R.H.S : x’+xz’= ∑ (𝟎, 𝟏, 𝟐, 𝟑, 𝟒, 𝟔) . ∵ ∑. = ∑. ∴ { True }
(b) xy + xz’ +y’z = y’z’ + xy + x’z’
11 10 01
R.H.S : xy + xz’ +y’z = ∑ (𝟏, 𝟒, 𝟓, 𝟔, 𝟕)
00 11 00
L.H.S : y’z’ + xy + x’z’ = ∑ (𝟎, 𝟐, 𝟒, 𝟔, 𝟕)
∵ ∑. ≠ ∑. ∴ { False }
________________________________________________________________

2.5 Given that a.b = 0 and a+b = 1, a’c = 0 , use the algebraic manipulation to
prove that (a+c).(a’+b).(b+c) = b.c

aa’ + ab + a’a + a’c + bc . (b+c) = bc (b+c) = bc + bc = bc

________________________________________________________________

2.6 Given two eight‐bit strings A = 10110000 and B = 00101101 , evaluate

the eight‐bit result after the following logical operations:

(a) AND (b) OR (c) XOR (d) NAND (e) NOR (f) NOT A

(a) 10110000 AND 00101101 = 00100000

(b) 10110000 OR 00101101 = 10111101

(c) 10110000 XOR 00101101 = 10011101

(d) 10110000 NAND 00101101 = 11011111

(e) 10110000 NOR 00101101 = 01000010

(f) NOT 10110000 = 01001111

To check your answer using calculator :

( Mode 4 log Shift 3 choose the gate )

________________________________________________________________
2.7 Express the following function as a sum of minterms and as a product of
maxterms: (a) b’d + a’d + bd , (b) bc’ + ab + cd
01 01 11
(a) b’d + a’d + bd

Sum fo Minterms : ∑( 1, 3, 5, 7 )

Product of Maxterms : π(0, 2, 4, 6 )

10 11 11
(b) bc’ + ab + cd

Sum fo Minterms :
∑( 3, 4, 5, 7, 11, 12, 13, 14, 15 )

Product of Maxterms : π(0, 1, 2, 6, 8, 9, 10 )

________________________________________________________________

2.8 Write Boolean expression and construct the truth tables describing the
outputs of the circuit for the following figure
01 10 11
F = x’y + xy’ + xz

Sum fo Minterms : ∑( 2, 3, 4, 5, 7 )

Product of Maxterms : π(0, 1, 6 )

________________________________________________________________
2.9 by means of timing diagram, show the signals of outputs f, g & h in the
following figure as functions of two inputs a & b ,use all 4 combination of a & b
f = a.h = a.a = a
g = a’b
h = a+f = a+a = a

________________________________________________________________

2.10 For the functions defined by the following truth table: a) find
Expressions of T1 & T2, b) draw logic diagram for T1 & T2, c) Simplify
T1 & T2 to a minimum number of literals, d) draw logic diagram for
simplified expressions
a) T1 = A’B’C’ + A’B’C + A’BC’
T2 = A’BC + AB’C’ + AB’C + ABC’ + ABC

b)

Draw T2 by yourself
c) T1 = A’B’C’ + A’B’C + A’BC’= A’B’ ( C+C’ ) + A’BC’ = A’B’ + A’BC’
= A’ ( B’+BC’) = A’ [ ( B’+B ) ( B’ + C’ ) ] = A’B’ + A’C’

T2 = T1’ = ( A + B ) ( A + C ) from Distributive Law T2 = A + BC

d)

________________________________________________________________

2.11 by means of timing diagram, show the signals of outputs f in the

following figure as functions of two inputs x & y, use all 4 combination of x & y

F = x’y + xy’

________________________________________________________________
2.12 Express the complement of the following functions in
sum‐of‐minterms form:

(a) F(A,B ,C, D) = ∑(2, 4, 7, 10, 12, 14)

(b) F ( x, y, z ) = П(3, 5, 7)
a) ∑’ = ∑( 0, 1, 3, 5, 6, 8, 9, 11, 13, 15 )

b) ∑( 0, 1, 2, 4, 6 )

∑’ = ∑( 3, 5, 7 )
________________________________________________________________

2.13 Convert each of the following to the other canonical form:

(a) F(x, y, z) = ∑(1, 3, 5)

(b) F(A, B, C, D) = П(3, 5, 8, 11)

a) π(0, 2, 4, 6, 7 )

b) ∑( 0, 1, 2, 4, 6, 7, 9, 10, 12, 13, 14, 15 )

________________________________________________________________

gemacht von : N.Y