Computer Science · Design and Analysis of Algorithms
The FFT algorithm computes the Discrete Fourier Transform (DFT). To compute the inverse DFT using the FFT algorithm, which of the following modifications can be made? (i) Switch the roles of input array a and output array y. (ii) Replace ωn by ωn-1. (iii) Divide the final result by n.
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1(i), (ii) and (iii)✓
- 2(ii) and (iii)
- 3(i) and (iii)
- 4(i) and (ii)
Correct answer
(i), (ii) and (iii)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Design and Analysis of Algorithms MCQs →Want more practice questions on Design and Analysis of Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Design and Analysis of Algorithms