GATE 2022
Consider a simple undirected unweighted graph with at least three vertices. If A is the adjacency matrix of the graph, then the number of 3-cycles in the graph is given by the trace of
Related Engineering Mathematics PYQs
Consider the following two statements with respect to the matrices A(m x n), B(n x m), C(n x n) and D(n x n). Statement 1: tr(AB) …
Which of the following statements is/are TRUE for a group G?
Consider a simple undirected graph of 10 vertices. If the graph is disconnected, then the maximum number of edges it can have is _…
Six identical balls are distributed among three identical bins; bins may be empty. The number of distinct arrangements is ________…
The value of the following limit is _____________. lim_{x → 0+} \(\sqrt{x}\) / (1 - e^(2*\(\sqrt{x}\)))
Which one of the following is the closed form for the generating function of the sequence {a_n} (n ≥ 0) defined below? a_n = n+1, …
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.