Computer Sciences > Gate 2022 > 1
Consider the following two statements with respect to the matrices Am×n , Bn×m , Cn×n and Dn×n

Statement 1: tr(AB) = tr(BA)
Statement 2: tr(CD) = tr(DC)
where tr() represents the trace of a matrix. Which one of the following holds?
A
Statement 1 is correct and Statement 2 is wrong.
B
Statement 1 is wrong and Statement 2 is correct.
C
Both Statement 1 and Statement 2 are correct.
D
Both Statement 1 and Statement 2 are wrong.

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