railway RRB JE (CBT I + CBT II) Mock Test 2024 Digital Electronics Logic Gates and Boolean Algebra Karnaugh Maps
A 4 × 1 MUX used to implement a 3-input Boolean function is as shown above. The Boolean function F(A, B, C) implemented is:
1
F(A, B, C) = ∑(1, 2, 4, 6)
2
F(A, B, C) = ∑(1, 2, 6)
3
F(A, B, C) = ∑(2, 4, 5, 6)
4
F(A, B, C) = ∑(1, 5, 6)