GATE 2014 · session-1
An ordered n-tuple (d₁,d₂,…,dₙ) with d₁≥d₂≥⋯≥dₙ is called graphic if there exists a simple undirected graph with n vertices having degrees d₁,d₂,…,dₙ respectively. Which of the following 6-tuples is NOT graphic?
Related Engineering Mathematics PYQs
A fair six-sided die is rolled twice. What is the probability that the sum of the two outcomes is equal to 7?
The eigenvalues of a 2 x 2 matrix A are 3 and -2. What is the trace of matrix A^2?
A relation R on a non-empty set A is an equivalence relation if and only if R is:
The maximum value of the function f(x) = 2x^3 - 9x^2 + 12x + 5 in the closed interval [0, 3] is
Consider the statement “Not all that glitters is gold” Predicate glitters(x) is true if x glitters and predicate gold(x) is true i…
Suppose you break a stick of unit length at a point chosen uniformly at random. Then the expected length of the shorter stick 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.