Digital Electronics
Boolean Algebra
Practice questions from Boolean Algebra.
20
Total0
Attempted0
Correct0
IncorrectThe digital circuit shown has 3 inputs , and ).
The simplified logical expression for the output (OUT) is:
0
1
Sign in to see the solution
Log in to view the explanation, track your attempts, and keep your progress.
Sign in to UnlockA Boolean function is given as
The simplified form of this function is represented by
Sign in to see the solution
Log in to view the explanation, track your attempts, and keep your progress.
Sign in to UnlockSimplified form of the Boolean function
Is
Sign in to see the solution
Log in to view the explanation, track your attempts, and keep your progress.
Sign in to UnlockIn the circuit shown below, X and Y are digital inputs, and Z is a digital output. The equivalent circuit is a
Sign in to see the solution
Log in to view the explanation, track your attempts, and keep your progress.
Sign in to UnlockIn the logic circuit shown in the figure. Y is given by
Sign in to see the solution
Log in to view the explanation, track your attempts, and keep your progress.
Sign in to UnlockDigital input signals A, B, C with A as the MSB and C as the LSB are used to realize the Boolean function
, Where to denote the minterm. In addition, F has a don't care for. The simplified expression for F is given by
Sign in to see the solution
Log in to view the explanation, track your attempts, and keep your progress.
Sign in to UnlockThe Boolean expression simplifies to
Sign in to see the solution
Log in to view the explanation, track your attempts, and keep your progress.
Sign in to UnlockFor a 3-input logic circuit shown below, the output Z can be expressed as
Sign in to see the solution
Log in to view the explanation, track your attempts, and keep your progress.
Sign in to UnlockThe Boolean expression simplifies to
1
a, b
0
Sign in to see the solution
Log in to view the explanation, track your attempts, and keep your progress.
Sign in to UnlockA bulb in a staircase has two switches, one switch being at the ground floor and the other one at the first floor. The bulb can be turned ON and also can be turned OFF by any one of the switches irrespective of the state of the other switch. The logic of switching of the bulb resembles
Sign in to see the solution
Log in to view the explanation, track your attempts, and keep your progress.
Sign in to UnlockThe output Y of the logic circuit given below is
1
0
X
Sign in to see the solution
Log in to view the explanation, track your attempts, and keep your progress.
Sign in to UnlockThe TTL circuit shown in the figure is fed with the waveform X (also shown). All gates have equal propagation delay of 10ns. The output Y of the circuit is
Sign in to see the solution
Log in to view the explanation, track your attempts, and keep your progress.
Sign in to UnlockThe complete set of only those Logic Gates designated as Universal Gates is
Sign in to see the solution
Log in to view the explanation, track your attempts, and keep your progress.
Sign in to UnlockThe simplified form of the Boolean expression can be written as
Sign in to see the solution
Log in to view the explanation, track your attempts, and keep your progress.
Sign in to UnlockThe Boolean expression
can be simplified to
Sign in to see the solution
Log in to view the explanation, track your attempts, and keep your progress.
Sign in to UnlockFor the circuit shown in figure, the Boolean expression for the output Y in terms of inputs P, Q, R and S is
Sign in to see the solution
Log in to view the explanation, track your attempts, and keep your progress.
Sign in to UnlockThe output of a logic gate is “1” when all its inputs are at logic “0”. The gate is either.
Sign in to see the solution
Log in to view the explanation, track your attempts, and keep your progress.
Sign in to UnlockThe logic function is the same as
None of (a), (b) (c)
Sign in to see the solution
Log in to view the explanation, track your attempts, and keep your progress.
Sign in to UnlockThe Boolean expression for the output of the logic circuit shown in figure is
Sign in to see the solution
Log in to view the explanation, track your attempts, and keep your progress.
Sign in to UnlockThe min-terms of a four variable Boolean function Y is given by
Use Karnaugh map to minimize the function Y. Realize function Y employing only three-input NAND gates.
Sign in to see the solution
Log in to view the explanation, track your attempts, and keep your progress.
Sign in to Unlock