EC > GATE 2015 SET-2 > Communications
{Xn}n=−∞n=∞ is an independent and identically distributed (i.i.d.) random process with Xn equally likely to be +1 or −1. {Yn}n=−∞n=∞ is another random process obtained as Yn = Xn + 0.5 Xn−1. The autocorrelation function of {Yn}n=−∞n=∞, denoted by RY[k], is
A
B
C
D

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