1
GATE ECE 2018
Numerical
+1
-0.33
A traffic signal cycles from GREEN to YELLOW, YELLOW to RED and RED to GREEN. In each cycle, GREEN is turned on for 70 seconds, YELLOW is turned on for 5 seconds and the RED is turned on for 75 seconds. This traffic light has to be implemented using a finite state machine (FSM). The only input to this FSM is a clock of 5 second period. The minimum number of flip-flops required to implement this FSM is _______.
Your input ____
2
GATE ECE 2018
Numerical
+2
-0.67
In the circuit shown below, a positive edge-triggered D Flip-Flop is used for sampling input data Din using clock CK. The XOR gate outputs 3.3 volts for logic HIGH and 0 volts for logic LOW levels. The data bit and clock periods are equal and the value of $${{\Delta T} \over {{T_{CK}}}}$$ = 0.15, where the parameters $$\Delta T$$ and TCK are shown in the figure. Assume that the Flip-Flop and the XOR gate are ideal. GATE ECE 2018 Digital Circuits - Sequential Circuits Question 6 English

If the probability of input data bit (Din) transition in each clock period is 0.3, the average value (in volts, accurate to two decimal places) of the voltage at node X, is _______.
Your input ____
3
GATE ECE 2018
MCQ (Single Correct Answer)
+2
-0.67
A 2 $$ \times $$ 2 ROM array is built with the help of diodes as shown in the circuit below. Here W0 and W1 are signals that select the word lines and B0 and B1 are signals that are output of the sense amps based on the stored data corresponding to the bit lines during the read operation. GATE ECE 2018 Digital Circuits - Semiconductor Memories Question 1 English
During the read operation, the selected word line goes high and the other word line is in a high impedance state. As per the implementation shown in the circuit diagram above, what are the bits corresponding to Dij (where i = 0 or 1 and j = 0 or 1) stored in the ROM?
A
$$\left[ {\matrix{ 1 & 0 \cr 0 & 1 \cr } } \right]$$
B
$$\left[ {\matrix{ 0 & 1 \cr 1 & 0 \cr } } \right]$$
C
$$\left[ {\matrix{ 1 & 0 \cr 1 & 0 \cr } } \right]$$
D
$$\left[ {\matrix{ 1 & 1 \cr 0 & 0 \cr } } \right]$$
4
GATE ECE 2018
MCQ (Single Correct Answer)
+2
-0.67
A four-variable Boolean function is realized using 4 $$ \times $$ 1 multiplexers as shown in the figure. GATE ECE 2018 Digital Circuits - Combinational Circuits Question 5 English
The minimized expression for F(U, V, W, X) is
A
$$\left( {UV + \overline U \overline V } \right)\overline W $$
B
$$\left( {UV + \overline U \overline V } \right)\left( {\overline W \overline X + \overline W X} \right)$$
C
$$\left( {U\overline V + \overline U V} \right)\overline W $$
D
$$\left( {U\overline V + \overline U V} \right)\left( {\overline W \overline X + \overline W X} \right)$$
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12