GATE 2016 · CS1 - Forenoon
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?
Related Engineering Mathematics PYQs
Let p, q, r, s represent propositions: p: x ∈ {8, 9, 10, 11, 12} q: x is a composite number r: x is a perfect square s: x is a pri…
lim_{x -> 4} sin(x - 4) / (x - 4) = _______
A probability density function on the interval [a, 1] is given by 1/x^2 and outside this interval the value of the function is zer…
Two eigenvalues of a 3x3 real matrix P are (2 + √-1) and 3. The determinant of P is _______
The coefficient of x^12 in (x^3 + x^4 + x^5 + x^6 + ...)^3 is _______
Consider the recurrence relation a1 = 8, an = 6n^2 + 2n + a_(n-1). Let a99 = K * 10^4. The value of K is _______
Free account benefits
Turn practice into measurable progress
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.
Saved progressKeep answers, mock results and completion history across devices.
Adaptive practiceGet questions matched to your recent accuracy and difficulty level.
Bookmarks and notesBuild a personal revision list and record why a question was difficult.
Performance insightsSee weak subjects, accuracy trends, streaks and exam readiness.