in Set Theory & Algebra edited by
5,820 views
37 votes
37 votes

A logical binary relation $\odot$, is defined as follows: 

$$\begin{array}{|l|l|l|} \hline \textbf{A} & \textbf{B}& \textbf{A} \odot \textbf{B}\\\hline \text{True} & \text{True}& \text{True}\\\hline \text{True} & \text{False}& \text{True}\\\hline \text{False} & \text{True}& \text{False}\\\hline \text{False} & \text{False}& \text{True}\\\hline   \end{array}$$

Let $\sim$ be the unary negation (NOT) operator, with higher precedence then $\odot$.

Which one of the following is equivalent to $A\wedge B$ ?

  1. $(\sim A\odot B)$
  2. $\sim(A \odot \sim B)$
  3. $\sim(\sim A\odot\sim B)$
  4. $\sim(\sim A\odot B)$
in Set Theory & Algebra edited by
5.8k views

4 Comments

plz someone answer it, using truth table method
1
1
Oher way

Use kmap to obtain expression, then try to match with options.
0
0
We can also used truth table bcz they have only two variables
0
0

$\color{red}{\text{Find Video Solution Below:}}$

Detailed Video Solution

3
3

8 Answers

54 votes
54 votes
Best answer

This question is easier to answer with Boolean Algebra.

$A\odot B \equiv B\to A$, i.e. $(\neg B\vee A).$

Now, lets look at Option D

$\neg (\neg A\odot B)$
$\quad \equiv \neg (B\to \neg A)$
$\quad \equiv \neg (\neg B\vee \neg A)$
$\quad \equiv B\wedge A$

So, Answer is D.

Other options:

  1. $\neg B\vee \neg A$
  2. $\neg B\wedge \neg A$
  3. $\neg B\wedge  A$
edited by

2 Comments

even i thought like that.
0
0

$\color{red}{\text{Detailed Video Solution:}}$

Detailed Video Solution

4
4
16 votes
16 votes
Instead of checking all the answers, we can approach similar problems by finding out the relationship between the given operation and the one which we have to express.

Here,
\begin{align} A\odot B &= AB+A\bar B+\bar A \bar B\\ &= A+\bar B \\ &=\overline{\bar{A}B}  \end{align} $$ \overline{A\odot B} = \bar AB \implies AB = \color{red}{\overline{\bar A \odot B}}$$
edited by

2 Comments

nice thinking ....
0
0
How did you get this middle term?

AB(BAR)
0
0
9 votes
9 votes

This truth table is of B->A ie B' V A

so operator given in question is implication

we want A ∧B

which is B'->A'

so ans is d

2 Comments

@pooja, Option b = ~b ∧ ~a.
0
0
edited by
Similar que was asked In gate2009 it was asked for or there...i have answered it for gate 2009 i think answer was uploaded at wrong place..sry for that yes ans should be d for this que
0
0
6 votes
6 votes
we can also Answer this question by putting TRUE for both A and B, and the result should be TRUE for AND Operation,

By this method, only D will qualify.
Answer:

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true