AllInfoHub Logo

AllInfoHub – MCQ Practice

Digital Signal Processing – Multiple Choice Questions (MCQs)

  1. 25. A system with poles outside the unit circle in the z-plane is:

    • A. Stable
    • B. Unstable
    • C. Marginally stable
    • D. Non-causal
  2. 26. A system with poles exactly on the unit circle in the z-plane (and no multiple poles there) is:

    • A. Stable
    • B. Unstable
    • C. Marginally stable
    • D. Non-causal
  3. 27. The power spectral density (PSD) of a discrete-time random process is the Discrete-Time Fourier Transform (DTFT) of its:

    • A. Autocorrelation function
    • B. Probability density function
    • C. Mean
    • D. Variance
  4. 28. The output of a discrete-time system at any instant depends only on the current and past inputs. Such a system is:

    • A. Non-causal
    • B. Causal
    • C. Unstable
    • D. Memoryless
  5. 29. The Nyquist interval is the time interval between successive samples

    • A. given by:
    • B. 1/fm
    • C. 1/(2fm)
    • D. 2fm
  6. 30. Quantization noise is introduced during the process of:

    • A. Sampling
    • B. Quantization
    • C. Encoding
    • D. Filtering
  7. 31. The number of bits used in quantization directly affects the:

    • A. Sampling rate
    • B. Quantization error
    • C. Bandwidth
    • D. Computational complexity
  8. 32. The Discrete-Time Fourier Series (DTFS) is used to represent:

    • A. Aperiodic discrete-time signals
    • B. Periodic discrete-time signals
    • C. Continuous-time signals
    • D. Random signals
  9. 33. The relationship between DTFT and DFT is that DFT is a ________ version of DTFT.

    • A. Sampled
    • B. Continuous
    • C. Analog
    • D. Inverse
  10. 34. Zero padding in DFT is performed to:

    • A. Increase frequency resolution
    • B. Decrease frequency resolution
    • C. Reduce aliasing
    • D. Improve time domain representation
  11. 35. The circular convolution of two N-point sequences is equivalent to the linear convolution if both sequences are padded with zeros to a length of at least:

    • A. N
    • B. N-1
    • C. 2N-1
    • D. N+1
  12. 36. The overlap-add and overlap-save methods are used for efficient computation of:

    • A. Linear convolution using DFT
    • B. Circular convolution using DFT
    • C. Linear phase FIR filters
    • D. IIR filter design