Boolean Minimization MCQs

Practice Boolean Minimization MCQs with four options, answers and explanations for focused Electronics & Telecommunication Engineering revision.

Question 1

Digital ElectronicsBoolean Minimization

A combinational circuit has F(A,B,C)=Σm(1,3,5,7). Which simplified expression represents F?

Show AnswerHide Answer Report an error

Correct Answer: C. C

Explanation: Minterms 1, 3, 5, and 7 are exactly the input combinations for which C=1, independent of A and B. Therefore F=C.

Reference: Standard digital electronics: Boolean minimization