EC > GATE 2016 SET-1 > Discrete Fourier Transform
Consider the signal. x[n]=6δ[n+2]+3δ[n+1]+8δ[n]+7δ[n-1]+4δ[n-2]. If X(ejω) is the discrete-time Fourier transform of x[n], then (1/π)∫-ππX(ejω)sin2(2ω)dω is equal to

Explanation

Correct : 8

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