Explore topic-wise MCQs in Digital Signal Processing.

This section includes 18 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.

How many complex multiplication are required per output data point?

A. [(N/2)logN]/L
B. [Nlog22N]/L
C. [(N/2)log2N]/L
D. None of the mentioned
Answer» C. [(N/2)log2N]/L
Discussion
2.

How many complex additions are required to be performed in linear filtering of a sequence using FFT algorithm?

A. (N/2)logN
B. 2Nlog2N
C. (N/2)log2N
D. Nlog2N
Answer» C. (N/2)log2N
Discussion
3.

How many complex multiplications are need to be performed for each FFT algorithm?

A. (N/2)logN
B. Nlog2N
C. (N/2)log2N
D. None of the mentioned
Answer» D. None of the mentioned
Discussion
4.

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

A. True
B. False
Answer» B. False
Discussion
5.

If g(n) is a real valued sequence of 2N points and x1(n)=g(2n) and x2(n)=g(2n+1), then what is the value of G(k), k=N,N-1,…2N-1?

A. X1(k)-W2kX2(k)
B. X1(k)+W2kNX2(k)
C. X1(k)+W2kX2(k)
D. X1(k)-W2kNX2(k)
Answer» E.
Discussion
6.

If g(n) is a real valued sequence of 2N points and x1(n)=g(2n) and x2(n)=g(2n+1), then what is the value of G(k), k=0,1,2…N-1?

A. X1(k)-W2kNX2(k)
B. X1(k)+W2kNX2(k)
C. X1(k)+W2kX2(k)
D. X1(k)-W2kX2(k)
Answer» C. X1(k)+W2kX2(k)
Discussion
7.

If X(k) is the DFT of x(n) which is defined as x(n)=x1(n)+jx2(n), 0≤ n≤ N-1, then what is the DFT of x1(n)?

A. \(\frac{1}{2} [X*(k)+X*(N-k)]\)
B. \(\frac{1}{2} [X*(k)-X*(N-k)]\)
C. \(\frac{1}{2j} [X*(k)-X*(N-k)]\)
D. \(\frac{1}{2j} [X*(k)+X*(N-k)]\)
Answer» B. \(\frac{1}{2} [X*(k)-X*(N-k)]\)
Discussion
8.

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. \(\frac{x(n)-x*(n)}{2}\)
B. \(\frac{x(n)+x*(n)}{2}\)
C. \(\frac{x(n)+x*(n)}{2j}\)
D. \(\frac{x(n)-x*(n)}{2j}\)
Answer» E.
Discussion
9.

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 x1(n)?

A. \(\frac{x(n)-x^* (n)}{2}\)
B. \(\frac{x(n)+x^* (n)}{2}\)
C. \(\frac{x(n)-x^* (n)}{2j}\)
D. \(\frac{x(n)+x^* (n)}{2j}\)
Answer» C. \(\frac{x(n)-x^* (n)}{2j}\)
Discussion
10.

HOW_MANY_COMPLEX_MULTIPLICATIONS_ARE_NEED_TO_BE_PERFORMED_FOR_EACH_FFT_ALGORITHM??$

A. (N/2)logN
B. Nlog<sub>2</sub>N
C. (N/2)log<sub>2</sub>N
D. None of the mentioned
Answer» D. None of the mentioned
Discussion
11.

How many complex multiplication are required per output data point?$

A. [(N/2)logN]/L
B. [Nlog<sub>2</sub>2N]/L
C. [(N/2)log<sub>2</sub>N]/L
D. None of the mentioned
Answer» C. [(N/2)log<sub>2</sub>N]/L
Discussion
12.

How_many_complex_additions_are_required_to_be_performed_in_linear_filtering_of_a_sequence_using_FFT_algorithm?$

A. (N/2)logN
B. 2Nlog<sub>2</sub>N
C. (N/2)log<sub>2</sub>N
D. Nlog<sub>2</sub>N
Answer» C. (N/2)log<sub>2</sub>N
Discussion
13.

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

A. True
B. False
Answer» B. False
Discussion
14.

If g(n) is a real valued sequence of 2N points and x1(n)=g(2n) and x2(n)=g(2n+1), then what is the value of G(k), k=N,N-1,…2N-1?$

A. X1(k)-W<sub>2</sub><sup>k</sup>X2(k)
B. X1(k)+W<sub>2</sub><sup>k</sup>NX2(k)
C. X1(k)+W<sub>2</sub><sup>k</sup>X2(k)
D. X1(k)-W<sub>2</sub><sup>k</sup>NX2(k)
Answer» E.
Discussion
15.

If g(n) is a real valued sequence of 2N points and x1(n)=g(2n) and x2(n)=g(2n+1), then what is the value of G(k), k=0,1,2…N-1?$

A. X1(k)-W<sub>2</sub><sup>k</sup>NX2(k)
B. X1(k)+W<sub>2</sub><sup>k</sup>NX2(k)
C. X1(k)+W<sub>2</sub><sup>k</sup>X2(k)
D. X1(k)-W<sub>2</sub><sup>k</sup>X2(k)
Answer» C. X1(k)+W<sub>2</sub><sup>k</sup>X2(k)
Discussion
16.

If X(k) is the DFT of x(n) which is defined as x(n)=x1(n)+jx2(n), 0≤ n≤ N-1, then what is the DFT of x1(n)?$

A. 1/2 [X*(k)+X*(N-k)].
B. 1/2 [X*(k)-X*(N-k)].
C. 1/2j [X*(k)-X*(N-k)].
D. 1/2j [X*(k)+X*(N-k)].
Answer» B. 1/2 [X*(k)-X*(N-k)].
Discussion
17.

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.
Discussion
18.

FFT algorithm is designed to perform complex operations.

A. True
B. False
Answer» B. False
Discussion