Digital Circuits
1
GATE ECE 2017 Set 2
Numerical
+2
-0
Figure I shows a 4-bits ripple carry adder realized using full adders and Figure II shows the circuit of a full-adder (FA). The
propagation delay of the XOR, AND and OR gates in Figure II are 20 ns, 15 ns and 10 ns respectively. Assume all the inputs to
the 4-bit adder are initially reset to 0.
At t=0, the inputs to the 4-bit adder are changed to $${X_3}$$$${X_2}$$$${X_1}$$$${X_0}$$ =1100, $${Y_3}$$$${Y_2}$$$${Y_1}$$$${Y_0}$$ = 0100 and $${Z_0}$$=1.
The output of the ripple carry adder will be stable at t (in ns) = ____


Your input ____
2
GATE ECE 2017 Set 2
MCQ (Single Correct Answer)
+2
-0.6
A programmable logic array (PLA) is shown in the figure.
The Boolean function F implemented is

3
GATE ECE 2016 Set 1
MCQ (Single Correct Answer)
+2
-0.6
The functionality implemented by the circuit below is


4
GATE ECE 2016 Set 1
MCQ (Single Correct Answer)
+2
-0.6
Identify the circuit below.

Questions Asked from Marks 2
GATE ECE 2024 (2) GATE ECE 2018 (1) GATE ECE 2017 Set 2 (2) GATE ECE 2016 Set 1 (2) GATE ECE 2016 Set 3 (1) GATE ECE 2015 Set 2 (1) GATE ECE 2014 Set 4 (2) GATE ECE 2014 Set 3 (2) GATE ECE 2010 (1) GATE ECE 2009 (1) GATE ECE 2008 (1) GATE ECE 2007 (1) GATE ECE 2004 (1) GATE ECE 2003 (2) GATE ECE 2001 (1) GATE ECE 1999 (1)
GATE ECE Subjects
Signals and Systems
Network Theory
Control Systems
Digital Circuits
General Aptitude
Electronic Devices and VLSI
Analog Circuits
Engineering Mathematics
Microprocessors
Communications
Electromagnetics