Topic: Digital Circuits
The truth table for implementing a boolean variable F is given by ... where d represents don't care states. The minimized expression for F is
- A. $B\cdot\overline{C}+A\cdot\overline{C}+A\cdot B$
- B. $A\cdot B+\overline{C}$
- C. $\overline{A}\cdot B\cdot\overline{C}+A\cdot\overline{B}\cdot\overline{C}+A\cdot B\cdot C$
- D. None of above
Answer: B. $A\cdot B+\overline{C}$
Explanation: Solving via K-map using the given truth table minterms and don't care conditions results in $F = \overline{C}+AB$.