Solveeit Logo

Question

Question: If A = 1, B = 0, then in terms of Boolean algebra, \(A + \overline B \) equals to: A) \(A\) B) \...

If A = 1, B = 0, then in terms of Boolean algebra, A+BA + \overline B equals to:
A) AA
B) BB
C) A\overline A
D) A+B\overline {A + B}

Explanation

Solution

From the given equation, it can be seen that two gates have been used in the Boolean equation: NOT gate and OR gate. The most appropriate way to solve such a question is to make a truth table for the given equation. Also note that since particular values of AA and BB are given, there is no need to make the entire truth table. Just the one corresponding to these particular values.

Complete step by step solution:
Before we solve the Boolean equation, we should make ourselves familiar with the two gates present in the equation: NOT and OR gate.
1. NOT gate
NOT gate is a gate that inverts the input and returns the value as output. Therefore, if the input is high, output is low and when input is low, output is high.
The logic equation of NOT gate is as follows:
Y=AY = \overline A
Where, YY is the output and AA is the input.
Truth table of NOT Gate IS:

INPUT (A)OUTPUT (Y)
10
01

2. OR gate
OR gate is a gate that gives positive output (high) when both the outputs are positive (high) or either of the outputs are positive (high). When both inputs are negative, then only it gives a negative (low) output.
The logic equation of OR gate is as follows:
Y=A+BY = A + B
Where, YY is the output and AA and BB are the input.
Truth table of OR gate IS:

INPUT 1 ( AA )INPUT 2 ( BB )OUTPUT ( Y=A+BY = A + B )
000000
001111
110011
111111

The Boolean equation is Y=A+BY = A + \overline B . Therefore, the truth table will be

INPUT 1 ( AA )INPUT 2 ( BB )B\overline B Y=A+BY = A + \overline B
11001111

In the given options;
A) A=1A = 1
B) B=0B = 0
C) A=0\overline A = 0
D) A+B=1+0=1=0\overline {A + B} = \overline {1 + 0} = \overline 1 = 0

Therefore, the correct option is (A), A=1A = 1.

Note: In these types of questions, it is easier to draw the table to avoid any silly mistakes. Boolean algebra can be quite simple if done in a concise and schematic manner.