EC > GATE 2013 SET-1 > Convolution

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

The impulse response of a system is h(t) = tu(t). For an input u(t−1), the output is

A

t²/2 u(t)

B

t(t−1)/2 u(t−1)

C

(t−1)²/2 u(t−1)

D

(t²−1)/2 u(t−1)

Check Answer

Explanation

Correct : c

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