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
Hot questions in Engineering Mathematics
9
votes
4
answers
41
GATE CSE 2023 | Question: 20
Let $A$ be the adjacency matrix of the graph with vertices $\{1,2,3,4,5\}.$ Let $\lambda_{1}, \lambda_{2}, \lambda_{3}, \lambda_{4}$, and $\lambda_{5}$ be the five eigenvalues of $A$. Note that these eigenvalues need not be distinct. The value of $\lambda_{1}+\lambda_{2}+\lambda_{3}+\lambda_{4}+\lambda_{5}=$____________
Let $A$ be the adjacency matrix of the graph with vertices $\{1,2,3,4,5\}.$Let $\lambda_{1}, \lambda_{2}, \lambda_{3}, \lambda_{4}$, and $\lambda_{5}$ be the five eigenva...
admin
13.5k
views
admin
asked
Feb 15, 2023
Linear Algebra
gatecse-2023
linear-algebra
eigen-value
numerical-answers
1-mark
+
–
77
votes
6
answers
42
GATE CSE 2015 Set 1 | Question: 34
Suppose $L = \left\{ p, q, r, s, t\right\}$ is a lattice represented by the following Hasse diagram: For any $x, y \in L$, not necessarily distinct , $x \vee y$ and $x \wedge y$ are join and meet of $x, y$ ... $p_r = 0$ $p_r = 1$ $0 < p_r ≤ \frac{1}{5}$ $\frac{1}{5} < p_r < 1$
Suppose $L = \left\{ p, q, r, s, t\right\}$ is a lattice represented by the following Hasse diagram:For any $x, y \in L$, not necessarily distinct , $x \vee y$ and $x \we...
makhdoom ghaya
17.5k
views
makhdoom ghaya
asked
Feb 13, 2015
Set Theory & Algebra
gatecse-2015-set1
set-theory&algebra
normal
lattice
+
–
56
votes
7
answers
43
GATE CSE 2016 Set 2 | Question: 04
Consider the systems, each consisting of $m$ linear equations in $n$ variables. If $m < n$, then all such systems have a solution. If $m > n$, then none of these systems has a solution. If $m = n$, then there exists a system which has a solution. ... $\text{II}$ and $\text{III}$ are true. Only $\text{III}$ is true. None of them is true.
Consider the systems, each consisting of $m$ linear equations in $n$ variables.If $m < n$, then all such systems have a solution.If $m n$, then none of these systems has...
Akash Kanase
16.1k
views
Akash Kanase
asked
Feb 12, 2016
Linear Algebra
gatecse-2016-set2
linear-algebra
system-of-equations
normal
+
–
33
votes
5
answers
44
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
The minimum number of edges in a connected cyclic graph on $n$ vertices is:$n-1$$n$$n+1$None of the above
Kathleen
21.3k
views
Kathleen
asked
Oct 8, 2014
Graph Theory
gate1995
graph-theory
graph-connectivity
easy
+
–
52
votes
6
answers
45
GATE CSE 2018 | Question: 27
Let $N$ be the set of natural numbers. Consider the following sets, $P:$ Set of Rational numbers (positive and negative) $Q:$ Set of functions from $\{0,1\}$ to $N$ $R:$ Set of functions from $N$ to $\{0, 1\}$ $S:$ Set of finite subsets of $N$ Which of the above sets are countable? $Q$ and $S$ only $P$ and $S$ only $P$ and $R$ only $P, Q$ and $S$ only
Let $N$ be the set of natural numbers. Consider the following sets,$P:$ Set of Rational numbers (positive and negative)$Q:$ Set of functions from $\{0,1\}$ to $N$$R:$ Set...
gatecse
22.2k
views
gatecse
asked
Feb 14, 2018
Set Theory & Algebra
gatecse-2018
set-theory&algebra
countable-uncountable-set
normal
2-marks
+
–
21
votes
4
answers
46
GATE CSE 2023 | Question: 8
Let \[ A=\left[\begin{array}{llll} 1 & 2 & 3 & 4 \\ 4 & 1 & 2 & 3 \\ 3 & 4 & 1 & 2 \\ 2 & 3 & 4 & 1 \end{array}\right] \] and \[ B=\left[\begin{array}{llll} 3 & 4 & ... $\operatorname{det}(B)=-\operatorname{det}(A)$ $\operatorname{det}(A)=0$ $\operatorname{det}(A B)=\operatorname{det}(A)+\operatorname{det}(B)$
Let\[A=\left[\begin{array}{llll}1 & 2 & 3 & 4 \\4 & 1 & 2 & 3 \\3 & 4 & 1 & 2 \\2 & 3 & 4 & 1\end{array}\right]\]and\[B=\left[\begin{array}{llll}3 & 4 & 1 & 2 \\4 & 1 & 2...
admin
11.6k
views
admin
asked
Feb 15, 2023
Linear Algebra
gatecse-2023
linear-algebra
determinant
1-mark
easy
+
–
40
votes
8
answers
47
GATE CSE 2002 | Question: 1.25, ISRO2008-30, ISRO2016-6
The maximum number of edges in a $n$-node undirected graph without self loops is $n^2$ $\frac{n(n-1)}{2}$ $n-1$ $\frac{(n+1)(n)}{2}$
The maximum number of edges in a $n$-node undirected graph without self loops is$n^2$$\frac{n(n-1)}{2}$$n-1$$\frac{(n+1)(n)}{2}$
Kathleen
18.9k
views
Kathleen
asked
Sep 15, 2014
Graph Theory
gatecse-2002
graph-theory
easy
isro2008
isro2016
graph-connectivity
+
–
47
votes
8
answers
48
GATE CSE 2017 Set 2 | Question: 52
If the characteristic polynomial of a $3 \times 3$ matrix $M$ over $\mathbb{R}$ (the set of real numbers) is $\lambda^3 – 4 \lambda^2 + a \lambda +30, \quad a \in \mathbb{R}$, and one eigenvalue of $M$ is $2,$ then the largest among the absolute values of the eigenvalues of $M$ is _______
If the characteristic polynomial of a $3 \times 3$ matrix $M$ over $\mathbb{R}$ (the set of real numbers) is $\lambda^3 – 4 \lambda^2 + a \lambda +30, \quad a \in \ma...
Madhav
15.8k
views
Madhav
asked
Feb 14, 2017
Linear Algebra
gatecse-2017-set2
engineering-mathematics
linear-algebra
numerical-answers
eigen-value
+
–
78
votes
6
answers
49
GATE CSE 2014 Set 3 | Question: 49
Consider the set of all functions $f:\{0,1, \dots,2014\} \to \{0,1,\dots, 2014\}$ such that $ f\left(f\left(i\right)\right)=i$, for all $0 \leq i \leq 2014$. Consider the following statements: $P$. For each such function it must be the case that for every ... is CORRECT? $P, Q$ and $R$ are true Only $Q$ and $R$ are true Only $P$ and $Q$ are true Only $R$ is true
Consider the set of all functions $f:\{0,1, \dots,2014\} \to \{0,1,\dots, 2014\}$ such that $ f\left(f\left(i\right)\right)=i$, for all $0 \leq i \leq 2014$. Consider th...
go_editor
15.8k
views
go_editor
asked
Sep 28, 2014
Set Theory & Algebra
gatecse-2014-set3
set-theory&algebra
functions
normal
+
–
61
votes
6
answers
50
GATE CSE 2013 | Question: 24
Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is $\dfrac{1}{2}.$ What is the expected number of unordered cycles of length three? $\dfrac {1}{8}$ $1$ $7$ $8$
Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is $\dfrac{1}{2}.$ What is the expected number of ...
Arjun
20.1k
views
Arjun
asked
Sep 24, 2014
Probability
gatecse-2013
probability
expectation
normal
+
–
29
votes
6
answers
51
GATE CSE 2020 | Question: 52
Graph $G$ is obtained by adding vertex $s$ to $K_{3,4}$ and making $s$ adjacent to every vertex of $K_{3,4}$. The minimum number of colours required to edge-colour $G$ is _______
Graph $G$ is obtained by adding vertex $s$ to $K_{3,4}$ and making $s$ adjacent to every vertex of $K_{3,4}$. The minimum number of colours required to edge-colour $G$ is...
Arjun
13.9k
views
Arjun
asked
Feb 12, 2020
Graph Theory
gatecse-2020
numerical-answers
graph-theory
graph-coloring
2-marks
+
–
0
votes
3
answers
52
NIELIT 2017 July Scientist B (IT) - Section B: 2
Which of the following is an advantage of adjacency list representation over adjacency matrix representation of a graph? In adjacency list representation, space is saved for sparse graphs. Deleting a vertex in adjacency list ... Adding a vertex in adjacency list representation is easier than adjacency matrix representation. All of the option.
Which of the following is an advantage of adjacency list representation over adjacency matrix representation of a graph?In adjacency list representation, space is saved f...
admin
18.1k
views
admin
asked
Mar 30, 2020
Graph Theory
nielit2017july-scientistb-it
discrete-mathematics
graph-theory
+
–
85
votes
8
answers
53
GATE CSE 2016 Set 2 | Question: 28
Consider a set $U$ of $23$ different compounds in a chemistry lab. There is a subset $S$ of $U$ of $9$ compounds, each of which reacts with exactly $3$ compounds of $U$. Consider the following statements: Each compound in U \ S reacts ... \ S reacts with an even number of compounds. Which one of the above statements is ALWAYS TRUE? Only I Only II Only III None.
Consider a set $U$ of $23$ different compounds in a chemistry lab. There is a subset $S$ of $U$ of $9$ compounds, each of which reacts with exactly $3$ compounds of $U$. ...
Akash Kanase
16.9k
views
Akash Kanase
asked
Feb 12, 2016
Set Theory & Algebra
gatecse-2016-set2
set-theory&algebra
difficult
set-theory
+
–
19
votes
4
answers
54
GATE CSE 2022 | Question: 10
Consider the following two statements with respect to the matrices $\textit{A}_{m \times n}, \textit{B}_{n \times m}, \textit{C}_{n \times n}$ and $ \textit{D}_{n \times n}.$ Statement $1: tr \text{(AB)} = tr \text{(BA)}$ ... $2$ is correct. Both Statement $1$ and Statement $2$ are correct. Both Statement $1$ and Statement $2$ are wrong.
Consider the following two statements with respect to the matrices $\textit{A}_{m \times n}, \textit{B}_{n \times m}, \textit{C}_{n \times n}$ and $ \textit{D}_{n \times ...
Arjun
11.1k
views
Arjun
asked
Feb 15, 2022
Linear Algebra
gatecse-2022
linear-algebra
matrix
1-mark
+
–
50
votes
10
answers
55
GATE CSE 2016 Set 1 | Question: 05
Two eigenvalues of a $3 \times 3$ real matrix $P$ are $(2+\sqrt {-1})$ and $3$. The determinant of $P$ is _______
Two eigenvalues of a $3 \times 3$ real matrix $P$ are $(2+\sqrt {-1})$ and $3$. The determinant of $P$ is _______
Sandeep Singh
14.9k
views
Sandeep Singh
asked
Feb 12, 2016
Linear Algebra
gatecse-2016-set1
linear-algebra
eigen-value
numerical-answers
normal
+
–
81
votes
5
answers
56
GATE CSE 2007 | Question: 25
Let A be a $4 \times 4$ matrix with eigen values -5,-2,1,4. Which of the following is an eigen value of the matrix$\begin{bmatrix} A & I \\ I & A \end{bmatrix}$, where $I$ is the $4 \times 4$ identity matrix? $-5$ $-7$ $2$ $1$
Let A be a $4 \times 4$ matrix with eigen values -5,-2,1,4. Which of the following is an eigen value of the matrix$\begin{bmatrix} A & I \\ I & A \end{bmatrix}$, where $...
priya
17.1k
views
priya
asked
Sep 2, 2014
Linear Algebra
gatecse-2007
eigen-value
linear-algebra
difficult
+
–
78
votes
6
answers
57
GATE CSE 1992 | Question: 92,xv
Which of the following predicate calculus statements is/are valid? $(\forall (x)) P(x) \vee (\forall(x))Q(x) \implies (\forall (x)) (P(x) \vee Q(x))$ $(\exists (x)) P(x) \wedge (\exists (x))Q(x) \implies (\exists (x)) (P(x) \wedge Q(x))$ ... $(\exists (x)) (P(x) \vee Q(x)) \implies \sim (\forall (x)) P(x) \vee (\exists (x)) Q(x)$
Which of the following predicate calculus statements is/are valid?$(\forall (x)) P(x) \vee (\forall(x))Q(x) \implies (\forall (x)) (P(x) \vee Q(x))$$(\exists (x)) P(x) \w...
Arjun
16.9k
views
Arjun
asked
Sep 2, 2014
Mathematical Logic
gate1992
mathematical-logic
normal
first-order-logic
+
–
76
votes
8
answers
58
GATE CSE 2016 Set 1 | Question: 1
Let $p, q, r, s$ represents the following propositions. $p:x\in\left\{8, 9, 10, 11, 12\right\}$ $q:$ $x$ is a composite number. $r:$ $x$ is a perfect square. $s:$ $x$ is a prime number. The integer $x\geq2$ which satisfies $\neg\left(\left(p\Rightarrow q\right) \wedge \left(\neg r \vee \neg s\right)\right)$ is ____________.
Let $p, q, r, s$ represents the following propositions.$p:x\in\left\{8, 9, 10, 11, 12\right\}$$q:$ $x$ is a composite number.$r:$ $x$ is a perfect square.$s:$ $x$ is a pr...
Sandeep Singh
13.2k
views
Sandeep Singh
asked
Feb 12, 2016
Mathematical Logic
gatecse-2016-set1
mathematical-logic
normal
numerical-answers
propositional-logic
+
–
50
votes
7
answers
59
GATE CSE 2017 Set 2 | Question: 31
For any discrete random variable $X$, with probability mass function $P(X=j)=p_j, p_j \geq 0, j \in \{0, \dots , N \}$, and $\Sigma_{j=0}^N \: p_j =1$, define the polynomial function $g_x(z) = \Sigma_{j=0}^N \: p_j \: z^j$. For a certain ... . The expectation of $Y$ is $N \beta(1-\beta)$ $N \beta$ $N (1-\beta)$ Not expressible in terms of $N$ and $\beta$ alone
For any discrete random variable $X$, with probability mass function $P(X=j)=p_j, p_j \geq 0, j \in \{0, \dots , N \}$, and $\Sigma_{j=0}^N \: p_j =1$, define the polynom...
Arjun
16.3k
views
Arjun
asked
Feb 14, 2017
Probability
gatecse-2017-set2
probability
random-variable
difficult
expectation
+
–
26
votes
6
answers
60
GATE CSE 2021 Set 2 | Question: 50
Let $S$ be a set of consisting of $10$ elements. The number of tuples of the form $(A,B)$ such that $A$ and $B$ are subsets of $S$, and $A \subseteq B$ is ___________
Let $S$ be a set of consisting of $10$ elements. The number of tuples of the form $(A,B)$ such that $A$ and $B$ are subsets of $S$, and $A \subseteq B$ is ___________
Arjun
12.3k
views
Arjun
asked
Feb 18, 2021
Combinatory
gatecse-2021-set2
combinatory
counting
numerical-answers
2-marks
+
–
Page:
« prev
1
2
3
4
5
6
7
8
...
530
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register