

MCQOPTIONS
Saved Bookmarks
This section includes 11 Mcqs, each offering curated multiple-choice questions to sharpen your Digital Signal Processing knowledge and support exam preparation. Choose a topic below to get started.
1. |
How many complex multiplications are need to be performed to calculate chirp z-transform?(M=N+L-1) |
A. | log2M |
B. | Mlog2M |
C. | (M-1)log2M |
D. | Mlog2(M-1) |
Answer» C. (M-1)log2M | |
2. |
If the contour on which the z-transform is evaluated is as shown below, then which of the given condition is true? |
A. | R0>1 |
B. | R0<1 |
C. | R0=1 |
D. | None of the mentioned |
Answer» B. R0<1 | |
3. |
How many multiplications are required to calculate X(k) by chirp-z transform if x(n) is of length N? |
A. | N-1 |
B. | N |
C. | N+1 |
D. | None of the mentioned |
Answer» D. None of the mentioned | |
4. |
If the contour is a circle of radius r and the zk are N equally spaced points, then what is the value of zk? |
A. | re-j2πkn/N |
B. | rejπkn/N |
C. | rej2πkn |
D. | rej2πkn/N |
Answer» E. | |
5. |
What is the equation to compute the values of the z-transform of x(n) at a set of points {zk}? |
A. | \(\sum_{n=0}^{N-1} x(n) z_k ^n\), k=0,1,2…L-1 |
B. | \(\sum_{n=0}^{N-1} x(n) z_{-k}^{-n}\), k=0,1,2…L-1 |
C. | \(\sum_{n=0}^{N-1} x(n) z_k^{-n}\), k=0,1,2…L-1 |
D. | None of the mentioned |
Answer» D. None of the mentioned | |
6. |
What is the expression to compute yk(n) recursively? |
A. | yk(n)=WN-kyk(n+1)+x(n) |
B. | yk(n)=WN-kyk(n-1)+x(n) |
C. | yk(n)=WNkyk(n+1)+x(n) |
D. | None of the mentioned |
Answer» C. yk(n)=WNkyk(n+1)+x(n) | |
7. |
What is the system function of the filter with impulse response hk(n)? |
A. | \(\frac{1}{1-W_N^{-k} z^{-1}}\) |
B. | \(\frac{1}{1+W_N^{-k} z^{-1}}\) |
C. | \(\frac{1}{1-W_N^k z^{-1}}\) |
D. | \(\frac{1}{1+W_N^k z^{-1}}\) |
Answer» B. \(\frac{1}{1+W_N^{-k} z^{-1}}\) | |
8. |
If yk(n) is the convolution of the finite duration input sequence x(n) of length N, then what is the impulse response of the filter? |
A. | WN-kn |
B. | WN-kn u(n) |
C. | WNkn u(n) |
D. | None of the mentioned |
Answer» C. WNkn u(n) | |
9. |
According to Goertzel Algorithm, if the computation of DFT is expressed as a linear filtering operation, then which of the following is true? |
A. | yk(n)=\(\sum_{m=0}^N x(m)W_N^{-k(n-m)}\) |
B. | yk(n)=\(\sum_{m=0}^{N+1} x(m)W_N^{-k(n-m)}\) |
C. | yk(n)=\(\sum_{m=0}^{N-1} x(m)W_N^{-k(n+m)}\) |
D. | yk(n)=\(\sum_{m=0}^{N-1} x(m)W_N^{-k(n-m)}\) |
Answer» E. | |
10. |
What is the transform that is suitable for evaluating the z-transform of a set of data on a variety of contours in the z-plane? |
A. | Goertzel Algorithm |
B. | Fast Fourier transform |
C. | Chirp-z transform |
D. | None of the mentioned |
Answer» D. None of the mentioned | |
11. |
If the desired number of values of the DFT is less than log2N, a direct computation of the desired values is more efficient than FFT algorithm. |
A. | True |
B. | False |
Answer» B. False | |