Digital Signal Processing Practice Test 4

1. What is the range in which the quantization errors due to rounding off are uniformly distributed as random variables if Δ=2^-b?

2. Which of the following is true regarding the number of computations required to compute DFT at any one value of 'k'?

3. If the desired number of values of the DFT is less than log₂N, a direct computation of the desired values is more efficient than FFT algorithm.

4. What is the circular convolution of the sequences X₁(n)={2,1,2,1} and x₂(n)={1,2,3,4}?

5. Which of the following refers the number of memory locations required to store the system parameters, past inputs, past outputs and any intermediate computed values?

6. Decimation-in frequency FFT algorithm is used to compute H(k).

7. If the contour on which the z-transform is evaluated is as shown below, then which of the given condition is true?

8. If X(k) is the DFT of x(n) which is defined as x(n)=x₁(n)+jx₂(n), 0≤ n≤ N-1, then what is the DFT of x₁(n)?

9. What is the model that has been adopt for characterizing round of errors in multiplication?

10. If we split the N point data sequence into two N/2 point data sequences f₁(n) and f₂(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.