Digital Systems

Tutorial 3
March 2023

Tutorial:
1. Questions 1 through 6 prepared by Abhinav. G.
2. Questions 7 through 12 prepared by Shruthi. R.

Practice Problem:
1. Questions 1 through 4 prepared by Abhinav. G.
2. Questions 5 through 8 prepared by Shruthi. R.

1. Truth table with input a,b,c,d and output g3 , g2 , g1 , g0 . Implement the g1 output using NOR
gates and g2 and g0 using NAND gates.
Inputs Outputs
abcd g3 g2 g1 g0
0000 0000
0001 0001
0010 0011
0011 0010
0100 0110
0101 0111
0110 0101
0111 0100
1000 1100
1001 1101
1010 1111
1011 1110
1100 1010
1101 1011
1110 1001
1111 1000
2. Design a logic circuit for the following truth table using the minimum number of 2-input
NAND gates.

1
 x y z F
0 0 0 0
0 0 1 0
0 1 0 1
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 0
1 1 1 1

3. Draw the logic diagram using only two-input NOR gates to implement the following
F (A, B, C, D) = (A ⊕ B)′ (C ⊕ D)

4. Design a logic circuit for F using OR-NAND and for F ′ using NAND-AND for the two-level
forms for the following expression.
F = [(A + B)(A + C)(C + D)]′

5. Show that the dual of the exclusive-OR is also its complement.

6. Draw the multiple-level circuit for the following equation using:

w(x + y + z) + xyz

7. Design a logic circuit using NAND gates that has three inputs, A, B, and C, and whose output
will be HIGH only when a majority of the inputs are HIGH.
P
8. Implement the following Boolean function
P F (A, B, C, D) = (0, 1, 2, 9, 11) together with the
don’t-care condition d(A, B, C, D) = (8, 10, 14, 15) using no more than two NOR gates.
Assume that both the normal and complement inputs are available.
9. Design a logic circuit for each output using NAND gates with three inputs, x, y and z, and
the three outputs, A, B, and C. when the binary input is 0, 1, 2, or 3, the binary output is
one greater than the input. When the binary input is 4, 5, 6, or 7, the binary output is one
less than the input.
10. A car alarm system is to be designed considering 4 inputs door closed(D),key in(K),seat
pressure(S), seat belt closed(B). The alarm A should sound if:
1. the key is in and door is not closed
2. the door is closed the key is in, driver in the seat and seat belt is not closed.
The system is to be designed with NOR gates only and inputs are available in normal and
complement forms. How many number of gates are required?
P
11. Implement the function F (A, B, C) = (0, 2, 3, 4, 6) using 2-level AND-NOR , NAND-AND,
OR- NAND and NOR-OR logic gates after simplifying it in
(a) Sum of products. b) Product of sums:

2
12. What is the minimum number of 2-input NOR gates required Pto implement a 4- variable func-
tion expressed in sum-of-minterms form as F(A,B, C,D) = (0, 2, 5, 7, 8, 10, 13, 15). Assume
that all the inputs and their complements are available.

Practice Problems
1. The logic circuit with 4 inputs a, b, c, d and 5 outputs p, q, r, s, t. When binary inputs are
greater than 7, then binary output is two greater than the input otherwise input is equal to
output. Draw the circuit using NAND gates for output r and NOR gates for output q.Can
you guess which converter is this?

2. Draw multiple-level NOR circuit for the following expression:

(AB ′ + CD′ )E + BC(A + B)

3. Derive the circuits for a three-bit parity generator and a four-bit parity checker using an
odd-parity bit.
4. Draw the NOR circuit for the following truth table where A, B and Bin are the inputs and
Bout is the output.

A B Bin Bout
0 0 0 0
0 0 1 1
0 1 0 1
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 0
1 1 1 1
5. How many minimum 2-inputs NAND and NOR gate will be required to implement: AB + C
6. Design a logic circuit using NAND gate for each b and c output that accepts a 3 bit number as
input and generate an output binary number equal to square of the input number.( consider:
x,y,z as inputs and a,b,c,d,e,f as ouputs)
7. How many minimum numbers of NAND gate require to implement expression: (A+B)(C +D)
8. Give the NAND implementation of a circuit,using minimum gates, that gives HIGH when the
input is BCD equivalent of 5,7 or 9 and LOW otherwise?

3
Answers
1.

2.

3.

4.

4
5. Dual: (x ⊕ y)′
6. (i)

(ii)

7.

5
8.

9.
A = xy + xz + yz

B = x′ y ′ z + x′ yz ′ + xy ′ z ′ + xyz

6
 C = z′

10.

11.

(a)
F ′ = B ′ C + AC
F = (B ′ C + AC)′ = (B + C ′ )(A′ + C ′ )

7
AND-NOR
(B ′ C + AC)′ = (B + C ′ )(A′ + C ′ )

NAND-AND
(B ′ C)′ (AC)′ = (B + C ′ )(A′ + C ′ )

(b) F = C ′ + A′ B
Taking Complement:
F ′ = C(A + B ′ )
F = (C(A + B ′ ))′ = C ′ + (A′ B)

OR-NAND
(C(A + B ′ ))′ = C ′ + (A′ B)

8
 NOR-OR
C ′ + (A + B ′ )′ = C ′ + (A′ B)
12.

f = (B + D)(B + D)

Practice Problem Answers

2.

9
3.

4.

10
5.

6.

7.

8.

11
12