Biomedical Engineering > GATE 2023 > Convolution
Two sequences x1[n] and x2[n] are described as follows:
x1=x2=1,
x1=x2=2,
x1=x2=1,
x1[n]=x2[n]=0 for all n<0 and n>2.
If x[n] is obtained by convolving x1[n] with x2[n], which of the following equations is/are TRUE?
A
x=x
B
x=2
C
x=3
D
x=5

Explanation

Correct : a, d

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