Loading, please wait...

ExamDost
Learning Portal
Let's Prepare Together!
#PreparationAmplified!
Explore Packages
ExamDost
Learning Portal
 Prep plan My packages

Practice over 1000+ GATE-level questions from this topic!

Designed to match the latest GATE pattern with topic-wise precision, difficulty tagging, and detailed solutions.

Q#1 Fourier Transform GATE EC 2011 MCQ +1 mark -0.33 marks

For an N-point FFT algorithm with  which one of the following statements is TRUE?

It is not possible to construct a signal flow graph with both input and output in normal order

The number of butterflies in the  stage is N/m

In-place computation requires storage of only 2N node data

Computation of a butterfly requires only one complex multiplication

Sign in to see the solution

Log in to view the explanation, track your attempts, and keep your progress.

Sign in to Unlock
Browse Practice Questions by Chapters / Topics in Browse Practice Questions by Chapters / Topics in GATE Electronics and Communications
Total Questions

Attempted

% Attempted

Correct

% Correct

Topic Questions Attempted Correct
Network Analysis 273 0 0
Electronic Devices 224 0 0
Analog Electronics 395 0 0
Digital Electronics 352 0 0
Signals and Systems 263 0 0
Control Systems 264 0 0
Communication System 340 0 0
EMFT - ECE 273 0 0
Engineering Mathematics 280 0 0
General Aptitude 240 0 0
Generate Personalized GATE Electronics and Communications Paper