Discrete Mathematics
Set Theory & Algebra
Marks 1Marks 2Marks 5
Linear Algebra
Marks 1Marks 2
Combinatorics
Marks 1Marks 2
Mathematical Logic
Marks 1Marks 2Marks 5
Probability
Marks 1Marks 2
1
GATE CSE 2016 Set 2
MCQ (Single Correct Answer)
+1
-0.3
Consider the system, each consisting of m linear equations in $$n$$ variables.
$$I.$$ $$\,\,\,$$ If $$m < n,$$ then all such system have a solution
$$II.$$ $$\,\,\,$$ If $$m > n,$$ then none of these systems has a solution
$$III.$$ $$\,\,\,$$ If $$m = n,$$ then there exists a system which has a solution

Which one of the following is CORRECT?

A
$$I$$ , $$II$$ and $$III$$ are true
B
Only $$II$$ and $$III$$ are true
C
Only $$III$$ is true
D
None of them is true
2
GATE CSE 2016 Set 2
Numerical
+1
-0
Suppose that the eigen values of matrix $$A$$ are $$1, 2, 4.$$ The determinant of $${\left( {{A^{ - 1}}} \right)^T}$$ is _______.
Your input ____
3
GATE CSE 2016 Set 1
Numerical
+1
-0
Two eigenvalues of a $$3 \times 3$$ real matrix $$P$$ are $$\left( {2 + \sqrt { - 1} } \right)$$ and $$3.$$ The determinant of $$P$$ is _______.
Your input ____
4
GATE CSE 2016 Set 1
MCQ (Single Correct Answer)
+1
-0.3
Let $${a_n}$$ be the number of $$n$$-bit strings that do NOT contain two consecutive $$1s.$$ Which one of the following is the recurrence relation for $${a_n}$$?
A
$${a_n} = {a_{n - 1}} + 2{a_{n - 2}}$$
B
$${a_n} = {a_{n - 1}} + {a_{n - 2}}$$
C
$${a_n} = 2{a_{n - 1}} + {a_{n - 2}}$$
D
$${a_n} = 2{a_{n - 1}} + 2{a_{n - 2}}$$
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization