DFT Efficient Computation on Digital Signal Processing related Questions and Answers

Question :   Which of the following is true regarding the number of computations required to compute DFT at any one value of 'k'? 1. 4N-2 real multiplications and 4N real additions 2. 4N real multiplications and 4N-4 real additions 3. 4N-2 real multiplications and 4N+2 real additions 4. 4N real multiplications and 4N-2 real additions Answer :   4 - 4N real multiplications and 4N-2 real additions