June 12, 2021

DFT Algorithm Computation 2 MCQ’s

Read Time:2 Minute, 9 Second

This set of Digital Signal Processing Multiple Choice Questions & Answers (MCQs) focuses on “DFT Algorithm Computation 2″.

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

2. 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

3. 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

4. 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

5. 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

6. 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

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

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

9. 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

10. 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

Happy
Happy
0 %
Sad
Sad
0 %
Excited
Excited
0 %
Sleepy
Sleepy
0 %
Angry
Angry
0 %
Surprise
Surprise
0 %

Average Rating

5 Star
0%
4 Star
0%
3 Star
0%
2 Star
0%
1 Star
0%

Leave a Reply

Your email address will not be published. Required fields are marked *

Previous post DFT Algorithm Computation 1 MCQ’s
Next post FFT Algorithms Applications MCQ’s