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
Most viewed questions in Engineering Mathematics
59
votes
7
answers
241
GATE CSE 2006 | Question: 24
Given a set of elements $N = {1, 2, ..., n}$ and two arbitrary subsets $A⊆N$ and $B⊆N$, how many of the n! permutations $\pi$ from $N$ to $N$ satisfy $\min(\pi(A)) = \min(\pi(B))$, where $\min(S)$ is the smallest integer in the set of integers $S$, and $\pi$(S) is the set of ... $n! \frac{|A ∩ B|}{|A ∪ B|}$ $\dfrac{|A ∩ B|^2}{^n \mathrm{C}_{|A ∪ B|}}$
Given a set of elements $N = {1, 2, ..., n}$ and two arbitrary subsets $A⊆N$ and $B⊆N$, how many of the n! permutations $\pi$ from $N$ to $N$ satisfy $\min(\pi(A)) = ...
Rucha Shelke
11.4k
views
Rucha Shelke
asked
Sep 18, 2014
Set Theory & Algebra
gatecse-2006
set-theory&algebra
normal
set-theory
+
–
23
votes
2
answers
242
GATE CSE 1999 | Question: 1.2
The number of binary relations on a set with $n$ elements is: $n^2$ $2^n$ $2^{n^2}$ None of the above
The number of binary relations on a set with $n$ elements is:$n^2$$2^n$$2^{n^2}$None of the above
Kathleen
11.4k
views
Kathleen
asked
Sep 23, 2014
Set Theory & Algebra
gate1999
set-theory&algebra
relations
combinatory
easy
+
–
51
votes
5
answers
243
GATE CSE 2001 | Question: 2.3
Let $f: A \rightarrow B$ a function, and let E and F be subsets of $A$. Consider the following statements about images. $S_1: f(E \cup F) = f(E) \cup f(F)$ $S_2: f(E \cap F)=f(E) \cap f(F)$ Which of the following is true about S1 and S2? Only $S_1$ is correct Only $S_2$ is correct Both $S_1$ and $S_2$ are correct None of $S_1$ and $S_2$ is correct
Let $f: A \rightarrow B$ a function, and let E and F be subsets of $A$. Consider the following statements about images.$S_1: f(E \cup F) = f(E) \cup f(F)$$S_2: f(E \cap F...
Kathleen
11.4k
views
Kathleen
asked
Sep 14, 2014
Set Theory & Algebra
gatecse-2001
set-theory&algebra
functions
normal
+
–
46
votes
6
answers
244
GATE CSE 2002 | Question: 1.4
The minimum number of colours required to colour the vertices of a cycle with $n$ nodes in such a way that no two adjacent nodes have the same colour is $2$ $3$ $4$ $n-2 \left \lfloor \frac{n}{2} \right \rfloor+2$
The minimum number of colours required to colour the vertices of a cycle with $n$ nodes in such a way that no two adjacent nodes have the same colour is$2$$3$$4$$n-2 \lef...
Kathleen
11.4k
views
Kathleen
asked
Sep 15, 2014
Graph Theory
gatecse-2002
graph-theory
graph-coloring
normal
+
–
1
votes
2
answers
245
A is an upper triangular with all diagonal entries zero, then I+A is
A is an upper triangular with all diagonal entries zero, then I+A is (a) invertible (b) idempotent (c) singular (d) nilpotent
A is an upper triangular with all diagonal entries zero, then I+A is(a) invertible (b) idempotent(c) singular (d) nilpotent
learncp
11.3k
views
learncp
asked
Aug 25, 2015
Linear Algebra
linear-algebra
matrix
+
–
0
votes
1
answer
246
Kenneth Rosen Edition 7 Exercise 6.2 Question 3 (Page No. 405)
A drawer contains a dozen brown socks and a dozen black socks, all unmatched. A man takes socks out at random in the dark. How many socks must he take out to be sure that he has at least two socks of the same color? How many socks must he take out to be sure that he has at least two black socks?
A drawer contains a dozen brown socks and a dozen black socks, all unmatched. A man takes socks out at random in the dark.How many socks must he take out to be sure that ...
admin
11.3k
views
admin
asked
Apr 29, 2020
Combinatory
kenneth-rosen
discrete-mathematics
counting
pigeonhole-principle
descriptive
+
–
79
votes
9
answers
247
GATE CSE 2006 | Question: 25
Let $S = \{1, 2, 3,\ldots, m\}, m >3.$ Let $X_1,\ldots,X_n$ be subsets of $S$ each of size $3.$ Define a function $f$ from $S$ to the set of natural numbers as, $f(i)$ is the number of sets $X_j$ that contain the element $i.$ That is $f(i)=\left | \left\{j \mid i\in X_j \right\} \right|$ then $ \sum_{i=1}^{m} f(i)$ is: $3m$ $3n$ $2m+1$ $2n+1$
Let $S = \{1, 2, 3,\ldots, m\}, m >3.$ Let $X_1,\ldots,X_n$ be subsets of $S$ each of size $3.$ Define a function $f$ from $S$ to the set of natural numbers as, $f(i)$ is...
Rucha Shelke
11.3k
views
Rucha Shelke
asked
Sep 18, 2014
Set Theory & Algebra
gatecse-2006
set-theory&algebra
normal
functions
+
–
29
votes
4
answers
248
GATE CSE 2012 | Question: 26
Which of the following graphs is isomorphic to
Which of the following graphs is isomorphic to
Arjun
11.2k
views
Arjun
asked
Sep 25, 2014
Graph Theory
gatecse-2012
graph-theory
graph-isomorphism
normal
non-gate
+
–
14
votes
5
answers
249
GATE CSE 1995 | Question: 1.18
The probability that a number selected at random between $100$ and $999$ (both inclusive) will not contain the digit $7$ is: $\dfrac{16}{25}$ $\left(\dfrac{9}{10}\right)^{3}$ $\dfrac{27}{75}$ $\dfrac{18}{25}$
The probability that a number selected at random between $100$ and $999$ (both inclusive) will not contain the digit $7$ is: $\dfrac{16}{25}$$\left(\dfrac{9}{10}\right)^...
gatecse
11.2k
views
gatecse
asked
Sep 15, 2014
Probability
gate1995
probability
normal
+
–
36
votes
8
answers
250
GATE CSE 2018 | Question: 15
Two people, $P$ and $Q$, decide to independently roll two identical dice, each with $6$ faces, numbered $1$ to $6$. The person with the lower number wins. In case of a tie, they roll the dice repeatedly until there is no tie. Define a ... and that all trials are independent. The probability (rounded to $3$ decimal places) that one of them wins on the third trial is ____
Two people, $P$ and $Q$, decide to independently roll two identical dice, each with $6$ faces, numbered $1$ to $6$. The person with the lower number wins. In case of a ti...
gatecse
11.2k
views
gatecse
asked
Feb 14, 2018
Probability
gatecse-2018
probability
normal
numerical-answers
1-mark
+
–
25
votes
7
answers
251
GATE CSE 2011 | Question: 31
Given $i = \sqrt{-1}$, what will be the evaluation of the definite integral $\int \limits_0^{\pi/2} \dfrac{\cos x +i \sin x} {\cos x - i \sin x} dx$ ? $0$ $2$ $-i$ $i$
Given $i = \sqrt{-1}$, what will be the evaluation of the definite integral $\int \limits_0^{\pi/2} \dfrac{\cos x +i \sin x} {\cos x - i \sin x} dx$ ?$0$$2$$-i$$i$
go_editor
11.1k
views
go_editor
asked
Sep 29, 2014
Calculus
gatecse-2011
calculus
integration
normal
+
–
19
votes
4
answers
252
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
+
–
3
votes
2
answers
253
Gate_2007 ME
The number of linearly independent Eigen vectors of is a) 0 b) 1 C) 2 d) infinite
The number of linearly independent Eigen vectors of is a) 0b) 1 C) 2d) infinite
Himanshu1
11.1k
views
Himanshu1
asked
Jan 2, 2016
Linear Algebra
engineering-mathematics
linear-algebra
eigen-value
+
–
1
votes
1
answer
254
Discrete mathematics veii imp
Prove the validity of the following argument " If I get the job and work hard,then I'll get promoted. If I get promoted then i'll be happy. I will not be happy. Therefore either i will not get the job or i will not work hard."
Prove the validity of the following argument " If I get the job and work hard,then I'll get promoted.If I get promoted then i'll be happy.I will not be happy.Therefore ei...
LavTheRawkstar
11.1k
views
LavTheRawkstar
asked
Jul 7, 2016
31
votes
5
answers
255
GATE CSE 2014 Set 3 | Question: 6
If $\int \limits_0^{2 \pi} |x \: \sin x| dx=k\pi$, then the value of $k$ is equal to ______.
If $\int \limits_0^{2 \pi} |x \: \sin x| dx=k\pi$, then the value of $k$ is equal to ______.
go_editor
11.1k
views
go_editor
asked
Sep 28, 2014
Calculus
gatecse-2014-set3
calculus
integration
limits
numerical-answers
easy
+
–
36
votes
4
answers
256
GATE CSE 2021 Set 2 | Question: 33
A bag has $r$ red balls and $b$ black balls. All balls are identical except for their colours. In a trial, a ball is randomly drawn from the bag, its colour is noted and the ball is placed back into the bag along with another ball of the same colour. Note that the number of ...
A bag has $r$ red balls and $b$ black balls. All balls are identical except for their colours. In a trial, a ball is randomly drawn from the bag, its colour is noted and ...
Arjun
11.1k
views
Arjun
asked
Feb 18, 2021
Probability
gatecse-2021-set2
probability
normal
2-marks
+
–
35
votes
5
answers
257
GATE CSE 2015 Set 3 | Question: 33
If the following system has non-trivial solution, $px + qy + rz = 0$ $qx + ry + pz = 0$ $rx + py + qz = 0$, then which one of the following options is TRUE? $p - q + r = 0 \text{ or } p = q = -r$ $p + q - r = 0 \text{ or } p = -q = r$ $p + q + r = 0 \text{ or } p = q = r$ $p - q + r = 0 \text{ or } p = -q = -r$
If the following system has non-trivial solution, $px + qy + rz = 0$$qx + ry + pz = 0$$rx + py + qz = 0$,then which one of the following options is TRUE?$p - q + r = 0 \t...
go_editor
11.1k
views
go_editor
asked
Feb 15, 2015
Linear Algebra
gatecse-2015-set3
linear-algebra
system-of-equations
normal
+
–
16
votes
3
answers
258
number of perfect matching in complete graph
Is there a way to find no of perfect matchings in a complete graph Kn where n could be either even or odd..?
Is there a way to find no of perfect matchings in a complete graph Kn where n could be either even or odd..?
dhingrak
11.0k
views
dhingrak
asked
Dec 2, 2014
Graph Theory
discrete-mathematics
graph-theory
graph-matching
+
–
24
votes
4
answers
259
GATE CSE 1992 | Question: 02,xvi
Which of the following is/are a tautology? $a \vee b \to b \wedge c$ $a \wedge b \to b \vee c$ $a \vee b \to \left(b \to c \right)$ $a \to b \to \left(b \to c \right)$
Which of the following is/are a tautology?$a \vee b \to b \wedge c$$a \wedge b \to b \vee c$$a \vee b \to \left(b \to c \right)$$a \to b \to \left(b \to c \right)$
Kathleen
11.0k
views
Kathleen
asked
Sep 13, 2014
Mathematical Logic
gate1992
mathematical-logic
easy
propositional-logic
multiple-selects
+
–
50
votes
10
answers
260
GATE CSE 2017 Set 1 | Question: 29
Let $p$, $q$ and $r$ be propositions and the expression $\left ( p\rightarrow q \right )\rightarrow r$ be a contradiction. Then, the expression $\left ( r\rightarrow p \right )\rightarrow q$ is a tautology a contradiction always TRUE when $p$ is FALSE always TRUE when $q$ is TRUE
Let $p$, $q$ and $r$ be propositions and the expression $\left ( p\rightarrow q \right )\rightarrow r$ be a contradiction. Then, the expression $\left ( r\rightarrow p \r...
Arjun
10.9k
views
Arjun
asked
Feb 14, 2017
Mathematical Logic
gatecse-2017-set1
mathematical-logic
propositional-logic
+
–
Page:
« prev
1
...
8
9
10
11
12
13
14
15
16
17
18
...
529
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register