Академический Документы
Профессиональный Документы
Культура Документы
1. Determine the Boolean expression and construct a truth table for the switching circuit shown
below.
2. Determine the Boolean expression and construct a truth table for the switching circuit shown
below.
For the circuit to function, Z = A AND [(B AND C ) OR ( B AND C ) OR ( A AND B )] AND B
i.e. (
Z = A. B. B.C + B.C + A.B )
The truth table is shown below:
4. Determine the Boolean expression and construct a truth table for the switching circuit shown
below.
i.e. (
Z = C. B.C. A + A.( B + C ) )
The truth table is shown below:
A B C A C Z
B.C. A B+ C A.( B + C ) B.C. A + A.( B + C )
0 0 0 1 1 0 1 0 0 0
0 0 1 1 0 0 0 0 0 0
0 1 0 1 1 0 1 0 0 0
0 1 1 1 0 1 1 0 1 1
1 0 0 0 1 0 1 1 1 0
1 0 1 0 0 0 0 0 0 0
1 1 0 0 1 0 1 1 1 0
1 1 1 0 0 0 1 1 1 1
411 2014, John Bird
5. Construct a switching circuit to meet the requirements of the Boolean expression:
A.C + A. B .C + A.B
The switching circuit for the Boolean expression A.C + A. B .C + A.B is shown below:
The switching circuit for the Boolean expression A.B.C.(A + B + C) is shown below:
A.(A. B .C + B.(A + C ))
The switching circuit for the Boolean expression A.(A. B .C + B.(A + C )) is shown below:
_ _ _
The Boolean expression for column 4 is: A . B .C + A.B. C
9. Derive the Boolean expression and construct the switching circuit for column 5 in the truth table
shown in Problem 8.
_ _ _ _ _ _
The Boolean expression for column 5 is: A . B . C + A .B.C + A. B . C
10. Derive the Boolean expression and construct the switching circuit for column 6 in the truth
table shown in Problem 8.
1. Simplify: P . Q + P .Q
P . Q + P .Q = P. ( Q + Q ) =
P. (1) from 10, Table 26.7
= P
_ _ _
2. Simplify: P .Q + P.Q + P . Q
= P + P.Q
(
3. Simplify: F .G + F .G + G. F + F )
( )
F .G + F .G + G. F + F = F .G + F .G + G (1) = F .G + F .G + G from 10, Table 26.7
( )
= G. F + F + G = G.1 + G = G + G from 10, Table 26.7
(
4. Simplify: F .G + F . G + G + F .G )
( )
F .G + F . G + G + F .G = F .G + F .1 + F .G= F .G + F + F .G
( )
= F . G + G + F = F .1 + F
(
= H . F + F .G )
_ _ _
7. Simplify: F. G . H + F.G.H + F .G.H
= F .G.H + G.H
(
P.Q.R + P.Q.R + P.Q.R = Q.R. P + P + P.Q.R )
= Q.R + P.Q.R from 10, Table 26.7
= G. F + F( )
=G from 10, Table 26.7
_ _ _ _
10. Simplify: F. G .H + F.G.H + F.G. H + F .G. H
= F .H + G.H
_ _ _ _ _
11. Simplify: R.(P.Q + P. Q ) + R .( P . Q + P .Q)
= P.R + P.R
( )
12. Simplify: R. P.Q + P.Q + P.Q + P. Q.R + Q.R ( )
( ) ( )
R. P.Q + P.Q + P.Q + P. Q.R + Q.R = R.P.Q + R.P. Q + Q + P.R. Q + Q ( ) ( )
= R.P.Q + R.P + P.R from 10, Table 26.7
(
= R.P.Q + P. R + R )
= R.P.Q + P from 10, Table 26.7
( A.B ) .( =
A.B ) ( A.B ) . ( A =
+ B ) ( A.B ) . ( A + B ) by de Morgans law,
= A.B
( )(
( A + B.C ) + ( A.B + C ) = A . B.C + A + B + C ) by de Morgans law
= A.B.C + A + B + C
= C.( A.B + 1) + A + B
( )( )(
( A.B + B.C ). A.B = A.B . B.C . A + B ) by de Morgans law
( )(
= A+ B . B +C . A+ B )( )
( )(
= A+ B . B +C . A+ B )( )
(
= A.B + A.C + B.B + B.C . A + B )( )
(
= A.B + A.C + B + B.C . A + B )( ) from 13, Table 26.7
( )(
= A.B + A.C + B . A + B ) from 15, Table 26.7
(
= B . ( A + 1) + A.C . A + B )
= A. B + B . B + A.C. A + A.B.C
= A. B + A.B.C
4. Simplify: ( A. B + B .C ) + ( A. B )
( A. B + B .C ) + ( A. B ) = ( A + B + B + C ) + A + B by de Morgans law
= A+ B + B +C + A+ B
= ( A + A) + ( B + B ) + C + B
=1+C+1+ B
(
( P.Q + P.R).( P.Q.R) = P + Q + P + R
)( ) . P .(Q + R ) by de Morgans law
( )(
= P + Q + P + R P .Q + P . R )
= (1 + Q + R ) . ( P . Q + P . R )
= P . Q + P . R + Q. P . Q + Q . P . R + R . P . Q + R . P . R
(
= P . Q + R + Q.R + R . Q )
(
= P. Q + R + R Q + Q ( ))
(
= P. Q + R + R) from 10, Table 26.7
_
l . Use Karnaugh map techniques to simplify: X .Y + X.Y
X .Y corresponds to X = 0, Y = 1, i.e. the bottom left hand cell of the Karnaugh map, shown as a 1.
_ _ _
2. Use Karnaugh map techniques to simplify: X . Y + X .Y + X.Y
_ _ _
Hence, X . Y + X .Y + X.Y
simplifies to: X +Y
P . Q corresponds to P = 0, Q = 0, i.e. the top left-hand cell of the Karnaugh map, shown as a 1.
If a Boolean expression contains brackets it is often easier to remove them, using the laws and rules
of Boolean algebra, before plotting the function on a Karnaugh map.
Thus, A.C + A.( B + C ) + A.B.(C + B) = A.C + A.B + A.C + A.B.C + A.B.B
A.C corresponds to A = 1, C = 0, shown as 1s in the two right-hand cells in the top row
A.B corresponds to A = 0, B = 1, shown as 1s in the two cells in the second column
A.C corresponds to A = 0, C = 1, shown as 1s in the two left-hand cells in the bottom row
A.B.C corresponds to A = 1, B = 1, C = 1, shown as a 1 in the cell in the third column, bottom row
A four-cell couple and two two-cell couples are formed as shown by the broken lines
The only variable common to the four-cell couple is B = 1, i.e. B
The variable common to the two-cell couple on the top right of the map is A = 1 and C = 0, i.e. A.C
The variables common to the two-cell couple on the bottom left of the map is A = 0 and C = 1, i.e.
A.C
_ _ _ _ _ _
5. Use Karnaugh map techniques to simplify: P . Q . R + P .Q. R + P.Q. R
For the left-hand cell, the variables common are P = 0, R = 0, i.e. P.R
For the right-hand cell, the variables common are Q = 1, R = 0, i.e. Q.R
_ _ _ _ _ _
Hence, P . Q . R + P .Q. R + P.Q. R may be simplified to: P.R + Q.R
P.R + Q.R or R. ( P + Q )
_ _ _ _ _ _
i.e. P . Q . R + P .Q. R + P.Q. R simplifies to:
A.B.C .D , i.e. A = 0, B = 1, C = 0 and D = 1, is shown as a 1 in the second line, second left cell
(
Hence, A.B.C .D + A.B.C .D + A.B.C .D simplifies to: A . B . C + A . C . D or A . C . B + D )
(
Hence, A.B.C.D + A.B.C.D + A.B.C.D simplifies to: A . B . C + B . C . D or B . C . A + D )
9. Use Karnaugh map techniques to simplify:
A two-cell couple is formed as shown and the variables common to it are B = 1, C = 0 and D = 1,
i.e. B.C.D
A four-cell couple is formed as shown and the variables common to it are A = 1, D = 1, i.e. A . D
B.C.D + A . D or D. ( A + B.C )
10. Use Karnaugh map techniques to simplify: A.B.C.D + A.B.C.D + A.B.C.D + A.B.C.D + A.B.C.D
A four-cell couple is formed as shown and the variables common to it are A = 1, D = 0, i.e. A . D
A.D + A . B . C . D
The Karnaugh map for the given expression is shown below. A four-cell couple and three two-cell
The variables common to the two-cell couple on the far right of the top row are A = 1, C = 0 and
D = 0, i.e. A . C . D
The variables common to the two-cell couple on the far left and far right of the top row are B = 0,
C = 0 and D = 0, i.e. B . C . D
425 2014, John Bird
The variables common to the two-cell couple at the top and bottom of the first column are A = 0,
B = 0 and D = 0, i.e. A . B . D
i.e. (
A.C + A.C . D + B . D . A + C )
_
1. Devise a logic system to meet the requirements of the Boolean expression: Z = A + B.C
_
The logic system for the Boolean expression Z = A + B.C is as shown below:
_ _
2. Devise a logic system to meet the requirements of the Boolean expression: Z = A. B + B. C
_ _
The logic system for the Boolean expression Z = A. B + B. C is as shown below:
_ _ _
The logic system for the Boolean expression Z = A.B. C + A . B .C is as shown below:
_ _
The logic system for the Boolean expression Z = ( A + B).( C + D) is as shown below:
From column 4, Z1 = A . B . C + A . B . C + A . B . C + A . B. C + A . B . C
The Karnaugh map is shown below.
From column 5, Z 2 = A . B . C + A . B . C + A . B . C + A . B. C
The Karnaugh map is shown below.
Hence, Z 2 = A . B . C + A . B . C + A . B . C + A . B. C
simplifies to: =
Z 2 A.B + B.C
7. Simplify the expression given in column 6 of the truth table of Problem 5 and devise a
From column 6, Z 3 = A . B . C + A . B . C + A . B . C + A . B. C + A . B . C
The Karnaugh map is shown below.
_ _ _
8. Simplify the Boolean expression: P . Q + P .Q + P.Q and devise a logic circuit to meet the
requirements of the simplified expression.
_ _ _
Let Z = P . Q + P .Q + P.Q
_ _ _
Hence, Z = P . Q + P .Q + P.Q
simplifies to: Z= P + Q
9. Simplify the Boolean expression: P.Q.R + P.Q.R + P.Q.R and devise a logic circuit to meet the
requirements of the simplified expression.
The two-cell couple on the far right of the map corresponds to: P . R
(
simplifies to: P . R + Q. R or R. P + Q )
A logic circuit to meet these requirements is shown below.
_ _ _ _ _ _
10. Simplify the Boolean expression: P. Q .R + P. Q . R + P . Q . R and devise a logic circuit to
meet the requirements of the simplified expression.
_ _ _ _ _ _
The Karnaugh map for the Boolean expression: P. Q .R + P. Q . R + P . Q . R is shown below.
(
simplifies to: P . Q + Q. R or Q. P + R )
A logic circuit to meet these requirements is shown below.
The two-cell couple on the bottom row of the map corresponds to: A . C . D
(
simplifies to: A. C . D + B. D or D. A . C + B )
A logic circuit to meet these requirements is shown below.
12. Simplify the Boolean expression: ( P.Q.R ).( P + Q.R ) and devise a logic circuit to meet the
The Karnaugh map for the Boolean expression: ( P.Q.R ).( P + Q.R ) is shown below.
P . Q . R is shown with 2s
( )( )
Hence, P.Q.R . P + Q.R is represented by the cells containing both 2s and 4s
_ _
2. Use nand-gates only to devise the logic system: Z = A. B + B. C
_ _
The logic system to meet the requirements of Z = A. B + B. C is shown below:
_ _ _
3. Use nand-gates only to devise the logic system: Z = A.B. C + A . B .C
_ _ _
The logic system to meet the requirements of Z = A.B. C + A . B .C is shown below:
_ _
4. Use nor-gates only to devise the logic system: Z = ( A + B).( C + D)
_ _
The logic system to meet the requirements of Z = ( A + B).( C + D) is shown below:
_ _ _
The logic system to meet the requirements of Z = A. B + B. C + C. D is shown below:
_
6. Use nor-gates only to devise the logic system: Z = P .Q + P.(Q + R)
_
The logic system to meet the requirements of Z = P .Q + P.(Q + R) is shown below:
7. In a chemical process, three of the transducers used are P, Q and R, giving output signals of
either 0 or 1. Devise a logic system to give a 1 output when:
(a) P and Q and R all have 0 outputs, or when
(b) P is 0 and (Q is 1 or R is 0).
( )
P .Q . R + P . Q + R = P .Q . R + P .Q + P . R
( )
= P . R . Q + 1 + P .Q
= P . R + P .Q
(
= P. Q + R )
A logic circuit to satisfy this Boolean expression is shown below:
9. A water tank feeds three separate processes. When any two of the processes are in operation at
the same time, a signal is required to start a pump to maintain the head of water in the tank.
Devise a logic circuit using nor-gates only to give the required signal.