GATE 2015 · Session-1
Let a_n represent the number of bit strings of length n containing two consecutive 1s. What is the recurrence relation for a_n?
Related Engineering Mathematics PYQs
The proposition (P ∨ ¬Q) ∧ (¬P ∨ ¬Q) is logically equivalent to:
The determinant of the matrix A = \[\begin{bmatrix}1 & 2 & 3\\0 & 4 & 5\\0 & 0 & 6\end{bmatrix}\] is
Let A and B be two sets with |A| = 4 and |B| = 3. What is the total number of relations from set A to set B?
If g(x) = 1−x and h(x) = x/(x−1), then g(h(x))/h(g(x)) is:
lim(x→∞) x^(1/x) is
Which one of the following is NOT equivalent to p ↔ q?
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.