GATEverse Practice, past papers & mock tests
GATE 2025 · CS1 - Forenoon
Digital LogicLogic Functions and MinimizationhardMCQ2 marks
Consider the following four variable Boolean function in sum-of-product form F(b3,b2,b1,b0) = \(\sum m(0, 2, 4, 8, 10, 11, 12)\). where the value of the function is computed by considering b3b2b1b0 as a 4-bit binary number, where b3 denotes the most significant bit and b0 denotes the least significant bit. Note that there are no don't care terms. Which ONE of the following options is the CORRECT minimized Boolean expression for F?
Save your progress

Related Digital Logic PYQs