Recent questions tagged goclasses-digital-logic-practice-questions

7 7 votes
1 1 answer
204
204 views
For an SR latch using NAND gates, the inputs are active-low. Which option correctly describes the latch behavior?$S=0,R=1$ sets the latch, $S=1,R=0$ resets the latch, $S=...
6 6 votes
1 1 answer
173
173 views
In a NOR-based SR latch, why is the input condition $S=1,R=1$ considered invalid?Because both outputs become $1$ Because both outputs become $0$, so $Q$ and $Q'$ are not ...
7 7 votes
1 1 answer
190
190 views
For an active-high SR latch using NOR gates, which option correctly describes the latch behavior?$S=1,R=0$ sets the latch, $S=0,R=1$ resets the latch, $S=0,R=0$ holds the...
4 4 votes
1 1 answer
191
191 views
In a sequential circuit, the circuit is able to remember previous output mainly because of:Encoder Decoder Feedback or memory element Multiplexer
5 5 votes
1 1 answer
215
215 views
Which statement correctly differentiates a combinational circuit from a sequential circuit?A combinational circuit depends only on current inputs, while a sequential circ...
6 6 votes
1 1 answer
221
221 views
A Boolean operator $\odot$ is defined by the following truth table:\[\begin{array}{|c|c|c|}\hlineA & B & A \odot B \\\hline0 & 0 & 1 \\0 & 1 & 0 \\1 & 0 & 0 \\1 & 1 & 0\\...
8 8 votes
1 1 answer
203
203 views
Which of the following statements is correct about the set {XOR, NOT}?It is functionally complete because it contains NOT It is functionally complete because XOR can prod...
4 4 votes
1 1 answer
188
188 views
Let $A \uparrow B$ denote the NAND operation, where:$A \uparrow B=(AB)'$Which set of expressions correctly proves that NAND alone is functionally complete?$A'=A\uparrow A...
5 5 votes
1 1 answer
197
197 views
For a Boolean function $f(A,B,C)=\Sigma m(1,2,5,7)$, which expression correctly represents the standard SOP form?$f=A'B'C+A'BC'+AB'C+ABC$ $f=A'B'C'+A'BC+AB'C'+ABC'$ $f=A'...
7 7 votes
1 1 answer
207
207 views
A set of Boolean operations is called functionally complete if:It contains only AND and OR gates It can be used to express every Boolean function It contains XOR operatio...
4 4 votes
1 1 answer
188
188 views
In a carry look-ahead adder,$C_{i+1}=G_i+P_iC_i$Which expression correctly represents $C_3$ in terms of $G_0,G_1,G_2,P_0,P_1,P_2$ and $C_0$?$C_3=G_2+P_2G_1+P_2P_1G_0+P_2P...
2 2 votes
1 1 answer
157
157 views
For a carry look-ahead adder, let$G_i=A_iB_i$and$P_i=A_i\oplus B_i$For bit position $i$, what do $G_i=1$ and $P_i=1$ represent?$G_i=1$ means carry is propagated, and $P_i...
3 3 votes
1 1 answer
163
163 views
In a ripple carry adder, which condition causes a carry to propagate through bit position $i$?$A_i=0$ and $B_i=0$ $A_i=1$ and $B_i=1$ $A_i\oplus B_i=1$ $A_iB_i=1$
4 4 votes
1 1 answer
177
177 views
A $4$-bit ripple carry adder is made using full adders. For each full adder, carry propagation delay from $C_{in}$ to $C_{out}$ is $2$ $\text{ns}$, and sum delay from $C_...
5 5 votes
1 1 answer
152
152 views
A circuit has two gates in series. First, $X=AB$ is produced using an AND gate with delay $4$ $\text{ns}$. Then, $F=X+C$ is produced using an OR gate with delay $3$ $\tex...
5 5 votes
2 2 answers
204
204 views
In a full adder, the carry output is $C_{out}=AB+C_{in}(A\oplus B)$. For which input combinations does the full adder generate carry independent of $C_{in}$?$A=0,B=0$ $A=...
3 3 votes
1 1 answer
156
156 views
A $4$-bit ripple carry adder adds $A=1011$ and $B=0111$ with initial carry $C_0=0$. What are the final $4$-bit sum and final carry?Sum $=0010$, $C_4=1$ Sum $=10010$, $C_4...
5 5 votes
1 1 answer
181
181 views
Two unsigned $2$-bit numbers $A_1A_0$ and $B_1B_0$ are added with no input carry. Which implementation and equations are correct?LSB uses half adder: $S_0=A_0\oplus B_0$,...
4 4 votes
1 1 answer
166
166 views
For a full adder with inputs $A$, $B$, and $C_{in}$, for which input combinations are $S=0$ and $C_{out}=1$?$000,111$ $011,101,110$ $001,010,100$ $011,101,111$
4 4 votes
1 1 answer
155
155 views
A full adder is implemented using two half adders and one OR gate. The first half adder takes inputs $A$ and $B$. The second half adder takes the first sum output and $C_...
2 2 votes
1 1 answer
219
219 views
A $4:2$ priority encoder has active-high inputs $\mathrm{D}_0,\mathrm{D}_1,\mathrm{D}_2,\mathrm{D}_3$, where $\mathrm{D}_3$ has the highest priority and $\mathrm{D}_0$ ha...
6 6 votes
2 2 answers
232
232 views
For a $4:2$ binary encoder with active-high inputs $\mathrm{I}_0,\mathrm{I}_1,\mathrm{I}_2,\mathrm{I}_3$ and outputs $\mathrm{Y}_1,\mathrm{Y}_0$, assume exactly one input...
4 4 votes
2 2 answers
216
216 views
A $1:4$ DEMUX has data input $\mathrm{D}$ and select lines $\mathrm{S}_1,\mathrm{S}_0$. Which of the following output equations is correct?$\mathrm{Y}_0=\mathrm{S}_1\math...
6 6 votes
2 2 answers
282
282 views
A $2:1$ MUX has inputs $\mathrm{I}_0,\mathrm{I}_1$, select line $\mathrm{S}$, and active-low enable input $\mathrm{E}$. When $\mathrm{E}=1$, the output is $0$. When $\mat...
3 3 votes
2 2 answers
269
269 views
11 11 votes
2 2 answers
308
308 views
The Boolean function $\mathrm{F}(\mathrm{A},\mathrm{B},\mathrm{C},\mathrm{D})=\Sigma _m(2,3,4,6,9,10,12,13,14,15)$ is to be implemented using a $4:1$ MUX with select line...
6 6 votes
1 1 answer
189
189 views
Two $2:1$ MUXes are connected as follows :The first MUX has select line $\mathrm{A}$, input $\mathrm{I}_0=\mathrm{B}$, input $\mathrm{I}_1=\mathrm{C}$, and output $\mathr...
4 4 votes
1 1 answer
170
170 views
A $4:1$ MUX has select lines $\mathrm{S}_1=\mathrm{R}$ and $\mathrm{S}_0=\mathrm{S}$, where $\mathrm{R}$ is MSB and $\mathrm{S}$ is LSB. The data inputs are $\mathrm{I}_0...
5 5 votes
1 1 answer
200
200 views
The function $\mathrm{F}(\mathrm{A},\mathrm{B})=\mathrm{A}\oplus\mathrm{B}$ is implemented using an $8:1$ MUX. The select lines are connected as $\mathrm{S}_2=0$, $\mathr...
7 7 votes
2 2 answers
218
218 views
The Boolean function $\mathrm{F}(\mathrm{A},\mathrm{B},\mathrm{C})=\Sigma _m(1,2,4,7)$ is to be implemented using a $2:1$ MUX with select line $\mathrm{S}=\mathrm{A}$. Wh...