Вы находитесь на странице: 1из 3

DIGITAL SIGNAL PROCESS

Objective Questions

1. Application of Convolution:
a) FIR Filtering b) Addition c) Manipulation d) None of these
2. Condition for aliasing problem:
a) fs<fm b) fs<2fm c)fs=fm d) all of these
3. DFT stands as:
a.Discrete Fourier transform b.digital function transform
c.digital frequency transform d.none
4. FFT stands as:
a. Fast Fourier transform
b. Fourier function transform
c. Fast frequency transform
d. none
6. Calculate DFT of x (n) = {1, 0, 1, 0}.
a.x (k) = {2, 0, 2, 0} b.x (k) = {1, 0, 1, 0}
c.x (k) = {2, 0, 1, 0} d.none
7. Calculate DFT of x (n)= (n) .
a.1 b.0 c. Wn d. none
8. Calculate DFT of x (n)= (n n0)where 0<n0<N.
a. e jwn 0 b. e Nj2 c.1 d. none
9. The FFT algorithms:
a. eliminate the redundant calculation and enable to analyze the spectral properties of a signal.

b. enable the redundant calculation and redundant to analyze the spectral properties of a signal.

c. a & b d. none
10. The relation between DFT and Fourier series coefficients of a periodic sequence is
a.X(K) = Ck/N b.X(K)= Ck c.X(K) = NCk d.X(K)=1/Ck
11. Find the response of an FIR filter with impulse response h(n)= {1,2,4} to the input sequence x(n)={1,2}.
a. y(n)={1,4,8,8} b. y(n)={1,4,6,6}
c. y(n)={1,2,8,8} d.none of above
12. FIR filters are ….. generally as sensitive to coefficient round off.
a. not b. less c. most d. none of above
13. FIR filters often require more computation, because you must do ………… for each term in the impulse
response.
a. multiply-add b. add c. multiply d.all of above
14. FIR filters can be ………. delay, IIR filters can………….
a. constant, not b. not, constant c. not, not d. none of above
15. IIR filters
a)Use feedback
b)Are sometimes called recursive filters
c)Can oscillate if not properly designed
d)all of the above
16. The inverse Fourier transform
a)converts from the frequency domain to the time domain
b)converts from the time domain to the frequency domain
c)converts from the phasor domain to the magnitude domain
d)is used to make real-time spectrum analyzers
17. This is the impulse response for
a)an IIR high pass filter b)an FIR band pass filter
c)an IIR low pass filter d)an FIR low pass filter
18. Coefficient symmetry is important in FIR filters because it provides
a)a smaller transition bandwidth b)less passband ripple
c)less stopband ripple d)a linear phase response
19. How to define IIR filters term as infinite:
a. As with any feedback device, create a loop, hence the term infinite.
b. As with any non-feedback device, create a loop, hence the term infinite.
c. As with any feedback device, create a open loop, hence the term infinite.
d. None of above
20. The filter coefficients are stored in:
a. binary registers b. digital system c. binary memory d. none
21. What is scaling?
a. Scaling must be done in such a way that no overflow occurs at the summing point.
b. Scaling must be done in such a way that overflow occurs at the summing point.
c. Scaling must be done in such a way that no underflow occurs at the summing point.
d.none of above
22. Application of Convolution:
a) FIR Filtering b) Addition c) Manipulation d) None of these
23. Condition for aliasing problem:
a) fs<fm b) fs<2fm c)fs=fm d) all of these
24. Drawbacks of DSP is
a. Digital processing needs pre and post processing devices b. high cost
c. No memory storage d. none of above
25. Correlation
a. It gives a measure of similarity between two data sequences
b. It gives a measure of dis-similarity between two data sequences
c. a & b
d. none of above
26. DFT stands as:
a. Discrete Fourier transform b. digital function transform
c. digital frequency transform d. none
27. FFT stands as:
a. Fast Fourier transform
b. Fourier function transform
c. Fast frequency transform
d. none
28. Calculate DFT of x (n) = {1, 0, 1, 0}.
a. x(k) = {2, 0, 2, 0} b. x(k) = {1, 0, 1, 0}
c. x(k) = {2, 0, 1, 0} d. none
29. Calculate DFT of x (n) = (n).
a.1 b.0 c. Wn d. none
30. The letter B below indicates the filter
a) Stop band b) Pass band c) Transition band d) ripple
31. IIR filters
a) Use feedback
b) Are sometimes called recursive filters
c) Can oscillate if not properly designed
d) all of the above
32. Drawbacks of DSP is
a. Digital processing needs pre and post processing devices b. high cost
c. No memory storage d. none of above
33. The discrete time function defined as u(n)=n for n≥0;
=0 for n<0 is an
a).unit step b).unit sample c).unit ramp d)none
34. If x(n) is a discrete-time signal, then the value of x(n) at non integer value of ‘n’
a)0 b)1 c)-1 d)none
35. Z-transform of unit step sequence is___________
a)z/z-a b)z/z+a 1/z-a d)1/z+a
36. Number of ways to represent discrete time signals
a)4 b)3 c)2 d)1
37. Calculate DFT of x (n)= n where 0<n<4.
38. Fast convolution techniques are
a)overlap save b)overlap add c)both d)none
39. Relation between DFT and Fourier transform is________________________
40. The FFT algorithms are
a)DIT FFT b)DIF FFT c)both d)None
41. A causal and stable IIR filter cannot have linear phase (True/False)_______

42. Methods of realization of IIR filters are________________________

Вам также может понравиться