MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 12 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_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. | |
| 2. |
Which is the correct order of the following steps to be done in one of the algorithm of divide and conquer method?$ |
| A. | Store the signal column wise |
| B. | Compute the M-point DFT of each row |
| C. | Multiply the resulting array by the phase factors WNlq. |
| D. | Compute the L-point DFT of each column. |
| Answer» D. Compute the L-point DFT of each column. | |
| 3. |
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) | |
| 4. |
If we store the signal row wise and compute the L point DFT at each column, the resulting array must be multiplied by which of the following factors? |
| A. | W<sub>N</sub><sup>lq</sup> |
| B. | W<sub>N</sub><sup>pq</sup> |
| C. | W<sub>N</sub><sup>lq</sup> |
| D. | W<sub>N</sub><sup>pm</sup> |
| Answer» E. | |
| 5. |
If we store the signal row wise then the result must be read column wise. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 6. |
If N=LM, then what is the value of WNmqL? |
| A. | W<sub>M</sub><sup>mq</sup> |
| B. | W<sub>L</sub><sup>mq</sup> |
| C. | W<sub>N</sub><sup>mq</sup> |
| D. | None of the mentioned |
| Answer» B. W<sub>L</sub><sup>mq</sup> | |
| 7. |
If the arrangement is of the form in which the first row consists of the first M elements of x(n), the second row consists of the next M elements of x(n), and so on, then which of the following mapping represents the above arrangement? |
| A. | n=l+mL |
| B. | n=Ml+m |
| C. | n=ML+l |
| D. | none of the mentioned |
| Answer» C. n=ML+l | |
| 8. |
Divide-and-conquer approach is based on the decomposition of an N-point DFT into successively smaller DFTs. This basic approach leads to FFT algorithms. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 9. |
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. | |
| 10. |
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> | |
| 11. |
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. | |
| 12. |
Which of the following is true regarding the number of computations required to compute an N-point DFT? |
| A. | N<sup>2</sup> complex multiplications and N(N-1) complex additions |
| B. | N<sup>2</sup> complex additions and N(N-1) complex multiplications |
| C. | N<sup>2</sup> complex multiplications and N(N+1) complex additions |
| D. | N<sup>2</sup> complex additions and N(N+1) complex multiplications |
| Answer» B. N<sup>2</sup> complex additions and N(N-1) complex multiplications | |