MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 13 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. |
By means of the DFT and IDFT, determine the response of the FIR filter with impulse response h(n)={1,2,3} to the input sequence x(n)={1,2,2,1}? |
| A. | {1,4,11,9,8,3} |
| B. | {1,4,9,11,8,3} |
| C. | {1,4,9,11,3,8} |
| D. | {1,4,9,3,8,11} |
| Answer» C. {1,4,9,11,3,8} | |
| 2. |
What is the variance of the output DFT coefficients |X(k)|? |
| A. | 1/N |
| B. | 1/2N |
| C. | 1/3N |
| D. | 1/4N |
| Answer» D. 1/4N | |
| 3. |
If x1(n) and x2(n) are two real valued sequences of length N, and let x(n) be a complex valued sequence defined as x(n)=x1(n)+jx2(n), 0≤ n≤ N-1, then what is the value of x2(n)? |
| A. | (x(n)-x*(n))/2 |
| B. | (x(n)+x*(n))/2 |
| C. | (x(n)+x*(n))/2j |
| D. | (x(n)-x*(n))/2j |
| Answer» E. | |
| 4. |
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. | |
| 5. |
If we split the N point data sequence into two N/2 point data sequences f1(n) and f2(n) corresponding to the even numbered and odd numbered samples of x(n) and F1(k) and F2(k) are the N/2 point DFTs of f1(k) and f2(k) respectively, then what is the N/2 point DFT X(k) of x(n)? |
| A. | F1(k)+F2(k) |
| B. | F1(k)- WNk F2(k) |
| C. | F1(k)+WNkNk F2(k) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 6. |
WNk+N/2= |
| A. | WNk |
| B. | -WNk |
| C. | WN-k |
| D. | None of the mentioned |
| Answer» C. WN-k | |
| 7. |
What is the range in which the quantization errors due to rounding off are uniformly distributed as random variables if Δ=2-b? |
| A. | (0,Δ) |
| B. | (-Δ,0) |
| C. | (-Δ/2,Δ/2) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 8. |
Every fourfold increase in the size N of the DFT requires an additional bit in computational precision to offset the additional quantization errors. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 9. |
What is the signal-to-noise ratio? |
| A. | σX2. σq2 |
| B. | σX2/ σq2 |
| C. | σX2+ σq2 |
| D. | σX2-σq2 |
| Answer» C. σX2+ σq2 | |
| 10. |
If we split the N point data sequence into two N/2 point data sequences f1(n) and f2(n) corresponding to the even numbered and odd numbered samples of x(n), then such an FFT algorithm is known as decimation-in-time algorithm. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 11. |
What is the value of x(n)*h(n), 0≤n≤11 for the sequences x(n)={1,2,0,-3,4,2,-1,1,-2,3,2,1,-3} and h(n)={1,1,1} if we perform using overlap add fast convolution technique? |
| A. | {1,3,3,1,1,3,5,2,2,2,3,6} |
| B. | {1,2,0,-3,4,2,-1,1,-2,3,2,1,-3} |
| C. | {1,2,0,3,4,2,1,1,2,3,2,1,3} |
| D. | {1,3,3,-1,1,3,5,2,-2,2,3,6} |
| Answer» E. | |
| 12. |
The total number of complex additions required to compute N point DFT by radix-2 FFT is: |
| A. | (N/2)log2N |
| B. | Nlog2N |
| C. | (N/2)logN |
| D. | None of the mentioned |
| Answer» C. (N/2)logN | |
| 13. |
What is the value of x(n)*h(n), 0≤n≤11 for the sequences x(n)={1,2,0,-3,4,2,-1,1,-2,3,2,1,-3} and h(n)={1,1,1} if we perform using overlap save fast convolution technique? |
| A. | {1,3,3,-1,1,3,5,2,-2,2,3,6} |
| B. | {1,2,0,-3,4,2,-1,1,-2,3,2,1,-3} |
| C. | {1,2,0,3,4,2,1,1,2,3,2,1,3} |
| D. | {1,3,3,1,1,3,5,2,2,2,3,6} |
| Answer» B. {1,2,0,-3,4,2,-1,1,-2,3,2,1,-3} | |