MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 6 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 additions are performed in computing the N-point DFT of a sequence using divide-and-conquer method if N=LM? |
| A. | N(L+M+2) |
| B. | N(L+M-2) |
| C. | N(L+M-1) |
| D. | N(L+M+1) |
| Answer» C. N(L+M-1) | |
| 2. |
How many complex multiplications are performed in computing the N-point DFT of a sequence using divide-and-conquer method if N=LM? |
| A. | N(L+M+2) |
| B. | N(L+M-2) |
| C. | N(L+M-1) |
| D. | N(L+M+1) |
| Answer» E. | |
| 3. |
The computation of XR(k) for a complex valued x(n) of N points requires _____________ |
| A. | 2N<sup>2</sup> evaluations of trigonometric functions |
| B. | 4N<sup>2</sup> real multiplications |
| C. | 4N(N-1) real additions |
| D. | All of the mentioned |
| Answer» E. | |
| 4. |
What is the real part of the N point DFT XR(k) of a complex valued sequence x(n)? |
| A. | ( sum_{n=0}^{N-1} [x_R (n) cos u2061 frac{2 kn}{N} x_I (n) sin u2061 frac{2 kn}{N}] ) |
| B. | ( sum_{n=0}^{N-1} [x_R (n) sin u2061 frac{2 kn}{N} + x_I (n) cos u2061 frac{2 kn}{N}] ) |
| C. | ( sum_{n=0}^{N-1} [x_R (n) cos u2061 frac{2 kn}{N} + x_I (n) sin u2061 frac{2 kn}{N}] ) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 5. |
WNk+N/2=? |
| A. | W<sub>N</sub><sup>k</sup> |
| B. | -W<sub>N</sub><sup>k</sup> |
| C. | W<sub>N</sub><sup>-k</sup> |
| D. | None of the mentioned |
| Answer» C. W<sub>N</sub><sup>-k</sup> | |
| 6. |
Which of the following is true regarding the number of computations required to compute DFT at any one value of k ? |
| A. | 4N-2 real multiplications and 4N real additions |
| B. | 4N real multiplications and 4N-4 real additions |
| C. | 4N-2 real multiplications and 4N+2 real additions |
| D. | 4N real multiplications and 4N-2 real additions |
| Answer» E. | |