A logical binary relation ⨀, is defined as follows: ABA⨀BTrueTrueTrueTrueFalseTrueFalseTrueFalseFalseFalseTrue
Let∼ be the unary negation (NOT) operator, with higher precedence, than ⨀. Which one of the following is equivalent to A∧B ?
A
(∼A⨀B)
No worries! We‘ve got your back. Try BYJU‘S free classes today!
B
∼(A⨀∼B)
No worries! We‘ve got your back. Try BYJU‘S free classes today!
C
∼(∼A⨀∼B)
No worries! We‘ve got your back. Try BYJU‘S free classes today!
D
∼(∼A⨀B)
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
Open in App
Solution
The correct option is D∼(∼A⨀B) By using min terms we can define.
A⨀ B = AB + AB′+A′B′
= A + A′B′ =(A+A′)⋅(A+B′)=A+B′
(a) ∼A⨀B=A′⨀B=A′+B′
(b) (∼A⨀∼B)=(A⨀B′)′=(A+(B′)′)′ =(A+B)′=A′B′
(c)∼(∼A⨀∼B)=(A′⨀B)′=(A′+B′)′)′
= (A′+B)′=AB′
(d)∼(∼A⨀∼B)=(A′⨀B′)=(A′+B′)′
= A ⋅ B = A ∧ B ∴ Only , choice (d) ≡A∧B
Note : This problem can also be done by constructing truth table for each choice and comparing with truth table for A ∧ B .