Mechanical Engineering > GATE 2013 SET-1 > Linear Algebra

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

The eigenvalues of a symmetric matrix are all

A

complex with non-zero positive imaginary part.

B

complex with non-zero negative imaginary part.

C

real.

D

pure imaginary.

Check Answer

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