Chemical Engineering > GATE 2012 > Linear Algebra

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

Consider the following (2×2) matrix (4 0; 0 4). Which one of the following vectors is NOT a valid eigenvector of the above matrix ?

A

(1; 0)

B

(-2; 1)

C

(4; -3)

D

(0; 0)

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