MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 3 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. |
The total number of complex additions required to compute N point DFT by radix-2 FFT is? |
| A. | (N/2)log<sub>2</sub>N |
| B. | Nlog<sub>2</sub>N |
| C. | (N/2)logN |
| D. | None of the mentioned |
| Answer» C. (N/2)logN | |
| 2. |
The total number of complex multiplications required to compute N point DFT by radix-2 FFT is? |
| A. | (N/2)log<sub>2</sub>N |
| B. | Nlog<sub>2</sub>N |
| C. | (N/2)logN |
| D. | None of the mentioned |
| Answer» B. Nlog<sub>2</sub>N | |
| 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), then such an FFT algorithm is known as decimation-in-time algorithm. |
| A. | True |
| B. | False |
| Answer» B. False | |