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
19
votes
4
answers
41
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.1k
views
admin
asked
Feb 15, 2023
Linear Algebra
gatecse-2023
linear-algebra
determinant
1-mark
easy
+
–
46
votes
8
answers
42
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.4k
views
Madhav
asked
Feb 14, 2017
Linear Algebra
gatecse-2017-set2
engineering-mathematics
linear-algebra
numerical-answers
eigen-value
+
–
87
votes
7
answers
43
GATE CSE 2004 | Question: 23, ISRO2007-32
Identify the correct translation into logical notation of the following assertion. Some boys in the class are taller than all the girls Note: $\text{taller} (x, y)$ is true if $x$ is taller than $y$ ... $(\exists x) (\text{boy}(x) \land (\forall y) (\text{girl}(y) \rightarrow \text{taller}(x, y)))$
Identify the correct translation into logical notation of the following assertion.Some boys in the class are taller than all the girlsNote: $\text{taller} (x, y)$ is true...
Kathleen
114k
views
Kathleen
asked
Sep 18, 2014
Mathematical Logic
gatecse-2004
mathematical-logic
easy
isro2007
first-order-logic
+
–
0
votes
3
answers
44
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
17.7k
views
admin
asked
Mar 30, 2020
Graph Theory
nielit2017july-scientistb-it
discrete-mathematics
graph-theory
+
–
44
votes
10
answers
45
GATE CSE 2016 Set 2 | Question: 29
The value of the expression $13^{99}\pmod{17}$ in the range $0$ to $16$, is ________.
The value of the expression $13^{99}\pmod{17}$ in the range $0$ to $16$, is ________.
Akash Kanase
17.5k
views
Akash Kanase
asked
Feb 12, 2016
Combinatory
gatecse-2016-set2
modular-arithmetic
normal
numerical-answers
+
–
85
votes
8
answers
46
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.4k
views
Akash Kanase
asked
Feb 12, 2016
Set Theory & Algebra
gatecse-2016-set2
set-theory&algebra
difficult
set-theory
+
–
78
votes
6
answers
47
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.3k
views
Arjun
asked
Sep 2, 2014
Mathematical Logic
gate1992
mathematical-logic
normal
first-order-logic
+
–
18
votes
4
answers
48
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
10.4k
views
Arjun
asked
Feb 15, 2022
Linear Algebra
gatecse-2022
linear-algebra
matrix
1-mark
+
–
49
votes
10
answers
49
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.5k
views
Sandeep Singh
asked
Feb 12, 2016
Linear Algebra
gatecse-2016-set1
linear-algebra
eigen-value
numerical-answers
normal
+
–
59
votes
7
answers
50
GATE CSE 2003 | Question: 32
Which of the following is a valid first order formula? (Here \(\alpha\) and \(\beta\) are first order formulae with $x$ as their only free variable) $((∀x)[α] ⇒ (∀x)[β]) ⇒ (∀x)[α ⇒ β]$ $(∀x)[α] ⇒ (∃x)[α ∧ β]$ $((∀x)[α ∨ β] ⇒ (∃x)[α]) ⇒ (∀x)[α]$ $(∀x)[α ⇒ β] ⇒ (((∀x)[α]) ⇒ (∀x)[β])$
Which of the following is a valid first order formula? (Here \(\alpha\) and \(\beta\) are first order formulae with $x$ as their only free variable)$((∀x)[α] ⇒ (∀x...
Kathleen
16.6k
views
Kathleen
asked
Sep 16, 2014
Mathematical Logic
gatecse-2003
mathematical-logic
first-order-logic
normal
+
–
79
votes
5
answers
51
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
16.5k
views
priya
asked
Sep 2, 2014
Linear Algebra
gatecse-2007
eigen-value
linear-algebra
difficult
+
–
40
votes
6
answers
52
GATE CSE 2019 | Question: 38
Let $G$ be any connected, weighted, undirected graph. $G$ has a unique minimum spanning tree, if no two edges of $G$ have the same weight. $G$ has a unique minimum spanning tree, if, for every cut of $G$, there is a unique minimum-weight edge crossing the cut. Which of the following statements is/are TRUE? I only II only Both I and II Neither I nor II
Let $G$ be any connected, weighted, undirected graph.$G$ has a unique minimum spanning tree, if no two edges of $G$ have the same weight.$G$ has a unique minimum spanning...
Arjun
20.3k
views
Arjun
asked
Feb 7, 2019
Graph Theory
gatecse-2019
engineering-mathematics
discrete-mathematics
graph-theory
graph-connectivity
2-marks
+
–
78
votes
6
answers
53
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.4k
views
go_editor
asked
Sep 28, 2014
Set Theory & Algebra
gatecse-2014-set3
set-theory&algebra
functions
normal
+
–
75
votes
11
answers
54
GATE CSE 2009 | Question: 21
An unbalanced dice (with $6$ faces, numbered from $1$ to $6$) is thrown. The probability that the face value is odd is $90\%$ of the probability that the face value is even. The probability of getting any even numbered face is the same. If the ... following options is closest to the probability that the face value exceeds $3$? $0.453$ $0.468$ $0.485$ $0.492$
An unbalanced dice (with $6$ faces, numbered from $1$ to $6$) is thrown. The probability that the face value is odd is $90\%$ of the probability that the face value is ev...
gatecse
16.2k
views
gatecse
asked
Sep 15, 2014
Probability
gatecse-2009
probability
normal
conditional-probability
+
–
28
votes
6
answers
55
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.5k
views
Arjun
asked
Feb 12, 2020
Graph Theory
gatecse-2020
numerical-answers
graph-theory
graph-coloring
2-marks
+
–
28
votes
8
answers
56
GATE CSE 2020 | Question: 42
The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L’s are indistinguishable, is ______.
The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L’s are indistinguishable, is ______.
Arjun
16.3k
views
Arjun
asked
Feb 12, 2020
Combinatory
gatecse-2020
numerical-answers
combinatory
2-marks
+
–
42
votes
11
answers
57
GATE CSE 2018 | Question: 1
Which one of the following is a closed form expression for the generating function of the sequence $\{a_n\}$, where $a_n = 2n +3 \text{ for all } n=0, 1, 2, \dots$? $\frac{3}{(1-x)^2}$ $\frac{3x}{(1-x)^2}$ $\frac{2-x}{(1-x)^2}$ $\frac{3-x}{(1-x)^2}$
Which one of the following is a closed form expression for the generating function of the sequence $\{a_n\}$, where $a_n = 2n +3 \text{ for all } n=0, 1, 2, \dots$?$\frac...
gatecse
22.4k
views
gatecse
asked
Feb 14, 2018
Combinatory
gatecse-2018
generating-functions
normal
combinatory
1-mark
+
–
49
votes
7
answers
58
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 polynomi...
Arjun
15.9k
views
Arjun
asked
Feb 14, 2017
Probability
gatecse-2017-set2
probability
random-variable
difficult
+
–
77
votes
8
answers
59
GATE CSE 2014 Set 2 | Question: 50
Consider the following relation on subsets of the set $S$ of integers between $1$ and $2014$. For two distinct subsets $U$ and $V$ of $S$ we say $U\:<\:V$ if the minimum element in the symmetric difference of the two sets is in $U$. Consider the ... $S1$ is true and $S2$ is false $S2$ is true and $S1$ is false Neither $S1$ nor $S2$ is true
Consider the following relation on subsets of the set $S$ of integers between $1$ and $2014$. For two distinct subsets $U$ and $V$ of $S$ we say $U\:<\:V$ if the minimum ...
go_editor
15.6k
views
go_editor
asked
Sep 28, 2014
Set Theory & Algebra
gatecse-2014-set2
set-theory&algebra
normal
set-theory
+
–
86
votes
8
answers
60
GATE CSE 2004 | Question: 79
How many graphs on $n$ labeled vertices exist which have at least $\frac{(n^2 - 3n)}{ 2}$ edges ? $^{\left(\frac{n^2-n}{2}\right)}C_{\left(\frac{n^2-3n} {2}\right)}$ $^{{\large\sum\limits_{k=0}^{\left (\frac{n^2-3n}{2} \right )}}.\left(n^2-n\right)}C_k$ $^{\left(\frac{n^2-n}{2}\right)}C_n$ $^{{\large\sum\limits_{k=0}^n}.\left(\frac{n^2-n}{2}\right)}C_k$
How many graphs on $n$ labeled vertices exist which have at least $\frac{(n^2 - 3n)}{ 2}$ edges ?$^{\left(\frac{n^2-n}{2}\right)}C_{\left(\frac{n^2-3n} {2}\right)}$$^{{\l...
Kathleen
14.2k
views
Kathleen
asked
Sep 18, 2014
Graph Theory
gatecse-2004
graph-theory
combinatory
normal
counting
+
–
Page:
« prev
1
2
3
4
5
6
7
8
...
519
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register