1
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}}$$
2
GATE CSE 2015 Set 1
Numerical
+1
-0
In the LU decomposition of the matrix $$\left[ {\matrix{ 2 & 2 \cr 4 & 9 \cr } } \right]$$, if the diagonal elements of U are both 1, then the lower diagonal entry $${l_{22}}$$ of L is ________.
Your input ____
3
GATE CSE 2015 Set 2
Numerical
+1
-0
The larger of the two eigenvalues of the matrix $$\left[ {\matrix{ 4 & 5 \cr 2 & 1 \cr } } \right]$$ is ______.
Your input ____
4
GATE CSE 2015 Set 2
Numerical
+1
-0
The number of divisors of $$2100$$ is ___________.
Your input ____
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
CBSE
Class 12