GATE EC 2014 Set 4 — Question 55

Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.
MCQ+2 / -0.67MediumDFT & FFTDiscrete-Time SignalsSignals & Systems

Signals & Systems → Discrete-Time Signals → DFT & FFT

Last updated

Question

The NN-point DFT XX of a sequence x[n]x[n], 0nN10 \leq n \leq N - 1 is given by X[k]=1Nn=0N1x[n]ej2πNnk,0kN1.X[k] = \frac{1}{\sqrt{N}} \sum_{n=0}^{N-1} x[n]e^{-j \frac{2\pi}{N} nk}, 0 \leq k \leq N - 1.Denote this relation as X=DFT(x)X = DFT(x). For N=4N = 4, which one of the following sequences satisfies DFT(DFT(x))=xDFT(DFT(x)) = x?
Your answer

Choose one option, then check your answer.

The solution stays hidden until you check.

Continue learning with Success Tracker

A step still unclear? Work through it with support

Use Success Tracker to ask about the reasoning, then try another GATE EC question to check your understanding.

AI-powered practice· Unlimited practice on eligible plans
PYQs with solutions
Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
Practice that adapts
Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
AI doubt support
Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.

Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.

This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.

More questions on Discrete-Time Signals