in Digital Logic edited by
2,963 views
10 votes
10 votes

The Boolean expression $\text{Y = (A}+\overline{\text{B}}+\overline{\text{A}}\text{B})\overline{\text{C}}$ is given by

  1. $\text{A}\overline{\text{C}}$
  2. $\text{B}\overline{\text{C}}$
  3. $\overline{\text{C}}$
  4. $\text{AB}$
in Digital Logic edited by
3.0k views

4 Answers

13 votes
13 votes
Best answer

$ Y = ( A + \bar{B} + \bar{A} B) \bar{C} $

$ Y = (A + (\bar{B} + \bar{A}) . (\bar{B} + B) ) \bar{C} $

$ Y = (A + \bar{B} + \bar{A} ) \bar{C} $

$ Y = ( (A + \bar{A}) + \bar{B}) \bar{C} $

$ Y = (1 + \bar{B}) \bar{C} $

$ Y = \bar{C} $

Answer would be Option C) $\bar{C}$


We have $A + \bar B$. When both are false, we get $\bar A . B$ which is given as the third term of logical OR. So, this part always return TRUE. 

selected by
by
3 votes
3 votes
Y=(A+B'+A'B) C'

  =(A+(B'+A').(B'+B) )C'

 =(A+B'+A')C'

= (1+B')C'

=C'

OPTION C

1 comment

u r correct shivani and very fast than me..smiley

–1
–1
2 votes
2 votes

Another Solution

At exam time, if you become clueless to reduce A+B'+A'B just make a truth table

A B A+B'+A'B
0 0 1
0 1 1
1 0 1
1 1 1

Clearly we can say A+B'+A'B=1 hence (A+B'+A'B)C'= 1.C' =C'

by
0 votes
0 votes
answer is(C) that is C bar
Answer:

Related questions