Electrical Engineering > GATE 2024 > System Stability

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

Consider the discrete-time systems T₁ and T₂ defined as follows:

Which one of the following statements is true?

A

T₁ and T₂ are BIBO stable.

B

T₁ and T₂ are not BIBO stable.

C

T₁ is BIBO stable but T₂ is not BIBO stable.

D

T₁ is not BIBO stable but T₂ is BIBO stable.

Check Answer

Explanation

Correct : 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