GATE 2020
Graph G is obtained by adding vertex s to complete bipartite graph K_3,4 and making s adjacent to every vertex of K_3,4. The minimum number of colours required to edge-colour G is _______
Related Engineering Mathematics PYQs
Consider the functions: 1. e^(-x) 2. x^2 - sin x 3. sqrt(x^3 + 1) Which of the above functions is/are increasing everywhere in [0…
Let R be the set of all binary relations on the set {1, 2, 3}. Suppose a relation is chosen from R at random. The probability that…
Let G be a group of 35 elements. Then the largest possible size of a subgroup of G other than G itself is _______
Let A and B be two n x n matrices over real numbers. Let rank(M) and det(M) denote the rank and determinant of a matrix M, respect…
Which one of the following predicate formulae is NOT logically valid? (Note: W is a predicate formula without any free occurrence …
The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L's are in…
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.