Computer Sciences > Gate 2020 > Marix Rank
Let A and B be two n×n matrices over real numbers. Let rank(M) and det(M) denote the rank and determinant of a matrix M, respectively. Consider the following statements.

I. rank(AB) = rank(A)*rank (B)
II. det(AB) = det(A)*det(B)
III. rank(A+B) ≤ rank(A) + rank(B)
IV. det(A+B) ≤ det(A) + det(B)

Which of the above statements are TRUE ?
A
I and II only
B
I and IV only
C
II and III only
D
III and IV only

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