HHMG
HHMG
Due Date:
Wednesday 16/9/2020
(To be Submitted on BlackBoard)
Important: Homework is an individual work and each student is expected do his own
work. Note letters such as, B, a, b, c, d, e, etc., represent Boolean variables, unless stated
otherwise.
(Make sure you show all steps.)
Sample Solution
1. Indicate whether the following statements are true or false (5 pts each)
a. An analog system contains devices that manipulate physical quantities that are
represented in analog form; the quantity varies over a discrete continuous range
of values.
X Y Z XY (XY)’ X’ Z’ (X’ Z’) (XY)’ + (X’ Z’) ((XY)’ + (X’ Z’))’ (YZ) (XY) + (YZ)
LHS RHS
0 0 0 0 1 1 1 1 1 0 0 0
0 0 1 0 1 1 0 0 1 0 0 0
0 1 0 0 1 1 1 1 1 0 0 0
0 1 1 0 1 1 0 0 1 0 1 1
1 0 0 0 1 0 1 0 1 0 0 0
1 0 1 0 1 0 0 0 1 0 0 0
1 1 0 1 0 0 1 0 0 1 0 1
1 1 1 1 0 0 0 0 0 1 1 1
As can be seen from the table, LHS ≠ RHS, for the input combination (X, Y, Z) =
(0,1,1). And hence this example proves that the equation is false.
4. Assume N and M are single digit positive numbers in base b. N, M 2 and b 3 and b N,
M. Perform the number conversion (NMN)b = ( ? )10 by writing the answer in terms of N, M
and Base-b in Decimal. (10 pts)
5. Draw the digital logic circuit representing the following Boolean expression: (10 pts)
F = ((a + b) . (c + d) )+ (bed)’
6. Write the following Boolean expression in the Standard Sum of Product form (SSOP).
F = (A+B)C
= AC + BC = AC(B + B’) + BC(A + A’) = ABC + AB’C + ABC + A’BC
= ABC + AB’C + A’BC
8. Draw the circuit represented by the Boolean expression F = (ab)’+ c’d’ + ac (10 pts)
9. Convert the circuit in question 6 to all NAND, redraw the circuit using on NAND gates and
write the all NAND Boolean expression. (10 pts)
Expression for solution 1 (all NAND) F = ((A’ B’)’ c)’’. To confirm conversion is correct, simplify as
follows: F = ((A’ B’)’ C) = (A’’ + B’’) = (A + B)C
Expression for solution 2 (all NAND) F = ((A C)’ (B C)’)’ = (A C)’’ + (B C)’’ = AC + BC