Engineering-Mathematics |Gate-2006| The 2n vertices of a graph G corresponds to all subsets of a set of size n, for n >= 6. Two vertices of G are adjacent if and only if the corresponding sets intersect in exactly two elements. The number of connected components in G is: [GATE – 2006] a. nb. n+2c. 2n/2d. …
Engineering-Mathematics |Gate-2006| Previous Year Questions| Set-15 Read More »
Engineering-Mathematics |Gate-2007| 1. Consider the following two statements about the function f(x)=|x| P. f(x) is continuous for all real values of xQ. f(x) is differentiable for all real values of x Which of the following is TRUE? [GATE – 2007] a. P is true and Q is falseb. P is false and Q is true.c. …
Engineering-Mathematics |Gate-2007| Previous Year Questions| Set-14 Read More »
Engineering-Mathematics |Gate-2008| If P, Q, R are subsets of the universal set U, then (P∩Q∩R) ∪ (Pc∩Q∩R) ∪ Qc ∪ Rc is : [GATE – 2008] a. Qc ∪ Rcb. P ∪ Qc ∪ Rcc. Pc ∪ Qc ∪ Rcd. U Answer : d) The following system of equations x1 + x2 + 2×3 = 1 x1 + 2×2 + 3 x3 = 2 …
Engineering-Mathematics |Gate-2008| Previous Year Questions| Set-13 Read More »
Engineering-Mathematics |Gate-2009| Which one of the following is TRUE for any simple connected undirected graph with more than 2 vertices? [GATE – 2009] a. No two vertices have the same degree.b. At least two vertices have the same degree.c. At least three vertices have the same degree.d. All vertices have the same degree. Answer : …
Engineering-Mathematics |Gate-2009| Previous Year Questions| Set-12 Read More »
Engineering-Mathematics |Gate-2010| Let G = (V,E) be a graph. Define ξ(G) = Σd id x d, where id is the number of vertices of degree d in G. If S and T are two different trees with ξ(S) = ξ(T),then : [GATE – 2010] a. |S| = 2|T|b. |S| = |T| – 1c. |S| = …
Engineering-Mathematics |Gate-2010| Previous Year Questions| Set-11 Read More »
Engineering-Mathematics |Gate-2011| If the difference between the expectation of the square of a random variable (E[X2]) and the square of the expectation of the random variable (E[X])2 is denoted by R, then : [GATE – 2011] a. R=0b. R<0c. R>0d. R>=0 Answer : d) Consider the matrix as given below. Which one of the following provides …
Engineering-Mathematics |Gate-2011| Previous Year Questions| Set-10 Read More »
Engineering-Mathematics |Gate-2012| 1. Consider the following logical inferences. I1: If it rains then the cricket match will not be played.The cricket match was played.Inference: There was no rain. I2: If it rains then the cricket match will not be played.It did not rain.Inference: The cricket match was played.Which of the following is TRUE? [GATE – 2012] …
Engineering-Mathematics |Gate-2012| Previous Year Questions| Set-9 Read More »
Engineering-Mathematics |Gate-2013| 1. A binary operation ⊕ on a set of integers is defined as x ⊕ y = x2 + y2. Which one of the following statements is TRUE about ⊕?[GATE – 2013] a. Commutative but not associativeb. Both commutative and associativec. Associative but not commutatived. Neither commutative nor associative Answer : a) 2. Suppose p is …
Engineering-Mathematics |Gate-2013| Previous Year Questions| Set-8 Read More »
Engineering-Mathematics |Gate-2014| 1. Let G = (V,E) be a directed graph where V is the set of vertices and E the set of edges. Then which one of the following graphs has the same strongly connected components as G? [GATE – 2014] a. G1=(V,E1) where E1={(u,v)|(u,v)∉E}b. G2=(V,E2 )where E2={(u,v)│(u,v)∈E}c. G3=(V,E3) where E3={(u,v)|there is a path of …
Engineering-Mathematics |Gate-2014| Previous Year Questions| Set-7 Read More »
Engineering-Mathematics |Gate-2015| 1. In the LU decomposition of the matrix | 2 2 || 4 9 | , if the diagonal elements of U are both 1, then the lower diagonal entry l22 of L is : [GATE – 2015] a. 5b. 6c. 7d. 8 Answer : a) 2. If g(x) = 1-x and h(x) = …
Engineering-Mathematics |Gate-2015| Previous Year Questions| Set-6 Read More »