engineering recuitment GATE CSE 2023-24 Test Series Digital Logic Number Representations and Computer Arithmetic Minimization of Boolean Expression
The minimum number of 2-input NAND gates required to realize the given Boolean function
f(A, B, C, D) = Σm (4, 5, 6, 8, 9, 10, 12, 13, 14)
Enter numerical value using the virtual keypad. Round off where necessary.