EC > GATE 2016 SET-2 > Discrete Fourier Transform
The Discrete Fourier Transform (DFT) of the 4-point sequence x[n] = {x[0], x[1], x[2], x[3]}={3,2,3,4} is X[k]={X[0],X[1],X[2],X[3]}={12,2j,0,-2j}. If X1[k] is the DFT of the 12-point sequence x1[n]={3,0,0,2,0,0,3,0,0,4,0,0}, the value of |X1[8]/X1[11]| is

Explanation

Correct : 1

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science