Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Previous GATE Questions in Engineering Mathematics
18
votes
1
answer
151
GATE CSE 1990 | Question: 1-viii
A graph which has the same number of edges as its complement must have number of vertices congruent to ________ or ________ modulo $4$.
A graph which has the same number of edges as its complement must have number of vertices congruent to ________ or ________ modulo $4$.
makhdoom ghaya
5.4k
views
makhdoom ghaya
asked
Nov 18, 2016
Graph Theory
gate1990
graph-theory
graph-connectivity
fill-in-the-blanks
+
–
23
votes
9
answers
152
GATE CSE 1987 | Question: 10e
Show that the conclusion $(r \to q)$ follows from the premises$:p, (p \to q) \vee (p \wedge (r \to q))$
Show that the conclusion $(r \to q)$ follows from the premises$:p, (p \to q) \vee (p \wedge (r \to q))$
makhdoom ghaya
5.4k
views
makhdoom ghaya
asked
Nov 14, 2016
Mathematical Logic
gate1987
mathematical-logic
propositional-logic
proof
descriptive
+
–
36
votes
8
answers
153
GATE CSE 1987 | Question: 10b
What is the generating function $G(z)$ for the sequence of Fibonacci numbers?
What is the generating function $G(z)$ for the sequence of Fibonacci numbers?
makhdoom ghaya
10.1k
views
makhdoom ghaya
asked
Nov 14, 2016
Combinatory
gate1987
combinatory
generating-functions
descriptive
+
–
3
votes
1
answer
154
GATE CSE 1987 | Question: 9f
Give the composition tables (Cayley Tables) of the two non-isomorphic groups of order $4$ with elements $e, a, b, c$ where $c$ is the identity element. Use the order $e, a, b, c$ for the rows and columns.
Give the composition tables (Cayley Tables) of the two non-isomorphic groups of order $4$ with elements $e, a, b, c$ where $c$ is the identity element. Use the order $e, ...
makhdoom ghaya
934
views
makhdoom ghaya
asked
Nov 14, 2016
Set Theory & Algebra
gate1987
set-theory&algebra
group-theory
group-isomorphism
descriptive
out-of-gate-syllabus
+
–
25
votes
2
answers
155
GATE CSE 1987 | Question: 9e
How many true inclusion relations are there of the form $A \subseteq B$, where $A$ and $B$ are subsets of a set $S$ with $n$ elements?
How many true inclusion relations are there of the form $A \subseteq B$, where $A$ and $B$ are subsets of a set $S$ with $n$ elements?
makhdoom ghaya
3.3k
views
makhdoom ghaya
asked
Nov 14, 2016
Set Theory & Algebra
gate1987
set-theory&algebra
relations
descriptive
+
–
11
votes
1
answer
156
GATE CSE 1987 | Question: 9d
Specify an adjacency-lists representation of the undirected graph given above.
Specify an adjacency-lists representation of the undirected graph given above.
makhdoom ghaya
1.7k
views
makhdoom ghaya
asked
Nov 14, 2016
Graph Theory
gate1987
graph-theory
easy
graph-connectivity
descriptive
+
–
15
votes
3
answers
157
GATE CSE 1987 | Question: 9c
Show that the number of odd-degree vertices in a finite graph is even.
Show that the number of odd-degree vertices in a finite graph is even.
makhdoom ghaya
1.9k
views
makhdoom ghaya
asked
Nov 14, 2016
Graph Theory
gate1987
graph-theory
degree-of-graph
descriptive
proof
+
–
24
votes
3
answers
158
GATE CSE 1987 | Question: 9b
How many one-to-one functions are there from a set $A$ with $n$ elements onto itself?
How many one-to-one functions are there from a set $A$ with $n$ elements onto itself?
makhdoom ghaya
4.4k
views
makhdoom ghaya
asked
Nov 14, 2016
Set Theory & Algebra
gate1987
set-theory&algebra
functions
descriptive
+
–
25
votes
4
answers
159
GATE CSE 1987 | Question: 9a
How many binary relations are there on a set $A$ with $n$ elements?
How many binary relations are there on a set $A$ with $n$ elements?
makhdoom ghaya
5.9k
views
makhdoom ghaya
asked
Nov 14, 2016
Set Theory & Algebra
gate1987
set-theory&algebra
relations
descriptive
+
–
2
votes
2
answers
160
GATE CSE 1987 | Question: 2f
State whether the following statements are TRUE or FALSE: Every infinite cyclic group is isomorphic to the infinite cyclic group of integers under addition.
State whether the following statements are TRUE or FALSE:Every infinite cyclic group is isomorphic to the infinite cyclic group of integers under addition.
makhdoom ghaya
936
views
makhdoom ghaya
asked
Nov 9, 2016
Graph Theory
gate1987
graph-theory
graph-isomorphism
true-false
out-of-gate-syllabus
+
–
4
votes
1
answer
161
GATE CSE 1987 | Question: 2e
State whether the following statement is TRUE or FALSE: There is a linear-time algorithm for testing the planarity of finite graphs.
State whether the following statement is TRUE or FALSE:There is a linear-time algorithm for testing the planarity of finite graphs.
makhdoom ghaya
1.4k
views
makhdoom ghaya
asked
Nov 9, 2016
Graph Theory
gate1987
graph-theory
graph-planarity
true-false
+
–
22
votes
4
answers
162
GATE CSE 1987 | Question: 2d
State whether the following statements are TRUE or FALSE: The union of two equivalence relations is also an equivalence relation.
State whether the following statements are TRUE or FALSE:The union of two equivalence relations is also an equivalence relation.
makhdoom ghaya
5.6k
views
makhdoom ghaya
asked
Nov 9, 2016
Set Theory & Algebra
gate1987
set-theory&algebra
relations
true-false
+
–
16
votes
2
answers
163
GATE CSE 1987 | Question: 1-xxvi
If $f(x_{i}).f(x_{i+1})< 0$ then There must be a root of $f(x)$ between $x_i$ and $x_{i+1}$ There need not be a root of $f(x)$ between $x_{i}$ and $x_{i+1}$ There fourth derivative of $f(x)$ with respect to $x$ vanishes at $x_{i}$ The fourth derivative of $f(x)$ with respect to $x$ vanishes at $x_{i+1}$
If $f(x_{i}).f(x_{i+1})< 0$ thenThere must be a root of $f(x)$ between $x_i$ and $x_{i+1}$There need not be a root of $f(x)$ between $x_{i}$ and $x_{i+1}$There fourth der...
makhdoom ghaya
2.8k
views
makhdoom ghaya
asked
Nov 9, 2016
Calculus
gate1987
calculus
maxima-minima
+
–
18
votes
3
answers
164
GATE CSE 1987 | Question: 1-xxiii
A square matrix is singular whenever The rows are linearly independent The columns are linearly independent The row are linearly dependent None of the above
A square matrix is singular whenever The rows are linearly independentThe columns are linearly independentThe row are linearly dependentNone of the above
makhdoom ghaya
5.6k
views
makhdoom ghaya
asked
Nov 8, 2016
Linear Algebra
gate1987
linear-algebra
matrix
+
–
16
votes
5
answers
165
GATE CSE 1987 | Question: 1-xxii
The equation $7x^{7}+14x^{6}+12x^{5}+3x^{4}+12x^{3}+10x^{2}+5x+7=0$ has All complex roots At least one real root Four pairs of imaginary roots None of the above
The equation $7x^{7}+14x^{6}+12x^{5}+3x^{4}+12x^{3}+10x^{2}+5x+7=0$ hasAll complex rootsAt least one real rootFour pairs of imaginary rootsNone of the above
makhdoom ghaya
2.9k
views
makhdoom ghaya
asked
Nov 8, 2016
Calculus
gate1987
calculus
polynomials
+
–
12
votes
4
answers
166
GATE CSE 1987 | Question: 1-xxi
If $a, b,$ and $c$ are constants, which of the following is a linear inequality? $ax+bcy=0$ $ax^{2}+cy^{2}=21$ $abx+a^{2}y \geq 15$ $xy+ax \geq 20$
If $a, b,$ and $c$ are constants, which of the following is a linear inequality?$ax+bcy=0$$ax^{2}+cy^{2}=21$$abx+a^{2}y \geq 15$$xy+ax \geq 20$
makhdoom ghaya
4.1k
views
makhdoom ghaya
asked
Nov 8, 2016
Linear Algebra
gate1987
linear-algebra
inequality
out-of-gate-syllabus
+
–
27
votes
3
answers
167
GATE CSE 1992 | Question: 14b
Consider the set of integers $\{1,2,3,4,6,8,12,24\}$ together with the two binary operations LCM (lowest common multiple) and GCD (greatest common divisor). Which of the following algebraic structures does this represent? group ring field lattice
Consider the set of integers $\{1,2,3,4,6,8,12,24\}$ together with the two binary operations LCM (lowest common multiple) and GCD (greatest common divisor). Which of the ...
go_editor
4.7k
views
go_editor
asked
Apr 24, 2016
Set Theory & Algebra
gate1992
set-theory&algebra
partial-order
lattice
normal
+
–
7
votes
2
answers
168
GATE CSE 1992 | Question: 15.b
Let $S$ be the set of all integers and let $n > 1$ be a fixed integer. Define for $a,b \in S, a R b$ iff $a-b$ is a multiple of $n$. Show that $R$ is an equivalence relation and find its equivalence classes for $n = 5$.
Let $S$ be the set of all integers and let $n 1$ be a fixed integer. Define for $a,b \in S, a R b$ iff $a-b$ is a multiple of $n$. Show that $R$ is an equivalence relat...
go_editor
3.5k
views
go_editor
asked
Apr 24, 2016
Set Theory & Algebra
gate1992
set-theory&algebra
normal
relations
descriptive
+
–
43
votes
8
answers
169
GATE CSE 2006 | Question: 73
The $2^n$ vertices of a graph $G$ corresponds to all subsets of a set of size $n$, for $n \geq 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: $n$ $n + 2$ $2^{\frac{n}{2}}$ $\frac{2^{n}}{n}$
The $2^n$ vertices of a graph $G$ corresponds to all subsets of a set of size $n$, for $n \geq 6$. Two vertices of $G$ are adjacent if and only if the corresponding set...
go_editor
9.2k
views
go_editor
asked
Apr 24, 2016
Graph Theory
gatecse-2006
graph-theory
normal
graph-connectivity
+
–
90
votes
6
answers
170
GATE CSE 2006 | Question: 72
The $2^n$ vertices of a graph $G$ corresponds to all subsets of a set of size $n$, for $n \geq 6$. Two vertices of $G$ are adjacent if and only if the corresponding sets intersect in exactly two elements. The maximum degree of a vertex in $G$ is: $\binom{\frac{n}{2}}{2}.2^{\frac{n}{2}}$ $2^{n-2}$ $2^{n-3}\times 3$ $2^{n-1}$
The $2^n$ vertices of a graph $G$ corresponds to all subsets of a set of size $n$, for $n \geq 6$. Two vertices of $G$ are adjacent if and only if the corresponding sets...
go_editor
18.0k
views
go_editor
asked
Apr 24, 2016
Graph Theory
gatecse-2006
graph-theory
normal
degree-of-graph
+
–
Page:
« prev
1
...
3
4
5
6
7
8
9
10
11
12
13
...
28
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register