Amrita School of Engineering, Bengaluru

19ECE204/19CSE203 Digital Electronics and Systems

III Sem- ECE & CSE
AY- 2020-21
Tutorial-2

1. Design the simplest circuit that implements the given function using (a) NAND gates only (b)
NOR gates only.

F (x, y, z) = Ʃ m (3,4,6,7)

2. Design the simplest circuit that implements the given function using (a) NAND gates only (b)
NOR gates only.

F (a, b, c) = ΠM (0,2,5)

3. Find the simplest realization of the function f (a, b, c, d) = Ʃm (0,3,4,7,9,10,13,14) using AND,
OR and NOT gates. Assume that the logic gates have a maximum fan-in of two.

4. Obtain the simplified expression in sum of products for the following Boolean functions
using Karnaugh-map:

(a) F (A, B, C, D) = Ʃ m (7, 13,14,15)

(b) F (w, x, y, z) = Ʃ m (2, 3, 12, 13, 14, 15)
(c) F (x, y, z) = xy + x’y’z’ +x’z
(d) F (a, b, c, d) = d (a’ +b) + b’ (c + ad)

5. Consider the Truth table shown in Fig. 1. Here x, y, z are inputs and F1 and F2 are outputs.

X Y Z F1 F2
0 0 0 1 0
0 0 1 1 0
0 1 0 1 0
0 1 1 0 1
1 0 0 0 1
1 0 1 1 1
1 1 0 0 1
1 1 1 1 1
Fig. 1

(a) Express F1 and F2 in sum of products form.

(b) Obtain the simplified functions for F1 and F2 in sum of products form using K-map.
(c) Draw the minimum cost logic circuit for F1 and F2 using NAND gates only.

6. Consider a circuit that has four inputs A, B, C, D and one output OUT. The output is equal to
1 when (1) all the inputs are equal to 1 or (2) none of the inputs are equal to 1 or (3) an odd
number of inputs are equal to 1.
(a) Write the truth table.
(b) Find the simplified output function in sum of products.
(c) Draw the logic diagram. (Assume both normal and completed inputs are available)
7. Determine the Boolean function for the output F of the circuit shown in Fig. 2. Obtain an
equivalent circuit with fewer NOR gates.

Fig. 2