Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Most viewed questions in Engineering Mathematics
11
votes
3
answers
1
relation
Number of relations $S$ over set $\{0,1,2,3 \}$ such that $(x,y) \in S \Rightarrow x = y$
Lakshman Patel RJIT
asked
in
Set Theory & Algebra
Dec 27, 2017
by
Lakshman Patel RJIT
44.0k
views
set-theory&algebra
relations
5
votes
2
answers
2
How many transitive relations are there on a set with n elements if a)n=1 b) n=2 c) n=3
How many transitive relations are there on a set with n elements if a)n=1 b) n=2 c) n=3
Sanjay Sharma
asked
in
Set Theory & Algebra
Mar 7, 2017
by
Sanjay Sharma
29.1k
views
78
votes
9
answers
3
GATE CSE 2014 Set 2 | Question: 47
The product of the non-zero eigenvalues of the matrix is ____ $\begin{pmatrix} 1 & 0 & 0 & 0 & 1 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 1 & 0 & 0 & 0 & 1 \end{pmatrix}$
go_editor
asked
in
Linear Algebra
Sep 28, 2014
by
go_editor
28.5k
views
gatecse-2014-set2
linear-algebra
eigen-value
normal
numerical-answers
98
votes
8
answers
4
GATE CSE 2012 | Question: 38
Let $G$ be a complete undirected graph on $6$ vertices. If vertices of $G$ are labeled, then the number of distinct cycles of length $4$ in $G$ is equal to $15$ $30$ $90$ $360$
gatecse
asked
in
Graph Theory
Sep 12, 2014
by
gatecse
28.0k
views
gatecse-2012
graph-theory
normal
marks-to-all
counting
1
vote
1
answer
5
Graph
1. Suppose that G is a non-directed graph with 12 edges. Suppose that G has 6 vertices of degree 3 and the rest have degrees less than 3. The minimum number of vertices G can have? a) 2 b) 0 c)1 d)3 I am getting 3..plz verify
cse23
asked
in
Graph Theory
Jan 20, 2017
by
cse23
28.0k
views
64
votes
12
answers
6
GATE CSE 1994 | Question: 1.6, ISRO2008-29
The number of distinct simple graphs with up to three nodes is $15$ $10$ $7$ $9$
Kathleen
asked
in
Graph Theory
Oct 4, 2014
by
Kathleen
27.5k
views
gate1994
graph-theory
combinatory
normal
isro2008
counting
37
votes
8
answers
7
GATE CSE 2014 Set 2 | Question: 3
The maximum number of edges in a bipartite graph on $12$ vertices is____
go_editor
asked
in
Graph Theory
Sep 28, 2014
by
go_editor
24.3k
views
gatecse-2014-set2
graph-theory
graph-connectivity
numerical-answers
normal
35
votes
6
answers
8
GATE CSE 2005 | Question: 7
The time complexity of computing the transitive closure of a binary relation on a set of $n$ elements is known to be: $O(n)$ $O(n \log n)$ $O \left( n^{\frac{3}{2}} \right)$ $O\left(n^3\right)$
Kathleen
asked
in
Set Theory & Algebra
Sep 22, 2014
by
Kathleen
21.4k
views
gatecse-2005
set-theory&algebra
normal
relations
93
votes
9
answers
9
GATE CSE 2014 Set 1 | Question: 51
Consider an undirected graph $G$ where self-loops are not allowed. The vertex set of $G$ is $\{(i,j) \mid1 \leq i \leq 12, 1 \leq j \leq 12\}$. There is an edge between $(a,b)$ and $(c,d)$ if $|a-c| \leq 1$ and $|b-d| \leq 1$. The number of edges in this graph is______.
go_editor
asked
in
Graph Theory
Sep 28, 2014
by
go_editor
20.2k
views
gatecse-2014-set1
graph-theory
numerical-answers
normal
graph-connectivity
65
votes
4
answers
10
GATE CSE 2017 Set 1 | Question: 31
Let $A$ be $n\times n$ real valued square symmetric matrix of rank $2$ with $\sum_{i=1}^{n}\sum_{j=1}^{n}A^{2}_{ij} = 50.$ Consider the following statements. One eigenvalue must be in $\left [ -5,5 \right ]$ The eigenvalue ... than $5$ Which of the above statements about eigenvalues of $A$ is/are necessarily CORRECT? Both I and II I only II only Neither I nor II
Arjun
asked
in
Linear Algebra
Feb 14, 2017
by
Arjun
19.9k
views
gatecse-2017-set1
linear-algebra
eigen-value
normal
19
votes
2
answers
11
On a set of n elements, how many relations are there that are both irreflexive and antisymmetric?
On a set of n elements, how many relations are there that are both irreflexive and antisymmetric? Please explain how to calculate .
shree
asked
in
Set Theory & Algebra
Oct 24, 2014
by
shree
19.8k
views
set-theory&algebra
relations
51
votes
17
answers
12
GATE CSE 2016 Set 1 | Question: 26
The coefficient of $x^{12}$ in $\left(x^{3}+x^{4}+x^{5}+x^{6}+\dots \right)^{3}$ is ___________.
Sandeep Singh
asked
in
Combinatory
Feb 12, 2016
by
Sandeep Singh
19.7k
views
gatecse-2016-set1
combinatory
generating-functions
normal
numerical-answers
56
votes
10
answers
13
GATE CSE 2016 Set 1 | Question: 27
Consider the recurrence relation $a_1 =8 , a_n =6n^2 +2n+a_{n-1}$. Let $a_{99}=K\times 10^4$. The value of $K$ is __________.
Sandeep Singh
asked
in
Combinatory
Feb 12, 2016
by
Sandeep Singh
19.7k
views
gatecse-2016-set1
combinatory
recurrence-relation
normal
numerical-answers
25
votes
8
answers
14
GATE CSE 2015 Set 1 | Question: 54
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_______________.
makhdoom ghaya
asked
in
Graph Theory
Feb 14, 2015
by
makhdoom ghaya
19.6k
views
gatecse-2015-set1
graph-theory
graph-connectivity
normal
graph-planarity
numerical-answers
59
votes
5
answers
15
GATE CSE 2018 | Question: 26
Consider a matrix P whose only eigenvectors are the multiples of $\begin{bmatrix} 1 \\ 4 \end{bmatrix}$. Consider the following statements. P does not have an inverse P has a repeated eigenvalue P cannot be diagonalized Which one of the ... III are necessarily true Only II is necessarily true Only I and II are necessarily true Only II and III are necessarily true
gatecse
asked
in
Linear Algebra
Feb 14, 2018
by
gatecse
19.6k
views
gatecse-2018
linear-algebra
matrix
eigen-value
normal
2-marks
62
votes
6
answers
16
GATE CSE 2007 | Question: 23
Which of the following graphs has an Eulerian circuit? Any $k$-regular graph where $k$ is an even number. A complete graph on $90$ vertices. The complement of a cycle on $25$ vertices. None of the above
Kathleen
asked
in
Graph Theory
Sep 22, 2014
by
Kathleen
19.3k
views
gatecse-2007
graph-theory
normal
graph-connectivity
69
votes
6
answers
17
GATE CSE 2008 | Question: 42
$G$ is a graph on $n$ vertices and $2n-2$ edges. The edges of $G$ can be partitioned into two edge-disjoint spanning trees. Which of the following is NOT true for $G$? For every subset of $k$ vertices, the induced subgraph has at ... least $2$ edge-disjoint paths between every pair of vertices. There are at least $2$ vertex-disjoint paths between every pair of vertices.
Akshay Jindal
asked
in
Graph Theory
Sep 27, 2014
by
Akshay Jindal
18.5k
views
gatecse-2008
graph-connectivity
normal
31
votes
4
answers
18
GATE CSE 1995 | Question: 1.25
The minimum number of edges in a connected cyclic graph on $n$ vertices is: $n-1$ $n$ $n+1$ None of the above
Kathleen
asked
in
Graph Theory
Oct 8, 2014
by
Kathleen
18.4k
views
gate1995
graph-theory
graph-connectivity
easy
42
votes
3
answers
19
GATE CSE 2008 | Question: 29
Let $X$ be a random variable following normal distribution with mean $+1$ and variance $4$. Let $Y$ be another normal variable with mean $-1$ and variance unknown. If $P (X \leq -1) = P (Y \geq 2)$ , the standard deviation of $Y$ is $3$ $2$ $\sqrt{2}$ $1$
Kathleen
asked
in
Probability
Sep 12, 2014
by
Kathleen
18.2k
views
gatecse-2008
random-variable
normal-distribution
probability
normal
29
votes
5
answers
20
GATE CSE 1996 | Question: 1.4
Which of the following statements is FALSE? The set of rational numbers is an abelian group under addition The set of integers in an abelian group under addition The set of rational numbers form an abelian group under multiplication The set of real numbers excluding zero is an abelian group under multiplication
Kathleen
asked
in
Set Theory & Algebra
Oct 9, 2014
by
Kathleen
17.8k
views
gate1996
set-theory&algebra
group-theory
normal
Page:
1
2
3
4
5
6
...
457
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Life happens, just chill and do hardwork
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Discrete Mathematics
(6.4k)
Probability
(1.2k)
Linear Algebra
(870)
Calculus
(702)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(648)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(854)
Recent Blog Comments
Please upload 4th Mock Test, due date was 4th Dec.
The counts of answered, marked etc in the exam...
Tests have been sent and all tests will be...
Maximum age limit changed from 35 yrs. to 28...
Hmm, sir totally getting your point ☺️☺️....
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Aptitude Overflow