Electrical Engineering > GATE 2021 > Fourier Transform
Let f(t) be an even function, i.e. f(-t) = f(t) for all t. Let the Fourier transform of f(t) be defined as F(ω) = ∫-∞ f(t)e-jωtdt for all ω, and suppose F(0) = 1. Then dF(ω) / dω = -ωF(ω) for all ω and F(0)=1.Then
A
f(0) < 1
B
f(0) > 1
C
f(0) = 1
D
f(0) = 0

Explanation

Correct : b

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