Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Digital Electronics Logic Gates and Boolean Algebra Laws of Boolean Algebra
Consider the following in Boolean Algebra
X: a ∨ (b ∧ (a ∨ c)) = (a ∨ b) ∧ (a ∨ c)
Y: a ∧ (b ∨ (a ∧ c)) = (a ∧ b) ∨ (a ∧ c)
a ∨ (b ∧ c) = (a ∨ b) ∧ c is satisfied if
1
X is true
2
Y is true
3
Both X and Y are true
4
It does not depend on X and Y