K.S.
INSTITUTE OF TECHNOLOGY, BENGALURU
DEPT OF ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
Question Bank for AY 2025-26
Subject with Code: DDCO/BCS302
Branch: CSE ICB Class/Sec: III
MODULE 1
1) Obtain a minimum product of sums with a Karnaugh map F(w,x,y,z) =z’+wyz+w’y’z’+x’y.
2) Reduce the following function using K map technique and implement the expression
with basic gates: F(a,b,c,d)=∑m(0,16,8,9,10) + ∑d(3,7,14,15).
3) What are prime implicants? Find all prime implicants for the following expression using
Karnaugh map F(a,b,c,d)=∑m(0,2,3,4,8,10,12,13,14) + ∑d(11,15)
4) Simplify the following POS expression using Karnaugh map and implement using basic
gates F(a,b,c,d)=πM(0,1,3,4,5,7,11,12,13,14,15).
5) Simplify the following SOP expression using Karnaugh map and find prime implicants
and essential prime implicants F(a,b,c,d)=∑m(0,1,5,13,14,15) + dc(8,9,10,11)
6) Convert into POS and find minimal POS for the given expression
F(A, B, C, D) = Σm(1, 3, 4, 6, 8, 9, 11, 13, 15) + Σd(0, 2, 14)
7) What is binary logic? Explain all logic gates with name, graphic symbol, algebraic
function, truth table and timing diagram.
8) What is duality? List all the basic theorems.
9) What is the precedence to evaluate the Boolean expression? Explain with example.
10) Explain about minterms and maxterms with designation. Give an example for the same
in the form of SOP and POS.
11) a). Demonstrate the positive and negative logic using AND gate. b). Show that NAND
and NOR function are commutative and but not associative. c). S implify the Boolean
function F(w,x,y,z) = ∑m (0,1,2,4,6,7,9,12,14) using K-Map and implement using NAND
gates. d). what is Binary Logic? List out any 4 laws of logic.
12) a) Determine the complement of the following function:
(i) F=xy’ +x’y (ii) F= x’yz’ + x’y’z
b) Describe map method for three variables.
c) Apply K map technique to simplify the following function
(i) F(x,y,z) = ∑(0,2,4,5,6) (ii) x’y + yz’ + y’z’
13) a) Apply K map technique to simplify the function: F(w,x,y,z) = ∑(1,3,7,11,15) + d(0,2,5)
b) Determine all the prime implicants for the Boolean function F and also determine
which are essential F(w,x,y,z)=∑(0,2,4,5,6,7,8,10,13,15)
14) . a). Simplify the Boolean function i) F(x, y, z) = ∑(2,3,4,5) ii)F(x, y, z) = ∑(3,4,6,7)
b) Obtain a minimum product of sum with a Karnaugh Map
F(w,x,y,z) = x’z’ +wyz + w’y’z’ x’y
15) a). Reduce the following Boolean expressions to the minimum number of literals.
i) x(x’+y) ii) x + x’ y iii) (x + y) (x + y’) iv) xy + x’z + yz v) (x + y) (x’ + z)(y +z)
b). Determine the minimum SOP form using Karnaugh Map for
F = A’B’C’ + B’CD’ + A’BCD’ + AB’C
16 a). Simplify the Boolean function
F(w,x,y,z) = ∑(1,3,7,11,15) which has the don’t care conditions. d(w,x,y,z) = ∑(0,2,5)
b). Simplify and implement the following Boolean function using NAND gate
F(x,y,z) = (1,2,3,4,5,7)
17. Find the minimum sum of products for each
function using a Karnaugh map
18 a). Identify the prime implicants and essential prime implicants of the following functions:
i) f(A, B, C, D) = ∑(1, 3, 4, 5, 10, 11, 12, 13, 14, 15)
ii) f(W, X, Y, Z) = ∑(0, 1, 2, 5, 7, 8, 10, 15).
19 a). Demonstrate the working of NAND & XOR gate.
b).) Simplify the following Boolean function into (i) sum-of-products form and (ii) product-of-
sums form: F(A,B,C,D) = ∑(0,6,8,13,14)
d(A,B,C,D) = ∑(2,4,10)
20). a). Demonstrate the nonassociativity of the NOR gate.
b). Design a car safety alarm circuit diagram. The system considers four inputs: door (D),
key (K), seat pressure (P) and seat belt (B). The input is considered HIGH (1) if the door is
closed, the key is in, the driver is on the seat, or the seat belt is fastened. The alarm (A) should
sound with two conditions as stated below: The door is not closed, and the key is in. The door is
closed, the key is in the driver's seat, and the seat belt is not closed.
(a) Construct a truth table for the system based on input arrangement D, K, P, B with A as an
output
(b)Design a Karnaugh map to verify the simplified expression
(c) Draw the simplified circuit using NOR gates only.
21). A digital system is to be designed in which the month of the year is given as I/P in four-bit
form. The month of January is represented as '0000', February as "0001" and so on. The output
of the system should correspond 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:
(i) Write truth table, SOP ∑m and POS πM form
(ii) Simplify for SOP using K-map
(iii) Realize using basic gates.