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 Discrete Mathematics
27
votes
4
answers
2161
GATE CSE 2005 | Question: 42
Let $R$ and $S$ be any two equivalence relations on a non-empty set $A$. Which one of the following statements is TRUE? $R$ $∪$ $S$, $R$ $∩$ $S$ are both equivalence relations $R$ $∪$ $S$ is an equivalence relation $R$ $∩$ $S$ is an equivalence relation Neither $R$ $∪$ $S$ nor $R$ $∩$ $S$ are equivalence relations
Let $R$ and $S$ be any two equivalence relations on a non-empty set $A$. Which one of the following statements is TRUE?$R$ $∪$ $S$, $R$ $∩$ $S$ are both equivalence r...
gatecse
9.2k
views
gatecse
asked
Sep 21, 2014
Set Theory & Algebra
gatecse-2005
set-theory&algebra
normal
relations
+
–
5
votes
2
answers
2162
PREDICATE LOGIC
Recall that a predicate logic statement is contingent if its truth value depends on the choice of the universe and on the interpretations of the predicate symbol $S$ and the constant symbol $b$ involved. Consider the following predicate logic statements in ... . Always true - Contingent - Always false. Always true - Contingent - Contingent. Contingent - Always true - Always false.
Recall that a predicate logic statement is contingent if its truth value depends on the choice of the universe and on the interpretations of the predicate symbol $S$ and ...
Aboveallplayer
697
views
Aboveallplayer
asked
Jan 25, 2016
1
votes
1
answer
2163
A first course in probability by Sheldon Ross
What are the relevant chapter of probability by sheldon ross to study for gate? I think whole syllabus is within chapter 5,Should i study everything upto chapter 5 or there are some topics that can be skipped.
What are the relevant chapter of probability by sheldon ross to study for gate?I think whole syllabus is within chapter 5,Should i study everything upto chapter 5 or ther...
souren
912
views
souren
asked
May 8, 2019
Combinatory
probability
sheldon-ross
+
–
1
votes
1
answer
2164
How to solve this series which is in both AP and GP?
how to solve this series:
how to solve this series:
iarnav
6.2k
views
iarnav
asked
Nov 24, 2018
1
votes
2
answers
2165
Kenneth Rosen Edition 7 Exercise 2.2 Question 37 (Page No. 137)
Show that if $A$ is a subset of a universal set $U$, then $A \oplus A = \phi.$ $A \oplus \phi = A.$ $A \oplus U = \sim A.$ $A \oplus \sim A= U.$
Show that if $A$ is a subset of a universal set $U$, then$A \oplus A = \phi.$$A \oplus \phi = A.$$A \oplus U = \sim A.$$A \oplus \sim A= U.$
Pooja Khatri
490
views
Pooja Khatri
asked
Apr 6, 2019
Set Theory & Algebra
kenneth-rosen
discrete-mathematics
set-theory&algebra
+
–
5
votes
3
answers
2166
UGC NET CSE | June 2016 | Part 2 | Question: 25
In how many ways can the string $A \cap B - A \cap B -A$ be fully paranthesized to yield an infix expression? 15 14 13 12
In how many ways can the string $A \cap B - A \cap B -A$ be fully paranthesized to yield an infix expression?15141312
go_editor
6.7k
views
go_editor
asked
Aug 16, 2016
Combinatory
ugcnetcse-june2016-paper2
parenthesization
combinatory
+
–
3
votes
1
answer
2167
Mock DFS Q
Consider DFS over undirected graph with 4 vertices <A;B;C;D>. The discovery and finishing times of them in the order A to D are given. Select the option from following showing more than one connected components: 1) <(1,6), (2,5), (3,4), (8,10)> 2) <(6,7), (2,5), (3,4), (8,9)> 3) <(4,5), (2,8), (1,7), (3,6)> 4) <(7,8), (1,2), (5,6), (3,4)>
Consider DFS over undirected graph with 4 vertices <A;B;C;D>. The discovery and finishing times of them in the order A to D are given. Select the option from following sh...
mohitbawankar
511
views
mohitbawankar
asked
Jan 10, 2018
3
votes
4
answers
2168
UGC NET CSE | December 2012 | Part 2 | Question: 4
The power set of the set $\{ \Phi \}$ is $\{ \Phi \}$ $\{ \Phi, \{ \Phi \} \}$ $\{ 0 \}$ $\{ 0, \Phi , \{ \Phi \} \}$
The power set of the set $\{ \Phi \}$ is$\{ \Phi \}$$\{ \Phi, \{ \Phi \} \}$$\{ 0 \}$$\{ 0, \Phi , \{ \Phi \} \}$
go_editor
2.3k
views
go_editor
asked
Jul 8, 2016
Set Theory & Algebra
ugcnetcse-dec2012-paper2
set-theory&algebra
set-theory
power-set
+
–
0
votes
1
answer
2169
Made_easy_test_series
The number of totally ordered sets compatible to the given POSET are ________.
The number of totally ordered sets compatible to the given POSET are ________.
Shivam Kasat
1.6k
views
Shivam Kasat
asked
Jan 7, 2019
Graph Theory
discrete-mathematics
graph-theory
+
–
2
votes
1
answer
2170
Doubt on GATE Question
Read the statements: All women are entrepreneurs. Some women are doctors. Which of the following conclusions can be logically inferred from the above statements? All women are doctors All doctors are entrepreneurs All entrepreneurs are women Some entrepreneurs are doctors ... Is it because , if we make set of doctor as 0, then All doctors are entrepreneurs is meaningless.
Read the statements: All women are entrepreneurs. Some women are doctors. Which of the following conclusions can be logically inferred from the above statements? ...
srestha
566
views
srestha
asked
Jun 1, 2019
Mathematical Logic
discrete-mathematics
mathematical-logic
+
–
1
votes
2
answers
2171
Kenneth Rosen Edition 7 Exercise 2.3 Question 69 (Page No. 155)
Find the inverse function of $f(x) = x^3 +1.$
Find the inverse function of $f(x) = x^3 +1.$
Pooja Khatri
303
views
Pooja Khatri
asked
Apr 11, 2019
Set Theory & Algebra
kenneth-rosen
discrete-mathematics
set-theory&algebra
+
–
1
votes
1
answer
2172
TIFR-2014-Maths-A-5
Let $a_{n}=(n+1)^{100} e^{-\sqrt{n}}$ for $n \geq 1$. Then the sequence $(a_{n})_{n}$ is Unbounded Bounded but does not converge Bounded and converges to $1$ Bounded and converges to $0$
Let $a_{n}=(n+1)^{100} e^{-\sqrt{n}}$ for $n \geq 1$. Then the sequence $(a_{n})_{n}$ isUnboundedBounded but does not converge Bounded and converges to $1$Bounded and con...
makhdoom ghaya
475
views
makhdoom ghaya
asked
Dec 14, 2015
Set Theory & Algebra
tifrmaths2014
convergence
non-gate
+
–
1
votes
2
answers
2173
isro exam december 2017
The number of elements in the power set of {{1,2},{2,1,1},{2,1,1,2}} is:
The number of elements in the power set of {{1,2},{2,1,1},{2,1,1,2}} is:
snehareddy
1.1k
views
snehareddy
asked
Feb 16, 2018
Set Theory & Algebra
isro2017
+
–
32
votes
3
answers
2174
TIFR CSE 2017 | Part B | Question: 11
Given that $B(x)$ means "$x$ is a bat", $F(x)$ means "$x$ is a fly", and $E(x, y)$ means "$x$ eats $y$", what is the best English translation of $ \forall x(F(x) \rightarrow \forall y (E(y, x) \rightarrow B(y)))?$ all flies eat bats every fly is eaten by some bat bats eat only flies every bat eats flies only bats eat flies
Given that$B(x)$ means "$x$ is a bat",$F(x)$ means "$x$ is a fly", and$E(x, y)$ means "$x$ eats $y$",what is the best English translation of $$ \forall x(F(x) \rightarrow...
go_editor
3.6k
views
go_editor
asked
Dec 23, 2016
Mathematical Logic
tifr2017
first-order-logic
+
–
1
votes
3
answers
2175
Why set of all functions $f:N \rightarrow$ {0,1} is uncountably infinite?
Why set of all functions $f:N \rightarrow$ {0,1} is uncountably infinite?
Why set of all functions $f:N \rightarrow$ {0,1} is uncountably infinite?
shikharV
8.8k
views
shikharV
asked
Jan 19, 2016
Set Theory & Algebra
discrete-mathematics
set-theory&algebra
+
–
8
votes
2
answers
2176
MadeEasy Test Series 2018: Graph Theory - Graph Coloring
Consider the following graph: Which of the following will represents the chromatic number of the graph? answer given is 4. Please provide a detailed solution.
Consider the following graph: Which of the following will represents the chromatic number of the graph?answer given is 4.Please provide a detailed solution.
kapilbk1996
769
views
kapilbk1996
asked
Jan 11, 2018
Graph Theory
graph-theory
graph-coloring
made-easy-test-series
madeeasy-testseries-2018
+
–
2
votes
1
answer
2177
Kenneth Rosen Edition 7 Exercise 2.2 Question 36 (Page No. 137)
Show that $A \oplus B = (A-B) \cup (B-A).$
Show that $A \oplus B = (A-B) \cup (B-A).$
Pooja Khatri
238
views
Pooja Khatri
asked
Apr 6, 2019
Set Theory & Algebra
kenneth-rosen
discrete-mathematics
set-theory&algebra
+
–
2
votes
2
answers
2178
CMI2010-B-02
Let $G$ be a graph in which each vertex has degree at least $k$. Show that there is a path of length $k$ in $G$—that is, a sequence of $k+1$ distinct vertices $v_0, v_1, \dots , v_k$ such that for $0 \leq i < k,$ $v_i$ is connected to $v_{i+1}$ in $G$.
Let $G$ be a graph in which each vertex has degree at least $k$. Show that there is a path of length $k$ in $G$—that is, a sequence of $k+1$ distinct vertices $v_0, v_1...
go_editor
640
views
go_editor
asked
May 19, 2016
Graph Theory
cmi2010
descriptive
graph-theory
graph-connectivity
+
–
4
votes
1
answer
2179
madeeasy workbook
how option a is correct
how option a is correct
Chandrabhan Vishwa 1
2.8k
views
Chandrabhan Vishwa 1
asked
Jan 12, 2018
8
votes
3
answers
2180
Test by Bikram | Mathematics | Test 2 | Question: 25
See the above table of a,b,c,d. The total number of subgroups possible from the above diagram are _______.
See the above table of a,b,c,d. The total number of subgroups possible from the above diagram are _______.
Bikram
439
views
Bikram
asked
May 24, 2017
Mathematical Logic
tbb-mathematics-2
numerical-answers
+
–
Page:
« prev
1
...
104
105
106
107
108
109
110
111
112
113
114
...
357
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register