Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged discrete-mathematics
1
votes
1
answer
2131
GATEBOOK
Anusha Motamarri
328
views
Anusha Motamarri
asked
Feb 7, 2017
Mathematical Logic
discrete-mathematics
+
–
0
votes
1
answer
2132
Graph Theory Me workbook
How S2 is correct ,I can have more than n-k edges like if n=7 and k=3 ,then K1(a-b-c-d-e) k2(f() k2(g).K1,k2,k3 are different compoinents i assumes,Now in K1 i can add one more edge between a to c or a to d and still it will be simple graph and it will have 3 components?Please help
How S2 is correct ,I can have more than n-k edges like if n=7 and k=3 ,then K1(a-b-c-d-e) k2(f() k2(g).K1,k2,k3 are different compoinents i assumes,Now in K1 i can add on...
rahul sharma 5
703
views
rahul sharma 5
asked
Feb 4, 2017
Set Theory & Algebra
discrete-mathematics
graph-connectivity
+
–
4
votes
2
answers
2133
Group Theory discrete maths
A={1,2,3,4,5,6} Given that set A is a group with respect to multiplication mod 7.Is A a cyclic group?If yes,identify the generators. Is there any theorem that i cana pply here to solve without building operation table?
A={1,2,3,4,5,6}Given that set A is a group with respect to multiplication mod 7.Is A a cyclic group?If yes,identify the generators.Is there any theorem that i cana pply h...
rahul sharma 5
3.1k
views
rahul sharma 5
asked
Feb 3, 2017
Set Theory & Algebra
discrete-mathematics
group-theory
+
–
1
votes
0
answers
2134
Discrete maths penreposition
Can anyone tell me why the scope of NOT operator is limited to the first operand of OR only,While working with quantifiers generally not will go alway till end,so why is it limited to only first oeprand of OR and not second
Can anyone tell me why the scope of NOT operator is limited to the first operand of OR only,While working with quantifiers generally not will go alway till end,so why is ...
rahul sharma 5
168
views
rahul sharma 5
asked
Feb 3, 2017
Mathematical Logic
discrete-mathematics
mathematical-logic
+
–
3
votes
1
answer
2135
Stacks and Permutation
A stack A has 4 entries as following sequence a,b,c,d and stack B is empty. An entry popped out of stack A can be printed or pushed to stack B. An entry popped out of stack B can only be printed. Then the number of possible permutations that the entries can be printed will be ? Stack A Stack B = empty a(TOP) b c d
A stack A has 4 entries as following sequence a,b,c,d and stack B is empty. An entry popped out of stack A can be printed or pushed to stack B. An entry popped out of sta...
Prajwal Bhat
3.5k
views
Prajwal Bhat
asked
Feb 3, 2017
DS
combinatory
discrete-mathematics
data-structures
+
–
0
votes
1
answer
2136
graph theory , clique and isolated graph
here in this question they have asked about the number of edges but i cant find a way to solve pls help here...
here in this question they have asked about the number of edges but i cant find a way to solve pls help here...
S Ram
651
views
S Ram
asked
Feb 2, 2017
Others
graph-theory
discrete-mathematics
+
–
1
votes
0
answers
2137
set theory
Let S = {1, 2,......,10 }. The number of unordered pairs A, B where A and B are disjoint non-empty subsets of S is _________ (counting unordered pairs simply means we don’t distinguish the pair A,B and B,A)
Let S = {1, 2,......,10 }.The number of unordered pairs A, B where A and B are disjoint non-empty subsets of S is _________ (counting unordered pairs simply means we don&...
indrajeet
374
views
indrajeet
asked
Feb 1, 2017
Mathematical Logic
discrete-mathematics
set-theory&algebra
combinatory
+
–
1
votes
0
answers
2138
MadeEasy Subject Test: Engineering Mathematics - First Order Logic
Which of the following option is correct for the given predicate with domain of all people Where F(x, y) means x is a friend of y'. If two persons are not friend of each other then they have atleast one friend ... the answer should be there exists a person all of his friends are not friends with each other but the solution says b
Which of the following option is correct for the given predicate with domain of all people Where F(x, y) means ‘x is a friend of y’.If two persons are not friend o...
Pankaj Joshi
721
views
Pankaj Joshi
asked
Feb 1, 2017
Mathematical Logic
made-easy-test-series
discrete-mathematics
first-order-logic
+
–
0
votes
0
answers
2139
DMGT doubt
How to solve matching problem? How to solve counting problem? How to solve first order logic problem? Thanks. Do help if possible.
How to solve matching problem?How to solve counting problem?How to solve first order logic problem?Thanks. Do help if possible.
parthbkgadoya
167
views
parthbkgadoya
asked
Feb 1, 2017
Mathematical Logic
mathematical-logic
discrete-mathematics
+
–
1
votes
0
answers
2140
Maths
Sonali Rangwani
256
views
Sonali Rangwani
asked
Jan 31, 2017
Mathematical Logic
discrete-mathematics
+
–
0
votes
1
answer
2141
Logic-DM
reena_kandari
520
views
reena_kandari
asked
Jan 31, 2017
Mathematical Logic
propositional-logic
discrete-mathematics
+
–
0
votes
1
answer
2142
graph theory
How many distinct paths of length 4 that do not visit the same node more than once are there between node 0 and node 1?
How many distinct paths of length 4 that do not visit the same node more than once are there between node 0 and node 1?
Arnabi
249
views
Arnabi
asked
Jan 30, 2017
Graph Theory
graph-theory
discrete-mathematics
+
–
2
votes
0
answers
2143
MadeEasy Subject Test: Engineering Mathematics - First Order Logic
vaishali jhalani
445
views
vaishali jhalani
asked
Jan 30, 2017
Mathematical Logic
made-easy-test-series
discrete-mathematics
mathematical-logic
first-order-logic
+
–
1
votes
1
answer
2144
Permutation and Combinations
The number of ways to choose n things from 2n things of which n are alike and rest are unlike?
The number of ways to choose n things from 2n things of which n are alike and rest are unlike?
yg92
653
views
yg92
asked
Jan 29, 2017
Combinatory
cbt-2017
discrete-mathematics
combinatory
+
–
0
votes
1
answer
2145
VirtualGate Test Series: Discrete Mathematics - Graph Theory
$G$ be a simple graph on $8$ vertices such that there is a vertices of degrees $1,2,3,4,5,6,7$ respectively, Then which of the following can be the degree of the last vertex$?$ $3$ $0$ $5$ $4$
$G$ be a simple graph on $8$ vertices such that there is a vertices of degrees $1,2,3,4,5,6,7$ respectively, Then which of the following can be the degree of the last ver...
smartmeet
505
views
smartmeet
asked
Jan 27, 2017
Graph Theory
discrete-mathematics
graph-theory
degree-of-vertices
virtual-gate-test-series
+
–
0
votes
1
answer
2146
The Relation is ?
Suppose there is a set L ,set of lines and there is a Relation R, R={<L1,L2> ϵ R if L1 || L2 | L1,L2 ϵ L }. Relation R is, _______________. 1. Reflexive 2.Symmetric 3.Antisymmetric 4.Asymmetric 5.Transitive. Explanation in simple words with Example will be appreciated. Thanks.
Suppose there is a set L ,set of lines and there is a Relation R,R={<L1,L2 ϵ R if L1 || L2 | L1,L2 ϵ L }.Relation R is, _______________.1. Reflexive2.Symmetric3.An...
Jason GATE
1.1k
views
Jason GATE
asked
Jan 25, 2017
Set Theory & Algebra
discrete-mathematics
set-theory&algebra
relations
+
–
0
votes
1
answer
2147
MadeEasy Subject Test: Engineering Mathematics - First Order Logic
What is the correct translation of the following statement into mathematical logic? If everyone respect somebody then that person is honest Here respect (a, b) represent a respect b. ... None of these I feel it should be a but the answer is b.
What is the correct translation of the following statement into mathematical logic?“If everyone respect somebody then that person is honest”Here respect (a, b) repres...
Pankaj Joshi
599
views
Pankaj Joshi
asked
Jan 25, 2017
Mathematical Logic
made-easy-test-series
discrete-mathematics
mathematical-logic
first-order-logic
+
–
4
votes
1
answer
2148
Virtual Gate Test Series: Discrete Mathematics - Graph Theory (Complete Graph)
A complete graph on $n$ vertices is an undirected graph in which every pair of distinct vertices is connected by an edge. A simple path in a graph is one in which no vertex is repeated. Let $G$ be a complete graph on $10$ ... vertices in $G.$ How many simple paths are there from $\text{u to v}$ going through $\text{w?}$
A complete graph on $n$ vertices is an undirected graph in which every pair of distinct vertices is connected by an edge. A simple path in a graph is one in which no vert...
Samujjal Das
1.1k
views
Samujjal Das
asked
Jan 24, 2017
Graph Theory
discrete-mathematics
graph-theory
complete-graph
virtual-gate-test-series
+
–
2
votes
1
answer
2149
Test by Bikram | Mock GATE | Test 2 | Question: 52
An $Euler$ circuit of an undirected graph is a circuit in which each edge of the graph appears exactly once. Which of the following undirected graphs must have an $Euler$ circuit? A complete graph with $12$ vertices A complete graph with $13$ vertices A tree with $13$ vertices I and II III only II only I and III
An $Euler$ circuit of an undirected graph is a circuit in which each edge of the graph appears exactly once. Which of the following undirected graphs must have an $Euler$...
Bikram
359
views
Bikram
asked
Jan 24, 2017
Graph Theory
tbb-mockgate-2
discrete-mathematics
graph-theory
euler-graph
+
–
4
votes
1
answer
2150
Test by Bikram | Mock GATE | Test 2 | Question: 47
Which of the following statements is/are true? $(a\rightarrow b)$ always equals $\bar{a} +b.$ $\bar a+b +a \bar b $ is a tautology. $\left (a\rightarrow b \right).\left(a \bar b \right )$ is satisfiable. III only I and II only II and III only I, II, and III
Which of the following statements is/are true?$(a\rightarrow b)$ always equals $\bar{a} +b.$ $\bar a+b +a \bar b $ is a tautology.$\left (a\rightarrow b \right).\left(a ...
Bikram
296
views
Bikram
asked
Jan 24, 2017
Mathematical Logic
tbb-mockgate-2
discrete-mathematics
mathematical-logic
propositional-logic
+
–
1
votes
2
answers
2151
Test by Bikram | Mock GATE | Test 2 | Question: 42
The Conjunctive Normal form of a formula $F$ is $(P \vee Q \vee P) \wedge (P \vee Q \vee Q) \wedge (¬P \vee ¬Q \vee ¬P) \wedge (¬P \vee ¬Q \vee ¬Q)$. where, $\wedge$ means AND, $\vee$ means OR Then the value of $F$ is: $T$ $¬(P \wedge Q) \leftrightarrow (P \vee Q)$ $(P \vee Q) \leftrightarrow (P \wedge Q)$ $¬(P \wedge Q) \to (P \vee Q )$
The Conjunctive Normal form of a formula $F$ is$(P \vee Q \vee P) \wedge (P \vee Q \vee Q) \wedge (¬P \vee ¬Q \vee ¬P) \wedge (¬P \vee ¬Q \vee ¬Q)$. where...
Bikram
468
views
Bikram
asked
Jan 24, 2017
GATE
tbb-mockgate-2
discrete-mathematics
mathematical-logic
propositional-logic
conjunctive-normal-form
+
–
1
votes
1
answer
2152
Test by Bikram | Mock GATE | Test 2 | Question: 39
A relation can be defined by giving the ordered pairs of elements for which the relation holds. Let $R$ be defined over $\left \{ a,b,c \right \}$ by $R$ $=$ ... properties does $R$ have? Symmetry Antisymmetry Reflexivity Transitivity II and III only II and IV only I, III, and IV II, III, and IV
A relation can be defined by giving the ordered pairs of elements for which the relation holds.Let $R$ be defined over $\left \{ a,b,c \right \}$ by $R$ $=$ $\left \{ \le...
Bikram
333
views
Bikram
asked
Jan 24, 2017
Set Theory & Algebra
tbb-mockgate-2
discrete-mathematics
set-theory&algebra
relations
+
–
4
votes
2
answers
2153
Test by Bikram | Mock GATE | Test 2 | Question: 30
Which of the following statements are true? Every totally ordered set is a lattice Every lattice has a least element and a greatest element All totally ordered posets are also well ordered posets. i only ii and iiii only ii only i, ii and iii
Which of the following statements are true?Every totally ordered set is a latticeEvery lattice has a least element and a greatest elementAll totally ordered posets are al...
Bikram
770
views
Bikram
asked
Jan 24, 2017
Set Theory & Algebra
tbb-mockgate-2
discrete-mathematics
set-theory&algebra
lattice
+
–
1
votes
1
answer
2154
Test by Bikram | Mock GATE | Test 2 | Question: 21
Which of the following statements are false? The order of any finite group is always divisible by the order of the subgroups. Intersection of two subgroups of a group $G$, may or may not be a subgroup of $G$. Proper subgroup of an ... infinite. Prime order group has both proper and improper subgroups. III and IV II and IV I and II II, III, IV
Which of the following statements are false?The order of any finite group is always divisible by the order of the subgroups.Intersection of two subgroups of a group $G$, ...
Bikram
790
views
Bikram
asked
Jan 24, 2017
Set Theory & Algebra
tbb-mockgate-2
discrete-mathematics
set-theory&algebra
group-theory
+
–
7
votes
1
answer
2155
Test by Bikram | Mock GATE | Test 2 | Question: 10
Consider a binary function $g :P \times P \to \left \{ true,false \right \}$, where $P$ is a non-empty subset of the natural numbers that contains an even number of distinct elements. Which of the following statements ... equivalence classes $g$ defines a total order but not a partial order $g$ is reflexive and antisymmetric but not a surjection
Consider a binary function $g :P \times P \to \left \{ true,false \right \}$, where $P$ is a non-empty subset of the natural numbers that contains an even number of disti...
Bikram
994
views
Bikram
asked
Jan 24, 2017
Set Theory & Algebra
tbb-mockgate-2
discrete-mathematics
set-theory&algebra
functions
relations
+
–
1
votes
1
answer
2156
Test by Bikram | Mock GATE | Test 2 | Question: 8
Suppose $L =$ $\left \{ \right \}$ , $N = $\left \{ 1,2,3 \right \}$ Now what does the set $N × L$ contain ? $\left \{ \right \}$ $\left \{ 1,2,3 \right \}$ $\left \{ \left ( 1 \right )\left ( 2 \right ) \left ( 3 \right )\right \}$ $\left \{ \left ( 3 \right )\left ( 2 \right ) \left ( 1 \right )\right \}$
Suppose $L =$ $\left \{ \right \}$ , $N = $$\left \{ 1,2,3 \right \}$Now what does the set $N × L$ contain ? $\left \{ \right \}$$\left \{ 1,2,3 \right \}$$\left \{...
Bikram
467
views
Bikram
asked
Jan 24, 2017
GATE
tbb-mockgate-2
discrete-mathematics
set-theory&algebra
set-theory
+
–
1
votes
0
answers
2157
Functions fog, gof [GateBook]
biranchi
621
views
biranchi
asked
Jan 24, 2017
Set Theory & Algebra
functions
discrete-mathematics
+
–
3
votes
1
answer
2158
No. of injective functions ( TestBook Test Series 2 )
biranchi
451
views
biranchi
asked
Jan 23, 2017
Set Theory & Algebra
functions
discrete-mathematics
+
–
1
votes
1
answer
2159
composition of function
Let f : A → B and g : B → C denote two functions. Consider the following two statements: S1 : If both f and g are injections then the composition function gof: A → C is an injection. S2 : If the function gof: A → C is surjection and g is an ... a)) and h(a) is onto then g must be onto, where ∀a, a ∈ A. Which of the above statements are valid? please give explanation
Let f : A → B and g : B → C denote two functions. Consider the following two statements:S1 : If both f and g are injections then the composition function gof: A → C...
Pankaj Joshi
908
views
Pankaj Joshi
asked
Jan 20, 2017
Set Theory & Algebra
discrete-mathematics
functions
+
–
0
votes
1
answer
2160
MadeEasy Subject Test: Engineering Mathematics- Graph Connectivity
vaishali jhalani
541
views
vaishali jhalani
asked
Jan 20, 2017
Graph Theory
made-easy-test-series
discrete-mathematics
graph-theory
vertex-cover
maximum-independent
+
–
Page:
« prev
1
...
67
68
69
70
71
72
73
74
75
76
77
...
80
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register