GATE CSE 2015 Set 3 | Linear Algebra Question 35 | Discrete Mathematics

GATE CSE 2015 Set 3

MCQ (Single Correct Answer)

-0.3

In the given matrix $$\left[ {\matrix{ 1 & { - 1} & 2 \cr 0 & 1 & 0 \cr 1 & 2 & 1 \cr } } \right],$$ one of the eigenvalues is $$1.$$ The eigen vectors corresponding to the eigen value $$1$$ are

$$\left\{ {\alpha \left( {4,2,1} \right)\left| {\alpha \ne 0,\alpha \in \left. R \right\}} \right.} \right.$$

$$\left\{ {\alpha \left( { - 4,2,1} \right)\left| {\alpha \ne 0,\alpha \in \left. R \right\}} \right.} \right.$$

$$\left\{ {\alpha \left( {\sqrt 2 ,0,1} \right)\left| {\alpha \ne 0,\alpha \in \left. R \right\}} \right.} \right.$$

$$\left\{ {\alpha \left( { - \sqrt 2 ,0,1} \right)\left| {\alpha \ne 0,\alpha \in \left. R \right\}} \right.} \right.$$

GATE CSE 2015 Set 2

Numerical

-0

The number of divisors of $$2100$$ is ___________.

Your input ____

GATE CSE 2015 Set 2

Numerical

-0

The larger of the two eigenvalues of the matrix $$\left[ {\matrix{ 4 & 5 \cr 2 & 1 \cr } } \right]$$ is ______.

Your input ____

GATE CSE 2014 Set 3

MCQ (Single Correct Answer)

-0.3

Which one of the following statements is TRUE about every $$n\,\, \times \,n$$ matrix with only real eigen values?

If the trace of the matrix is positive and the determinant of the negative, at least one of its eigen values is negative.

If the trace of the matrix is positive, all its eigen values are positive.

If the determinanant of the matrix is positive, all its eigen values are positive.

If the product of the trace and determination of the matrix is positive, all its eigen values are positive.

PREVIOUS NEXT

GATE CSE Subjects

Theory of Computation

Undecidability Finite Automata and Regular Language Push Down Automata and Context Free Language Recursively Enumerable Language and Turing Machine

Operating Systems

Process Concepts and Cpu Scheduling Synchronization and Concurrency Deadlocks Memory Management File System IO and Protection

Algorithms

Complexity Analysis and Asymptotic Notations Searching and Sorting Divide and Conquer Method Greedy Method Dynamic Programming P and NP Concepts

Digital Logic

K Maps Boolean Algebra Combinational Circuits Number Systems Sequential Circuits

Database Management System

Structured Query Language Transactions and Concurrency Functional Dependencies and Normalization Relational Algebra File Structures and Indexing Er Diagrams

Data Structures

Trees Hashing Arrays Linked List Graphs Stacks and Queues

Computer Networks

Network Security Data Link Layer and Switching Application Layer Protocol Network Layer Routing Algorithm Concepts of Layering Lan Technologies and Wi-Fi TCP UDP Sockets and Congestion Control

Software Engineering

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Web Technologies

General Aptitude

Numerical Ability Logical Reasoning Verbal Ability

Discrete Mathematics

Graph Theory Set Theory & Algebra Combinatorics Mathematical Logic Probability Linear Algebra Calculus

Programming Languages

Basic of Programming Language Function and Recursion Pointer and Structure in C

Computer Organization

Computer Arithmetic Memory Interfacing Machine Instructions and Addressing Modes IO Interface Pipelining Alu Data Path and Control Unit Secondary Memory