For the sequence x[n] = {1, -1, 1, -1}, with n = 0, 1, 2, 3, the DFT i – McqOptions

MCQOPTIONS

1.	For the sequence x[n] = {1, -1, 1, -1}, with n = 0, 1, 2, 3, the DFT is computed as \(X\left( k \right) = \mathop \sum \limits_{n = 0}^3 x\left[ n \right]{e^{ - j\frac{{2\pi }}{4}nk}}\), for k = 0, 1, 2, 3. The value of k for which X(k) is not zero is
A.	0
B.	1
C.	2
D.	3
Answer» D. 3

Discussion

No Comment Found

Related MCQs

A certain square wave has a period of 4 msec. Its fundamental frequency will be
Let Y(k) be the 5-point DFT of the sequence y(n) = {1 2 3 4 5}. What is the 5-point DFT of the sequence Y(k)?
Inverse discrete Fourier transform of Y(k) = {1, 0, 1, 0} is
A finite duration discrete-time signal x[n] is obtained by sampling the continuous-time signal x(t) = cos (200πt) at sampling instants t = n/400, n = 0, 1, …, 7. The 8-point discrete Fourier transform (DFT) of x[n] is defined as:\(X\left[ k \right] = \mathop \sum \limits_{n = 0}^7 x\left[ n \right]{e^{ - j\frac{{\pi kn}}{4}}},\;k = 0,\;1,\; \ldots ,\;7.\)Which one of the following statements is TRUE?
In a discrete-time Low pass Filter, the frequency response is
For the sequence x[n] = {1, -1, 1, -1}, with n = 0, 1, 2, 3, the DFT is computed as \(X\left( k \right) = \mathop \sum \limits_{n = 0}^3 x\left[ n \right]{e^{ - j\frac{{2\pi }}{4}nk}}\), for k = 0, 1, 2, 3. The value of k for which X(k) is not zero is