MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 10 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. | log<sub>2</sub>M |
| B. | Mlog<sub>2</sub>M |
| C. | (M-1)log<sub>2</sub>M |
| D. | Mlog<sub>2</sub>(M-1) |
| Answer» C. (M-1)log<sub>2</sub>M | |
| 2. |
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 | |
| 3. |
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<sup>-j2 kn/N</sup> |
| B. | re<sup>j kn/N</sup> |
| C. | re<sup>j2 kn</sup> |
| D. | re<sup>j2 kn/N</sup> |
| Answer» E. | |
| 4. |
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 | |
| 5. |
What is the expression to compute yk(n) recursively? |
| A. | y<sub>k</sub>(n)=W<sub>N</sub><sup>-ky</sup><sub>k</sub>(n+1)+x(n) |
| B. | y<sub>k</sub>(n)=W<sub>N</sub><sup>-ky</sup><sub>k</sub>(n-1)+x(n) |
| C. | y<sub>k</sub>(n)=W<sub>N</sub>ky<sub>k</sub>(n+1)+x(n) |
| D. | None of the mentioned |
| Answer» C. y<sub>k</sub>(n)=W<sub>N</sub>ky<sub>k</sub>(n+1)+x(n) | |
| 6. |
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}} ) | |
| 7. |
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) | |
| 8. |
According to Goertzel Algorithm, if the computation of DFT is expressed as a linear filtering operation, then which of the following is true? |
| A. | y<sub>k</sub>(n)= ( sum_{m=0}^N x(m)W_N^{-k(n-m)} ) |
| B. | y<sub>k</sub>(n)= ( sum_{m=0}^{N+1} x(m)W_N^{-k(n-m)} ) |
| C. | y<sub>k</sub>(n)= ( sum_{m=0}^{N-1} x(m)W_N^{-k(n+m)} ) |
| D. | y<sub>k</sub>(n)= ( sum_{m=0}^{N-1} x(m)W_N^{-k(n-m)} ) |
| Answer» E. | |
| 9. |
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 | |
| 10. |
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 | |