DSP 1 ACTUAL TEST PAPER 2026
QUESTIONS WITH SOLUTIONS GRADED A+
⩥ b. 2, -1, 1; h(0) = 2. Answer: QN=2 y(n) = 2x(n) - x(n-1) + x(n-2).
The impulse response h(n) contains the sequence:
a. infinite values
b. 2, -1, 1; h(0) = 2
c. 1, -1, 2; h(0) = 1
d. 2, -1, 1; h(0) = -1
⩥ b. folding and left shift operations.. Answer: QN=3 The graphical
representation of signal x(-n-3) is from the one of signal x(n) by:
a. folding and right shift operations.
b. folding and left shift operations.
c. folding operation.
d. right shift operation.
⩥ b. 0.5, 1.0, 1.5, 2.0, 2.0, 2.0, and so on.. Answer: QN=4 Suppose a
low-pass moving-average filter uses the coefficients 0.25, 0.25, 0.25,
and 0.25. What will the output sequence be with an input signal at a
constant value of 2 ?
a. 0.1, 0.1, 0.1, 0.1, 0.1, 0.1, and so on.
b. 0.5, 1.0, 1.5, 2.0, 2.0, 2.0, and so on.
,c. 1.0, 2.0, 3.0, 4.0, 4.0, 4.0, and so on.
d. None of the others.
⩥ d. 160. Answer: QN=5 When two cosin waves of frequencies 30 and
50 Hz are multiplied together, the Nyquist rate for resulting signal is (in
Hertz):
a. 30
b. 50
c. 80
d. 160
⩥ b. linear.. Answer: QN=6 The following system y[n] = nx[n] is:
a. nonlinear.
b. linear.
⩥ c. X*(-w).. Answer: QN=7 If FT{x(n)} = X(w), then FT{x*(n)} =
______.
a. X(w).
b. X(-w).
c. X*(-w).
d. X*(1/w).
⩥ a. X*(-w).. Answer: QN=8 FT{x*(n)} = _______.
,a. X*(-w).
b. -X*(-w).
c. X*(w).
d. 0
⩥ a. will show a single peak at 100Hz.. Answer: QN=9 A signal consists
a pure tone of frequency 100 Hz. It is sampled at f(sampling)= 1024 Hz
for 0.5s. The FFT of the sampled signal using a rectangular
window_______________________.
a. will show a single peak at 100Hz.
b. will exhibit spectral leakage.
c. will be twice as fast as a DFT on the same number of samples.
⩥ c. an efficient algorithm for calculating the DFT when N is a power of
2.. Answer: QN=10 FFT is
a. an acronym for fast frequency transform.
b. a transform for determining the frequency content of continuous-time
aperiodic signals.
c. an efficient algorithm for calculating the DFT when N is a power of 2.
d. an algorithm for calculating the length of the diagonal of a right-
angled triangle.
⩥ a. causal. Answer: QN=11 The following system y[n] = x[n] - x[n-1]
is:
, a. causal
b. non causal
⩥ d. All of the others.. Answer: QN=12 Digital signal processing of an
analog signal may be preferable to processing the signal directly in the
analog domain because:
a. Digital programmable system allows flexibility in reconfiguration the
digital signal processing operations simply by changing the program.
b. A digital system provides much better control of accuracy
requirements.
c. The digital signal processing method also allows for the
implementation of more sophisticated signal processing algorithms.
d. All of the others.
⩥ a. choose the number of samples as a power of 2, and use an FFT
algorithm.. Answer: QN=13 The fastest way to compute the frequency
content of a signal is to
a. choose the number of samples as a power of 2, and use an FFT
algorithm.
b. choose any reasonable number of samples and use a generic DFT
algorithm.
c. perform the calculations using pencil and paper.
d. look up the ANS in a book.
QUESTIONS WITH SOLUTIONS GRADED A+
⩥ b. 2, -1, 1; h(0) = 2. Answer: QN=2 y(n) = 2x(n) - x(n-1) + x(n-2).
The impulse response h(n) contains the sequence:
a. infinite values
b. 2, -1, 1; h(0) = 2
c. 1, -1, 2; h(0) = 1
d. 2, -1, 1; h(0) = -1
⩥ b. folding and left shift operations.. Answer: QN=3 The graphical
representation of signal x(-n-3) is from the one of signal x(n) by:
a. folding and right shift operations.
b. folding and left shift operations.
c. folding operation.
d. right shift operation.
⩥ b. 0.5, 1.0, 1.5, 2.0, 2.0, 2.0, and so on.. Answer: QN=4 Suppose a
low-pass moving-average filter uses the coefficients 0.25, 0.25, 0.25,
and 0.25. What will the output sequence be with an input signal at a
constant value of 2 ?
a. 0.1, 0.1, 0.1, 0.1, 0.1, 0.1, and so on.
b. 0.5, 1.0, 1.5, 2.0, 2.0, 2.0, and so on.
,c. 1.0, 2.0, 3.0, 4.0, 4.0, 4.0, and so on.
d. None of the others.
⩥ d. 160. Answer: QN=5 When two cosin waves of frequencies 30 and
50 Hz are multiplied together, the Nyquist rate for resulting signal is (in
Hertz):
a. 30
b. 50
c. 80
d. 160
⩥ b. linear.. Answer: QN=6 The following system y[n] = nx[n] is:
a. nonlinear.
b. linear.
⩥ c. X*(-w).. Answer: QN=7 If FT{x(n)} = X(w), then FT{x*(n)} =
______.
a. X(w).
b. X(-w).
c. X*(-w).
d. X*(1/w).
⩥ a. X*(-w).. Answer: QN=8 FT{x*(n)} = _______.
,a. X*(-w).
b. -X*(-w).
c. X*(w).
d. 0
⩥ a. will show a single peak at 100Hz.. Answer: QN=9 A signal consists
a pure tone of frequency 100 Hz. It is sampled at f(sampling)= 1024 Hz
for 0.5s. The FFT of the sampled signal using a rectangular
window_______________________.
a. will show a single peak at 100Hz.
b. will exhibit spectral leakage.
c. will be twice as fast as a DFT on the same number of samples.
⩥ c. an efficient algorithm for calculating the DFT when N is a power of
2.. Answer: QN=10 FFT is
a. an acronym for fast frequency transform.
b. a transform for determining the frequency content of continuous-time
aperiodic signals.
c. an efficient algorithm for calculating the DFT when N is a power of 2.
d. an algorithm for calculating the length of the diagonal of a right-
angled triangle.
⩥ a. causal. Answer: QN=11 The following system y[n] = x[n] - x[n-1]
is:
, a. causal
b. non causal
⩥ d. All of the others.. Answer: QN=12 Digital signal processing of an
analog signal may be preferable to processing the signal directly in the
analog domain because:
a. Digital programmable system allows flexibility in reconfiguration the
digital signal processing operations simply by changing the program.
b. A digital system provides much better control of accuracy
requirements.
c. The digital signal processing method also allows for the
implementation of more sophisticated signal processing algorithms.
d. All of the others.
⩥ a. choose the number of samples as a power of 2, and use an FFT
algorithm.. Answer: QN=13 The fastest way to compute the frequency
content of a signal is to
a. choose the number of samples as a power of 2, and use an FFT
algorithm.
b. choose any reasonable number of samples and use a generic DFT
algorithm.
c. perform the calculations using pencil and paper.
d. look up the ANS in a book.