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
Recent questions in Engineering Mathematics
30
votes
5
answers
7401
GATE CSE 1989 | Question: 14a
Symbolize the expression "Every mother loves her children" in predicate logic.
Symbolize the expression "Every mother loves her children" in predicate logic.
makhdoom ghaya
6.0k
views
makhdoom ghaya
asked
Dec 15, 2016
Mathematical Logic
gate1989
descriptive
first-order-logic
mathematical-logic
+
–
25
votes
4
answers
7402
GATE CSE 1989 | Question: 13c
Find the number of single valued functions from set $A$ to another set $B,$ given that the cardinalities of the sets $A$ and $B$ are $m$ and $n$ respectively.
Find the number of single valued functions from set $A$ to another set $B,$ given that the cardinalities of the sets $A$ and $B$ are $m$ and $n$ respectively.
makhdoom ghaya
2.9k
views
makhdoom ghaya
asked
Dec 15, 2016
Set Theory & Algebra
gate1989
descriptive
functions
set-theory&algebra
+
–
0
votes
1
answer
7403
MadeEasy Test Series: Mathematical Logic - First Order Logic
KISHALAY DAS
1.8k
views
KISHALAY DAS
asked
Dec 15, 2016
Mathematical Logic
made-easy-test-series
mathematical-logic
first-order-logic
+
–
1
votes
0
answers
7404
First Order Logic
Samujjal Das
1.0k
views
Samujjal Das
asked
Dec 15, 2016
Mathematical Logic
mathematical-logic
+
–
1
votes
2
answers
7405
MadeEasy Test Series: Linear Algebra - Eigen Value
can we use some identity to find value of ab+by+ya???without finding its eigen values and then multiplying..earlier i have read it somewhere but i forget it.
can we use some identity to find value of ab+by+ya???without finding its eigen values and then multiplying..earlier i have read it somewhere but i forget it.
Nishant Arora
725
views
Nishant Arora
asked
Dec 15, 2016
Linear Algebra
made-easy-test-series
engineering-mathematics
linear-algebra
eigen-value
+
–
0
votes
1
answer
7406
MadeEasy Test Series: Set Theory & Algebra - Groups
Which of the following is true? Every lower triangular matrix is group under multiplication operation where all elements of diagonal are non zero numbers. Every diagonal matrix is group under multiplication operation, where all elements of ... under addition operation where all elements are real numbers. Both (a) and b) Why is C incorrect?
Which of the following is true?Every lower triangular matrix is group under multiplication operation where all elements of diagonal are non zero numbers.Every diagonal ma...
Kai
846
views
Kai
asked
Dec 15, 2016
Set Theory & Algebra
made-easy-test-series
engineering-mathematics
discrete-mathematics
set-theory&algebra
group-theory
+
–
0
votes
0
answers
7407
Maths easy
The number of pairs of set (X, Y) are there that satisfy the condition X, Y ⊆ {1, 2, 3, 4, 5, 6} and X ∩ Y = φ ________.
The number of pairs of set (X, Y) are there that satisfy the condition X, Y ⊆ {1, 2, 3, 4, 5, 6} and X ∩ Y = φ ________.
thor
389
views
thor
asked
Dec 15, 2016
0
votes
0
answers
7408
Relation
Which of the following is/are true ? A. $\text{R}$ is a reflexive relation on a set $\text{A}$, then $\text{R}^{n}$ is reflexive for all $n\geq0$ B. Relation $\text{R}$ on set $A$ is reflexive if and only if inverse relation $R^{-1}$ is reflexive. C Relation $\text{R}$ on set ... $M_{S\circ R} = M_R \; \odot M_S$ where $\odot$ is boolean product.
Which of the following is/are true ?A. $\text{R}$ is a reflexive relation on a set $\text{A}$, then $\text{R}^{n}$ is reflexive for all $n\geq0$B. Relation $\text{R}$ on ...
dd
307
views
dd
asked
Dec 14, 2016
Set Theory & Algebra
relations
discrete-mathematics
+
–
0
votes
1
answer
7409
Relation composition
$R$ and $S$ are two relations on a set $A$ $\begin{align*} M_R = \begin{bmatrix} 1 & 0 & 1 \\ 1 & 0 & 0 \\ 0 & 1 & 0 \\ \end{bmatrix} \qquad M_S = \begin{bmatrix} 0 & 1 & 1 \\ 0 & 1 & 0 \\ 1 & 1 & 0 \\ \end{bmatrix} \end{align*}$ Then matrices for $R \cap S$ and $R \cup S$ ?
$R$ and $S$ are two relations on a set $A$$$\begin{align*} M_R = \begin{bmatrix} 1 & 0 & 1 \\ 1 & 0 & 0 \\ 0 & 1 & 0 \\ \end{bmatrix} \qquad M_S = \begin{bmatrix} 0 & 1 &...
dd
585
views
dd
asked
Dec 14, 2016
Set Theory & Algebra
relations
discrete-mathematics
+
–
1
votes
1
answer
7410
Relation
How many non zero entries does the matrix representing relation $R$ on a set $A$ = $\left \{ 1,2,3,4,5,6....1000 \right \}$. a. $R = \left \{ (x,y) \; | x = y \pm 1 \right \}$ b. $R = \left \{ (x,y) \; | x + y = 1000 \right \}$
How many non zero entries does the matrix representing relation $R$ on a set $A$ = $\left \{ 1,2,3,4,5,6....1000 \right \}$.a. $R = \left \{ (x,y) \; | x = y \pm 1 \right...
dd
1.8k
views
dd
asked
Dec 14, 2016
Set Theory & Algebra
relations
discrete-mathematics
+
–
0
votes
0
answers
7411
Equivalence relation
True / false ? a. Partitions formed from congruence classes modulo $6$ ... $R_4$ creates refinement partitions with respect to the partitions of $R_3$.
True / false ?a. Partitions formed from congruence classes modulo $6$ is a refinement of the partitions formed from congruence classes modulo 3s and t are bit strings and...
dd
513
views
dd
asked
Dec 14, 2016
Set Theory & Algebra
relations
equivalence-class
set-theory&algebra
+
–
2
votes
3
answers
7412
Ace Test Series: Combinatory - Permutations And Combinations
KISHALAY DAS
1.0k
views
KISHALAY DAS
asked
Dec 14, 2016
Combinatory
ace-test-series
engineering-mathematics
discrete-mathematics
combinatory
+
–
0
votes
1
answer
7413
Divisibility
It is being given that (232 + 1) is completely divisible by a whole number. Which of the following numbers is completely divisible by this number? A.(216 + 1). B.(216 - 1). C.(7 x 223). D.(296 + 1)
It is being given that (232 + 1) is completely divisible by a whole number. Which of the following numbers is completely divisible by this number?A.(216 + 1). ...
Shubham Tripathi
561
views
Shubham Tripathi
asked
Dec 14, 2016
0
votes
0
answers
7414
Gate 2006
Qus 1 Qus 2
Qus 1Qus 2
Vasu_gate2017
235
views
Vasu_gate2017
asked
Dec 14, 2016
0
votes
1
answer
7415
Gate 2016
Vasu_gate2017
721
views
Vasu_gate2017
asked
Dec 13, 2016
2
votes
1
answer
7416
Gate 2014
Qus 1 Qus2
Qus 1Qus2
Vasu_gate2017
2.5k
views
Vasu_gate2017
asked
Dec 13, 2016
0
votes
0
answers
7417
ME FLT-1 Q-10
i have used hypergeometric distribution but MADE Easy have used binomial theorem..we should use binomial when replacement are done na? my ans.0.6 made easy ans:0.81
i have used hypergeometric distribution but MADE Easy have used binomial theorem..we should use binomial when replacement are done na?my ans.0.6made easy ans:0.81
Nishant Arora
391
views
Nishant Arora
asked
Dec 13, 2016
Mathematical Logic
probability
made-easy-test-series
test-series
+
–
1
votes
2
answers
7418
Probablity Problem
KISHALAY DAS
693
views
KISHALAY DAS
asked
Dec 12, 2016
Probability
engineering-mathematics
probability
+
–
0
votes
1
answer
7419
eularian circuit
Suppose a connected graph has 15 labeled nodes, given that it has an eularian circuit, what is the minimum number of distinct circuits which it must have? [Note : the circuit a->b->c->a is not same as b->c->a->b]
Suppose a connected graph has 15 labeled nodes, given that it has an eularian circuit, what is the minimum number of distinct circuits which it must have? [Note : the cir...
Neal Caffery
521
views
Neal Caffery
asked
Dec 12, 2016
1
votes
1
answer
7420
graph
Which of the following statements is/are TRUE? [P] Every disconnected graph has an isolated vertex [Q] A graph is connected if and only if some vertex is connected to all other vertices [R] The edge set of every closed trail can be partitioned into edge sets of cycles [S] If a maximal trail in a graph is not closed, then its endpoints have odd degree
Which of the following statements is/are TRUE?[P] Every disconnected graph has an isolated vertex[Q] A graph is connected if and only if some vertex is connected to all o...
Neal Caffery
2.8k
views
Neal Caffery
asked
Dec 12, 2016
Graph Theory
graph-theory
engineering-mathematics
graph-connectivity
+
–
Page:
« prev
1
...
366
367
368
369
370
371
372
373
374
375
376
...
523
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register