Skip to content
Early access — you're among the first to try PYQLabs. Share feedback
Concept drill

in-place computation

GATE Electronics & Communication · Sampling & DTFT · 2010-2010

1
PYQs
100%
keyed
0
elite explanations
1
years appeared

Study anchor

Source-book anchor pending for this concept.

Practice action

Start latest PYQ

PYQs in this concept

All concepts →
2010 PYQ

For an N-point FFT algorithm with N = $${2^m}$$ which one of the following statements is TRUE?

mediumanswer key