☰
GkSeries.com

Digital Signal Processing Questions and Answers | Digital Signal Processing MCQs

Free download in PDF Digital Signal Processing Multiple Choice Questions and Answers for competitive exams. These short objective type questions with answers are very important for Board exams as well as competitive exams like UPSC, NDA, SSC etc. These short solved questions or quizzes are provided by Gkseries./p>

Go To Download Page
(1) For a decimation-in-time FFT algorithm, which of the following is true?
[A] Both input and output are in order
[B] Both input and output are shuffled
[C] Input is shuffled and output is in order
[D] Input is in order and output is shuffled
Answer: Input is in order and output is shuffled
(2) FFT algorithm is designed to perform complex operations.
[A] True
[B] False
Answer: True
(3) 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: X1(k)+W2kNX2(k)<
(4) 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: X1(k)-W2kNX2(k)
(5) Decimation-in frequency FFT algorithm is used to compute H(k).
[A] True
[B] False
Answer: True
(6) 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: (N/2)log2N
(7) 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: 2Nlog2N
(8) 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: [Nlog22N]/L
(9) If the desired number of values of the DFT is less than log2N, a direct computation of the desired values is more efficient than FFT algorithm.
[A] True
[B] False
Answer: True
(10) What is the transform that is suitable for evaluating the z-transform of a set of data on a variety of contours in the z-plane?
[A] Goertzel Algorithm
[B] Fast Fourier transform
[C] Chirp-z transform
[D] None of the mentioned
Answer: Chirp-z transform
Click Here to Read more questions