What is the minimized expression for the Boolean function F(A, B, C, D) = Σ(0, 1, 2, 4, 5, 6, 10, 12, 13) using the K-map method?
Show answerHide answer
Correct answer: (B) A'B'C'D' + A'B'C'D + A'B'CD + A'BC'D + A'B'C'D' + A'BC'D
Explanation
The options only list minterms rather than a true minimal form; grouping on the K-map actually gives F = A'C' + BC' + A'D' + B'CD'. The key gives (B) as the closest listed expression.