K- Map GATE 2024 Fundamental Quiz

The SOP form of a Boolean function is Σ (0, 1, 3, 7, 11) where inputs are A, B, C, D (A is MSB, D is LSB). The equivalent minimized expression of the function is?

For the given Boolean function, F = and d (don’t care) = wyz. Then minimum number of two input NAND gates and NOR gates required are ‘p’ and ‘q’ respectively. Find ______ (upto 1 decimal place).

Maximum number of P.I. present in the minimized expression with ‘n’ variable function is?

Let f(A, B) = A + B simplified expression for function f(f(x+y, y), z) is

If , then find the equivalent expression of .

Minimum number of 2-input NAND gates required to implement the function F = is?