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).
Related questions
In Verilog HDL, the difference between `always @(*)` and `always @(posedge clk)` blocks isFor a synchronous counter with N flip-flops, the maximum count modulus is which value?A CMOS inverter's static power dissipation is dominated by which mechanism in modern deep-For a Mealy state machine vs a Moore state machine, the key behavioural difference is whicThe HAZARD called a 'static-1 hazard' in combinational logic refers to which?The Quine-McCluskey method differs from K-map minimisation primarily by which feature?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?