ExamSIDE
Questions (Powered by ExamGOAL)
Signals and Systems
Representation of Continuous Time Signal Fourier Series
Marks 1Marks 2
Fourier Transform
Marks 1Marks 2Marks 5
Continuous Time Signal Laplace Transform
Marks 1Marks 2Marks 5
Discrete Time Signal Fourier Series Fourier Transform
Marks 1Marks 2
Discrete Fourier Transform and Fast Fourier Transform
Marks 1Marks 2
Discrete Time Signal Z Transform
Marks 1Marks 2
Continuous Time Linear Invariant System
Marks 1Marks 2Marks 5
Discrete Time Linear Time Invariant Systems
Marks 1Marks 2Marks 4Marks 5
Transmission of Signal Through Continuous Time LTI Systems
Marks 1Marks 2Marks 5
Sampling
Marks 1Marks 2Marks 4Marks 5
Transmission of Signal Through Discrete Time Lti Systems
Marks 1Marks 2Marks 4
Miscellaneous
Marks 1Marks 2
Previous
1
GATE ECE 2021
MCQ (Single Correct Answer)
+1
-0.33
Consider two 16-point sequences x[n] and h[n]. Let the linear convolution of x[n] and h[n] be denoted by y[n], while z[n] denotes the 16-point inverse discrete Fourier transform (IDFT) of the product of the 16-point DFTs of x[n] and h[n]. The value(s) of k for which z[k] = y[k] is/are
A
k = 0, 1, 2, ....., 15
B
k = 0 and k = 15
C
k = 0
D
k = 15
2
GATE ECE 2010
MCQ (Single Correct Answer)
+1
-0.3
For an N-point FFT algorithm with N = $${2^m}$$ which one of the following statements is TRUE?
A
It is not possible to construct a signal flow graph with both input and output in normal order.
B
The number of butterflies in the $${m^{th}}$$ stage is N/m.
C
In-place computation requires storage of only 2N node data.
D
Computation of a butterfly requires only one complex multiplication.
Previous
Questions Asked from Marks 1
GATE ECE 2023 (1) GATE ECE 2022 (1) GATE ECE 2021 (1) GATE ECE 2010 (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