Electronics Engineering · Digital Signal Processing
Compute the Discrete Fourier Transform (DFT) of the following sequence: x = [j, 0, j, 1]
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1[1, 0, -1, 0]
- 2[1 + 2j, j, 1 - 2j, -j]
- 3[0, 2, 0, 2]
- 4[1 + 2j, j, -1 + 2j, -j]✓
Correct answer
[1 + 2j, j, -1 + 2j, -j]
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 Electronics Engineering?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Digital Signal Processing MCQs →Want more practice questions on Digital Signal Processing?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Electronics Engineering · Digital Signal Processing