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) Which of the following is true regarding the number of computations required to compute DFT at any one value of ‘k’?
[A] 4N-2 real multiplications and 4N real additions
[B] 4N real multiplications and 4N-4 real additions
[C] 4N-2 real multiplications and 4N+2 real additions
[D] 4N real multiplications and 4N-2 real additions
Answer: 4N real multiplications and 4N-2 real additions
(2) WNk+N/2=?
[A] WNk
[B] -WNk
[C] WN-k
[D] None of the mentioned
Answer: -WNk

DOWNLOAD CURRENT AFFAIRS PDF FROM APP

(3) The computation of XR(k) for a complex valued x(n) of N points requires _____________
[A] 2N2 evaluations of trigonometric functions
[B] 4N2 real multiplications
[C] 4N(N-1) real additions
[D] All of the mentioned
Answer: All of the mentioned
(4) Divide-and-conquer approach is based on the decomposition of an N-point DFT into successively smaller DFTs. This basic approach leads to FFT algorithms.
[A] True
[B] False
Answer: True
(5) If the arrangement is of the form in which the first row consists of the first M elements of x(n), the second row consists of the next M elements of x(n), and so on, then which of the following mapping represents the above arrangement?
[A] n=l+mL
[B] n=Ml+m
[C] n=ML+l
[D] none of the mentioned
Answer: n=Ml+m
(6) If N=LM, then what is the value of WNmqL?
[A] WMmq
[B] WLmq
[C] WNmq
[D] None of the mentioned
Answer: WMmq
(7) How many complex multiplications are performed in computing the N-point DFT of a sequence using divide-and-conquer method if N=LM?
[A] N(L+M+2)
[B] N(L+M-2)
[C] N(L+M-1)
[D] N(L+M+1)
Answer: N(L+M+1)
(8) How many complex additions are performed in computing the N-point DFT of a sequence using divide-and-conquer method if N=LM?
[A] N(L+M+2)
[B] N(L+M-2)
[C] N(L+M-1)
[D] N(L+M+1)
Answer: N(L+M-2)
(9) Which is the correct order of the following steps to be done in one of the algorithm of divide and conquer method?

i) Store the signal column wise

ii) Compute the M-point DFT of each row

iii) Multiply the resulting array by the phase factors WNlq.

iv) Compute the L-point DFT of each column.

v) Read the result array row wise.

[A] i-ii-iv-iii-v
[B] i-iii-ii-iv-v
[C] i-ii-iii-iv-v
[D] i-iv-iii-ii-v
Answer: i-ii-iii-iv-v
(10) If we store the signal row wise then the result must be read column wise.
[A] True
[B] False
Answer: True

Please share this page

Click Here to Read more questions

Teacher Eligibility Test