In Boolean algebra, the absorption law A + A·B simplifies to which expression?
AB always (A drops out completely)
BA·B always less than A in all cases
CA (A dominates the OR when A=1)
DA + B always (B added to result)
Answer & Solution
Correct answer: C. A (A dominates the OR when A=1)
Absorption: A + A·B = A·(1 + B) = A·1 = A. Companion form A·(A+B) = A. Reduces gate count in two-level minimisation (Mano Ch.2).
Keep practising Gateece Digital
Browse all Gateece Digital questions for GATE ECE, or explore more Electronics topics.
Related questions
For a synchronous counter with N flip-flops, the maximum count modulus is which value?A SRAM cell typically uses how many MOSFETs per stored bit in the standard 6T topology?A Karnaugh map of n variables has how many cells, and adjacent cells differ in which way?A multiplexer (MUX) with n select lines can route which number of inputs to a single outpuA 2's complement representation in n bits can represent integers in which range?