CAMBRIDGE INSTITUTE OF TECHNOLOGY

K.R. PURAM, BENGALURU-560036

Department of Computer Science and Engineering
Question Bank IA-1

1. What is a K-map? Show how a truth table is converted into K-map with an example.
2. Show the pair, quad, octet, rolling and overlapping in K – map and State advantages and
Limitations of K-map.
3. Define SOP and POS with an example.
4. Show the minimum sum of products expression for the function f(R, S, T) = (R’T’+RS’+RS)
using K – map.
5. Simplify the following Boolean expressions using K-map and write the circuit diagram
using basic gates.
i) f(A,B,C,D) = Σm ( 0, 1, 2, 4, 5, 12, 14) + d(8, 10)
ii) f(A,B,C,D) = Σm (0,2,4,5,8,12)+ d(1,10).
6. Simplify the following Boolean expressions using K-map by grouping 0’s and write the
Circuit diagram using basic gates.
i) f(A,B,C,D) = πM (3,6,7,9,11,13,14,15).d(1,10)
ii) f(A,B,C,D) = πM (8,11,14).d(2,9,15)
7. Design a combinational circuit with three inputs and one output. The output is 1 when the
binary Value of the inputs is less than 3. The output is 0 otherwise.
8. A digital system is to be designed in which the month of the year is given as I/P is four
bit form. The month January is represented as ‘0000’, February as ‘0001’ and so on. The
outputof the system should be ‘1’ corresponding to the input of the month containing 31
days or otherwise it is ‘0’. Consider the excess number in the I/P beyond ‘1011’ as don’t
care condition:
a. Write the truth table, SOP Σm and POS πM form
b. Solve for SOP using K-map
c. Realize using basic gates
9. A switching circuit has two control inputs (C1 and C2), two data inputs (X1 and X2) and
one output (Z). The circuit performs logic operations on the two data inputs as shown in
the table:

C1 C2 Function performed by the circuit

0 0 X1 . X2
0 1 X1 xor X2
 1 0 X1’ + X2
1 1 X1 equal X2

Develop a truth table for Z and use K – map to find minimum AND -OR gate
circuit torealize Z.
10. Determine the minimum sum of products expression for the given function using
Quine-McCluskey method.
(i) f(A,B,C,D) = Σm(0,2,3,4,8,10,12,13,14)
(ii) f(A,B,C,D) = Σm (1,3,4,5,6,7,10,12,13) +Σd (2,9,15)

11. Determine all prime implicants of the following given function and find all minimum
solutions using Petrick’s method.
(i) F(A,B,C,D) = Σm (7,12,14,15) + d(1,3,5,8,10,11,13).
(ii) F(a,b,c,d)=∑m((0,3,4,5,7,9,11,13).
12. Simplify F(A,B,C,D) = πM (3,6,7,9,11,13,14,15).d(1,10) using K – map. Give the
implementation of the simplified expression using NAND gates.

13.The system has four inputs. The output will be high only for the decimal equivalent of the
inputs is divisible by 3 or 7.

(i) Write the truth table, SOP Σm and POS πM form

(ii) Solve for SOP using K-map
(iii) Realize using basic gates
14.Simplify f(A,B,C,D) = Σm (0,1,3,5,7,9,11,13,15) + d(2,4) using Entered Variable Map.
15.What is a multiplexer? Show the design of 4:1 MUX.
16.What is a decoder? Show the working of 3 to 8 decoder.
17.Simplify the following using 3:8 decoder.
f1(a,b,c)=∑(0,4,6,7)
f2(a,b,c)=∑(1,4,5)
18. Simplify the following using 3:8 decoder.
F1 (A, B, C) = ∑m (0, 4, 6)
F2 (A, B, C) = ∑m (0, 5)
F3 (A, B, C) = ∑m (1, 2, 3, 7).
19. Implement the following:
(i) Full adder using 3 to 8 decoder.
(ii) 8-to- 3 priority encoder.
20. Realize the following:
(i) Octal to Binary encoder.
(ii) Decimal to BCD encoder.
(ii)
21.Realize f(A,B,C,D) = Σm (0,2,3,4,8,10,12,13,14) +dc(1,5,7) using an 8:1 Mux.
22. Determine the minimum sum of product expression for the function
f(A,B,C,D) = Σm (0,2,4,5,8,12) + d(1,10) using VEM and realize using 8:1 Mux.
23. Minimize the following function for SOP using K-map.
f(a,b,c,d)=Πm(5,7,13,14,15)+d(1,2,3,9)