EC > GATE 2017 SET-1 > Fourier Series
A periodic signal x(t) has a trigonometric Fourier series expansion x(t)=a0+∑n=1(ancos nω0t+bnsin nω0t) If x(t)=-x(-t)=-x(t-π/ω0). we can conclude that
A
an are zero for all n and bn are zero for n even
B
an are zero for all n and bn are zero for n odd
C
an are zero for n even and bn are zero for n odd
D
an are zero for n odd and bn are zero for n even

Explanation

Correct : a

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