DFT practice question

1. What is DFT explain with example?
2. Is DFT faster than FFT?

What is DFT explain with example?

the DFT spectrum is periodic with period N (which is expected, since the DTFT spectrum is periodic as well, but with period 2π). Example: DFT of a rectangular pulse: x(n) = 1, 0 ≤ n ≤ (N − 1), 0, otherwise.

Is DFT faster than FFT?

Graphical explanation for the speed of the Fast Fourier Transform. For a sample set of 1024 values, the FFT is 102.4 times faster than the discrete Fourier transform (DFT). The basis for this remarkable speed advantage is the `bit-reversal' scheme of the Cooley-Tukey algorithm.