Electrical Engineering > Gate 2019 > Matrix

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

M is a 2 × 2 matrix with eigenvalues 4 and 9. The eigenvalues of M² are

A

2 and 3

B

−2 and −3

C

4 and 9

D

16 and 81

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