GATE CS Engineering Mathematics questions
Practise Engineering Mathematics questions for GATE CS. Explore official PYQs and original subject-wise quizzes, check answers and view available solutions. Free, no sign-in.
Subject, topic, year and type filter the full library. Match any choice within a filter, and all selected filter categories. Search, source and sort apply to this page.
20 on this page
The minimum number of colours that is sufficient to vertex-colour any planar graph is ________.
Suppose that the eigenvalues of matrix are . The determinant of is _________.
Consider the systems, each consisting of linear equations in variables. If , then all such systems have a solution. If , then none of these systems has a solution. If , then there exists a system which has a solution. Which one of the following is CORRECT?
Suppose that a shop has an equal number of LED bulbs of two different types. The probability of an LED bulb lasting more than hours given that it is of Type is , and given that it is of Type is . The probability that an LED bulb chosen uniformly at random lasts more than hours is _________.
Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is_______________.
Compute the value of:
Consider the following matrix where two elements are unknown and are marked by and . The eigenvalues of this matrix are and What are the values of and ?
Suppose is a lattice represented by the following Hasse diagram: For any , not necessarily distinct , and are join and meet of , respectively. Let be the set of all ordered triplets of the elements of . Let …
= ______.
In the LU decomposition of the matrix , if the diagonal elements of are both , then the lower diagonal entry of is_________________.
For a set , the power set of is denoted by . If , which of the following options are TRUE?
The binary operator is defined by the following truth table. …
Which one of the following is NOT equivalent to ?
If and , then is:
is
Which one of the following well-formed formulae is a tautology?
Let and denote the sets containing and distinct objects respectively and denote the set of all possible functions defined from to . Let be randomly chosen from . The probability of being one-to-one is ______.
In a connected graph, a bridge is an edge whose removal disconnects the graph. Which one of the following statements is true?
The number of onto functions (surjective functions) from set to set is ______.
A graph is self-complementary if it is isomorphic to its complement. For all self-complementary graphs on vertices, is
