Question

Minimize the Boolean expression using Boolean identities: A′B+ABC′+BC’+AB′C′.

(a) B(AC)’ + AC’

(b) AC’ + B’

(c) ABC + B’ + C

(d) BC’ + A’B

I had been asked this question in an online interview.

This intriguing question comes from Minimization of Boolean Functions topic in chapter Boolean Algebra and Modeling Computations of Discrete Mathematics

Answer 1

Correct choice is (a) B(AC)’ + AC’

To explain: Given: A′B+ABC′+BC’+AB′C′

= A’B + BC’ (1 + A) + AB’C”

= A’B + BC’ + AB’C’

= A’B + BC’ + BC’ + AB’C’

= B(A’ + C’) + C’(A + AB’)

= B(AC)’ + C’ A(1 + B’)

= B(AC)’ + AC’.