1
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 ____
2
GATE CSE 2016 Set 1
Numerical
+1
-0
Let $$p,q,r,s$$ represent the following propositions.

$$p:\,\,\,x \in \left\{ {8,9,10,11,12} \right\}$$
$$q:\,\,\,x$$ is a composite number
$$r:\,\,\,x$$ is a perfect square
$$s:\,\,\,x$$ is a prime number

The integer $$x \ge 2$$ which satisfies $$\neg \left( {\left( {p \Rightarrow q} \right) \wedge \left( {\neg r \vee \neg s} \right)} \right)$$ is ______________.

Your input ____
3
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}}$$
4
GATE CSE 2016 Set 1
MCQ (Single Correct Answer)
+1
-0.3
Consider an arbitrary set of $$CPU$$-bound processes with unequal $$CPU$$ burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average waiting time in the ready queue?
A
Shortest remaining time first
B
Round-robin with time quantum less than the shortest $$CPU$$ burst
C
Uniform random
D
Highest priority first with priority proportional to $$CPU$$ burst length
EXAM MAP