Home
Class 12
PHYSICS
In Boolean algebra bar((A+barB))*C will ...

In Boolean algebra `bar((A+barB))*C` will be equal to

A

`(barA*B)+barC`

B

`(A*barB)+C`

C

`(A*B)*C`

D

`(A+barB)+C`

Text Solution

AI Generated Solution

The correct Answer is:
To solve the Boolean algebra expression `bar((A + barB) * C)`, we will apply De Morgan's Theorem step by step. ### Step-by-Step Solution: 1. **Identify the Expression**: We start with the expression: \[ \overline{(A + \overline{B}) \cdot C} \] 2. **Apply De Morgan's Theorem**: According to De Morgan's Theorem, the negation of a product is equal to the sum of the negations: \[ \overline{(X \cdot Y)} = \overline{X} + \overline{Y} \] Here, let \( X = (A + \overline{B}) \) and \( Y = C \). Thus, we can write: \[ \overline{(A + \overline{B}) \cdot C} = \overline{(A + \overline{B})} + \overline{C} \] 3. **Negate the Sum**: Now we need to negate \( (A + \overline{B}) \). Again, we apply De Morgan's Theorem: \[ \overline{(A + \overline{B})} = \overline{A} \cdot \overline{\overline{B}} = \overline{A} \cdot B \] Therefore, substituting this back into our equation gives: \[ \overline{(A + \overline{B}) \cdot C} = (\overline{A} \cdot B) + \overline{C} \] 4. **Final Expression**: The final simplified expression is: \[ \overline{A} \cdot B + \overline{C} \] ### Conclusion: Thus, the expression `bar((A + barB) * C)` simplifies to: \[ \overline{A} \cdot B + \overline{C} \]

To solve the Boolean algebra expression `bar((A + barB) * C)`, we will apply De Morgan's Theorem step by step. ### Step-by-Step Solution: 1. **Identify the Expression**: We start with the expression: \[ \overline{(A + \overline{B}) \cdot C} ...
Promotional Banner

Topper's Solved these Questions

  • ELECTRONIC DEVICES

    MTG GUIDE|Exercise CHECK YOUR BEET VITALS|25 Videos
  • ELECTRONIC DEVICES

    MTG GUIDE|Exercise AIPMT/NEET (MCQs)|42 Videos
  • ELECTRONIC DEVICES

    MTG GUIDE|Exercise AIPMT/NEET (MCQs)|42 Videos
  • ELECTROMAGNETIC WAVES

    MTG GUIDE|Exercise AIPMT/NEET(MCQs)|15 Videos
  • ELECTROSTATICS

    MTG GUIDE|Exercise AIPMT/NEET (MCQ.s)|34 Videos

Similar Questions

Explore conceptually related problems

In Boolean algbra barA.barB rquals

In the Boolean algebra bar((bar(A).bar(B))). A equal to

In the Boolean algebra bar(A).bar(B) equals

In the Boolean algebra bar(A).bar(B) equals is :-

In the Boolean algebra : A + B =

In Boolean algebra, A + B = Y implies that

bar(A.barB+barA.B) is equivalent to

If A = B = 1 , then in terms of Boolean algebra the value of A.B + A is not equal to.

In a Boolean Algebra B, for all x in B. 1' is equal to

In Boolean algebra A + B = Y implies that :

MTG GUIDE-ELECTRONIC DEVICES-NEET CAFÉ (TOPICWISE PRACTICE QUESTIONS)
  1. The Boolean equation for the circuit given in figure is

    Text Solution

    |

  2. Select the outputs Y of the combination of gates shown below for input...

    Text Solution

    |

  3. Which logic gate is represented by the following combination of logic ...

    Text Solution

    |

  4. The circuit as shown in the figure is equivalent to

    Text Solution

    |

  5. The logic circuit shown below has the input waveforms A and B as shown...

    Text Solution

    |

  6. The output Y of the logic circuit as shown in figure is

    Text Solution

    |

  7. NAND gates can be used to form AND gate. What is the the minimum numbe...

    Text Solution

    |

  8. The circuit as shown in figure is equivalent to

    Text Solution

    |

  9. The simplified Y output of the given logic circuit is

    Text Solution

    |

  10. In Boolean algebra bar((A+barB))*C will be equal to

    Text Solution

    |

  11. The circuit as shown in figure is equivalent to

    Text Solution

    |

  12. The output Y of the logic circuit as shown in figure is best represent...

    Text Solution

    |

  13. The combination of the gates shown below yields

    Text Solution

    |

  14. The circuit diagram (see fig.) shows a 'logic combination' with the st...

    Text Solution

    |

  15. In the circuit givne, A, B and C are inputs and Y is the output. ...

    Text Solution

    |

  16. Which of the following truth tables corresponds to NAND gate ?

    Text Solution

    |

  17. The output of given logic circuit is

    Text Solution

    |

  18. The output y, when all three inputs are first high and then low, will ...

    Text Solution

    |

  19. The logic gates giving output '1' for the inputs of '1' and '0' are

    Text Solution

    |

  20. The truth table for the following logic circuit is

    Text Solution

    |