If A=1, B=0, then in terms of Boolean al...

If A=1, B=0, then in terms of Boolean algebra A+`barB` equals

A

A

B

B

C

`barA`

D

`bar(A+B)`

Text Solution

Verified by Experts

The correct Answer is:

A

Promotional Banner

Promotional Banner

Topper's Solved these Questions

SEMICONDUCTOR DEVICES
AAKASH SERIES|Exercise EXERCISE -I (MATCHING TYPE QUESTIONS)|1 Videos
SEMICONDUCTOR DEVICES
AAKASH SERIES|Exercise EXERCISE -I (MORE THAN ONE OPTION TYPE QUESTIONS)|23 Videos
SEMICONDUCTOR DEVICES
AAKASH SERIES|Exercise EXERCISE -I (TRANSISTORS)|24 Videos
RAY OPTICS
AAKASH SERIES|Exercise PROBLEMS ( LEVEL-II)|50 Videos
UNITS AND MEASUREMENT
AAKASH SERIES|Exercise PRACTICE EXERCISE|45 Videos

AAKASH SERIES-SEMICONDUCTOR DEVICES-EXERCISE -I (LOGIC GATES)

The logic gate is an electric circuit which
Text Solution
|
The output of two input OR gate is 1
Text Solution
|
The output of a two input AND gate is one, only when its
Text Solution
|
An OR gate
Text Solution
|
An AND gate
Text Solution
|
NAND and NOR gates are called universal gates primarily, because they
Text Solution
|
Digital circuits can be made by repetitive use of
Text Solution
|
The minimum number of NAND gates are used to form AND gate is
Text Solution
|
Two inputs of NAND gate are shortened. This gate is equivalent to
Text Solution
|
An AND gate can be prepared by repetitive use of
Text Solution
|
The value of A+barA in the Boolean algebra is
Text Solution
|
The value of A.barA in Boolean algebra is -
Text Solution
|
If A=1, B=0, then in terms of Boolean algebra A+barB equals
Text Solution
|
In the Boolean expression bar(A).bar(B) is equal to
Text Solution
|
Two NOT gates are connected at the two inputs of a NAND gate. This com...
Text Solution
|
An AND gate can be prepared by repetitive use of a) NOT gate b) OR...
Text Solution
|
Let X= A bar(BC) + B bar(CA)+C bar(AB). Evaluate X for a) A = 1, B = 0...
Text Solution
|