GkSeries.com

Digital Signal Processing Questions and Answers | Digital Signal Processing MCQs

Download PDF

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) If we store the signal row wise and compute the L point DFT at each column, the resulting array must be multiplied by which of the following factors?
[A] WNlq
[B] WNpq
[C] WNlq
[D] WNpm
Answer: WNpm
(2) If we split the N point data sequence into two N/2 point data sequences f1(n) and f2(n) corresponding to the even numbered and odd numbered samples of x(n), then such an FFT algorithm is known as decimation-in-time algorithm.
[A] True
[B] False
Answer: True

DOWNLOAD CURRENT AFFAIRS PDF FROM APP

(3) If we split the N point data sequence into two N/2 point data sequences f1(n) and f2(n) corresponding to the even numbered and odd numbered samples of x(n) and F1(k) and F2(k) are the N/2 point DFTs of f1(k) and f2(k) respectively, then what is the N/2 point DFT X(k) of x(n)?
[A] F1(k)+F2(k)
[B] F1(k)-WNk F2(k)
[C] F1(k)+WNk F2(k)
[D] None of the mentioned
Answer: F1(k)+WNk F2(k)
(4) If X(k) is the N/2 point DFT of the sequence x(n), then what is the value of X(k+N/2)?
[A] F1(k)+F2(k)
[B] F1(k)-WNk F2(k)
[C] F1(k)+WNk F2(k)
[D] None of the mentioned
Answer: F1(k)-WNk F2(k)
(5) How many complex multiplications are required to compute X(k)?
[A] N(N+1)
[B] N(N-1)/2
[C] N2/2
[D] N(N+1)/2
Answer: N(N+1)/2
(6) The total number of complex multiplications required to compute N point DFT by radix-2 FFT is?
[A] (N/2)log2N
[B] Nlog2N
[C] (N/2)logN
[D] None of the mentioned
Answer: (N/2)log2N
(7) The total number of complex additions required to compute N point DFT by radix-2 FFT is?
[A] (N/2)log2N
[B] Nlog2N
[C] (N/2)logN
[D] None of the mentioned
Answer: Nlog2N
(8) The following butterfly diagram is used in the computation of __________

[A] Decimation-in-time FFT
[B] Decimation-in-frequency FFT
[C] All of the mentioned
[D] None of the mentioned
Answer: Decimation-in-time FFT
(9) 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 shuffled and output is in order
(10) The following butterfly diagram is used in the computation of __________

[A] Decimation-in-time FFT
[B] Decimation-in-frequency FFT
[C] All of the mentioned
[D] None of the mentioned
Answer: Decimation-in-frequency FFT

Please share this page

Click Here to Read more questions

Teacher Eligibility Test