GATE 2026 · session-8
The number of bijections \(f(\cdot)\) from the set \(S = \{1, 2, 3, 4\}\) to itself such that \(f(f(n)) = n\), for all \(n \in S\), is ________. (Answer in integer)
Related Probability and Statistics PYQs
Let \(M\) be a randomly chosen non-empty subset of \(S = \{1,2,3,\ldots,2026\}\). Which of the following is the probability that t…
Suppose that a computer program provides a non-negative and integer-valued random solution to the equation \(n_1 + n_2 + n_3 + n_4…
Suppose a random variable \(Z\) follows \(Normal(\mu=0, \sigma^2=1)\) distribution with probability density function \(g(z)\) and …
Let \(X\) be an exponentially distributed random variable with mean \(\lambda (> 0)\). If \(P(X > 5) = 0.35\), then the conditiona…
Let \(X\) and \(Y\) be two independent random variables. \(X\) follows \(Bernoulli(p=0.3)\) distribution and \(Y\) follows \(Norma…
Let \[ L = \lim_{n \to \infty} \sum_{k=0}^{n} \frac{e^{-n} n^{k}}{k!} \] Which of the following is the value of \(L\)?
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.