engineering recuitment GATE CSE 2023-24 Test Series Digital Electronics Logic Gates and Boolean Algebra Karnaugh Maps
What is the minimum number of 2-input NAND gates needed to implement the function f(A, B, C, D) where f = f1 + f2 in which f1 denotes the sum of minterms and f2 denotes don't care terms?
f1 = ∑m (0, 1, 4, 8, 9, 13, 14)
f2 = dm( 5, 12, 15)
Assume that input's complement is not available
Enter numerical value using the virtual keypad. Round off where necessary.