Digital Electronics
Boolean Algebra
Practice questions from Boolean Algebra.
17
Total0
Attempted0
Correct0
IncorrectA Boolean function is given as
The simplified form of this function is represented by
The is given in POS form
Option (a) is correct.
Simplified form of the Boolean function
Is
By Redundant Literal Rule
&
In the circuit shown below, X and Y are digital inputs, and Z is a digital output. The equivalent circuit is a
Output of first AND gate
Output of second AND gate
In the logic circuit shown in the figure. Y is given by
Digital 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
The Boolean expression simplifies to
If C=0, expression,
C=1, expression,
Hence, it can expressed as,
For a 3-input logic circuit shown below, the output Z can be expressed as
A 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
Bulb (ON) 1
Bulb (OFF) 0
If both switches are operated bulb will remain in previous state
If either switch is operated bulb change its state
Let the switches be S1 S2 and bulb states Y.
Case-1
We can see that this truth table resembles XOR gate
The output Y of the logic circuit given below is
1
0
X
x and both are exclusive
So,
Or
The 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
We know,
The complete set of only those Logic Gates designated as Universal Gates is
The NOR and NAND gates can be used implement any logic function and hence are often referred to as Universal logic gates.
The simplified form of the Boolean expression can be written as
The Boolean expression
can be simplified to
F=
K-map
So possible simplified terms are
F=
Or
F=
Hence only (b) option is correct
For the circuit shown in figure, the Boolean expression for the output Y in terms of inputs P, Q, R and S is
The output of a logic gate is “1” when all its inputs are at logic “0”. The gate is either.
The output of the logic gates NOR and EX-NOR are high when all the inputs are at logic 0.
The Boolean expression for the output of the logic circuit shown in figure is
