Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Year
Exams
Recent questions tagged discrete_maths
0
votes
0
answers
Relation :DiscreteMathGB
Let R be a relation from a set A to a set B. The inverse relation from B to A, denoted by , is the set of ordered pairs . S1: R is reflexive relation iff S2: R is a symmetric relation iff Which one of the following statements is true? (A).Only S1 (B).Only S2 (C).Both S1 and S2 (D).None
asked
2 days
ago
in
Set Theory & Algebra
by
srestha
(
755
points)

7
views
discrete_maths
0
votes
0
answers
PROBABILTY AND DISTRIBUTIONS
A elevator manufacturing company believes that 'X' is the amount of that can elevator withstand without any damage with is mean 100 and standard deviation 10. This elevator is used to lift the company staff persons with mean 5 and standard deviation 0.5. How many staff person would have to be in the elevator for the probability of No damage exceeds to 0.85.
asked
Jun 30
in
Mathematical Logic
by
Stanfordboi
(
6
points)

8
views
discrete_maths
probability
poissondistribution
binomialdistribution
0
votes
0
answers
Graph Theory with Applications to Engineering and Computer Science, Narsingh Deo, Chapter 4 Question 27
asked
Jun 24
in
Graph Theory
by
dararirum
(
7
points)

13
views
discrete_maths
graphtheory
graphisomorphism
0
votes
0
answers
Graph Theory with Applications to Engineering and Computer Science, Narsingh Deo, Chapter 2 Question 21
asked
Jun 23
in
Others
by
dararirum
(
7
points)

10
views
discrete_maths
graphtheory
0
votes
3
answers
Expectation : Self Doubt
There is a bag containing 5 white and 5 black balls. You repeat the following experiment till you see a white ball : take a ball uniformly at random out of the bag. If it is white, stop. Otherwise, put it back in the bag. What is the expected number of times you will need to draw a ball from the bag ?
asked
Jun 19
in
Probability
by
suparna kar
(
12
points)

94
views
discrete_maths
expectation
0
votes
0
answers
Combinatorics Simple doubt
What is the difference between flipping a pair of Distinct dices and flipping a pair of Identical Dices ??
asked
Jun 18
in
Mathematical Logic
by
BHASHKAR
(
47
points)

10
views
discrete_maths
permutation&combination
#discrete_maths
#combinatory
0
votes
0
answers
Self doubt GRAPH THEORY
asked
May 31
in
Graph Theory
by
Abhipsa
(
27
points)

12
views
graphtheory
discretemathematics
#discrete_maths
discrete_maths
0
votes
1
answer
self doubt permutation and combination
asked
May 31
in
Combinatory
by
Abhipsa
(
27
points)

15
views
discrete_maths
permutationandcombination
0
votes
1
answer
P&C  self doubt
Find the number of arrangements of the letters of the word "INDEPENDENCE" if they start with "P" and end with "D"
asked
May 28
in
Combinatory
by
Abhipsa
(
27
points)

21
views
discretemathematics
permutationandcombination
discrete_maths
0
votes
0
answers
ISI Tomato Book
The value of $\sum \binom{k}{i} \binom{Mk}{100i} [(ki)/(M100)]/ \binom{M}{100}$, where M – k > 100, k > 100 and $\binom{m}{n}$= m!/{(m – n)!n!} equals (summation running from i = 0 to i = 100) (a) k/M (b) M/k (c)$k/M^{2}$ (d) $M/k^{2}$
asked
May 13
in
Combinatory
by
PSDesai09
(
6
points)

10
views
permutationandcombination
#combinatory
discrete_maths
0
votes
0
answers
Hamiltonian Graph
Consider the following Graphs: S1: Graph with vertices and each vertex has degree S2: Graph with 20 vertices such that for every 2 vertices Which of the following represents hamilton graph? (A). Only S1 (B). Only S2 (C). Both S1 and S2 (D). Neither S1 nor S2
asked
May 8
in
Graph Theory
by
Abhipsa
(
27
points)

5
views
graphtheory
discrete_maths
0
votes
0
answers
Matching Number
Please tell me what is the Independence Number Domination Number Matching Number Covering Number of the given graph in the picture. Does perfect matching exist in the given graph?
asked
May 7
in
Graph Theory
by
Abhipsa
(
27
points)

15
views
discrete_maths
graphtheory
+1
vote
0
answers
Havell Hakimi Algorithm  Graph Theory
The Havell Hakimi Algorithm Requires the sorting of the degree sequence and later marking and subtracting according to that order. Does this means that the vertex with the highest degree will always have an edge with the vertex with the second ... I have noticed that without sorting the algorithm doesn't give correct output so I think it is a necessary step)
asked
May 5
in
Mathematical Logic
by
nilotpola
(
7
points)

32
views
discrete_maths
graphtheory
graph
0
votes
0
answers
Discrete Mathematics  Set Theory
Can we say that total order relations are same as algebraic structure as in both the cases, we are enclosing the structures under some operation?
asked
May 4
in
Mathematical Logic
by
roh
(
17
points)

3
views
discrete_maths
#group
#discrete_maths
#relations
#totallyorderedrelations
0
votes
0
answers
Graph theory 3Ordered trees possible for a given no of nodes
asked
Apr 28
in
Graph Theory
by
ramcharantej_24
(
22
points)

7
views
trees
permutationandcombination
graphtheory
discrete_maths
graph
0
votes
0
answers
Number of perfect matching in Kn?
Find number of perfect matching in Kn where n is even? Please explain too?
asked
Apr 23
in
Graph Theory
by
darshansharma_
(
13
points)

4
views
discrete_maths
graphtheory
0
votes
0
answers
Why Euler circuit does not exist when number of odd degree vertices is 2
asked
Apr 23
in
Graph Theory
by
darshansharma_
(
13
points)

11
views
discrete_maths
graphtheory
#gatepreparation
0
votes
0
answers
What is the degree of region?
What is the degree of region r4? How you find it?
asked
Apr 22
in
Graph Theory
by
darshansharma_
(
13
points)

5
views
graphtheory
discrete_maths
0
votes
0
answers
TOMATO Ques 187
188. The number of ways in which 4 distinct balls can be put into 4 boxes labeled a, b, c, d so that exactly one box remains empty is: (a) 232 (b) 196 (c) 192 (d) 144
asked
Apr 8
in
Combinatory
by
neeraj_bhatt
(
286
points)

24
views
discrete_maths
permutationandcombination
0
votes
0
answers
ISI 2020 sample paper(pcb)
Let Kn denote the complete graph on n vertices, with n ≥ 3, and let u,v,w be three distinct vertices of Kn. Determine the number of distinct paths from u to v that do not contain the vertex w.
asked
Mar 24
in
Others
by
Dn0047
(
10
points)

10
views
discrete_maths
0
votes
0
answers
Made easy  Discrete mathematics
How many ways can 10 balls be chosen from a container having 10 identical green balls , 5 identical yellow balls and 3 identical blue balls
asked
Feb 17
in
Combinatory
by
Mitali gupta
(
6
points)

27
views
discrete_maths
#combinatory
0
votes
0
answers
Self Doubt combinatorics
Let X denote the number of ways of distributing 7 identical balls to 3 children such that each child gets at least one ball. Then the value of X is equal to _________. what should I be using here.. ($_{r}^{n1+r}\textrm{}$) or
asked
Feb 7
in
Combinatory
by
kalra05
(
73
points)

62
views
discrete_maths
+1
vote
1
answer
Virtual GATEFLT
How do we identity or inverse element here?Is option B) correct?
asked
Feb 4
in
Linear Algebra
by
srestha
(
755
points)

37
views
discrete_maths
0
votes
0
answers
Mathematics ME Test series
Ques: What is the number of partition of X = {a, b, c, d, e, f} where a and c are always in same block?  15  52  203  None of these
asked
Jan 29
in
Set Theory & Algebra
by
kashyap02
(
26
points)

21
views
discrete_maths
madeeasytestseries
0
votes
0
answers
Previous Go: Digraph
asked
Jan 28
in
Mathematical Logic
by
Debapaul
(
699
points)

14
views
discrete_maths
0
votes
0
answers
Made Easy test series graph theory
A graph G with n vertices is said to be a void graph if and only if there’s no edge between any pair of vertices belonging to G. Let X be a void graph on 2^k + 1 vertices. Then if it is known that the minimum number of edge insertions required in the best case in order to make it connected is equal to 512, then the value of k^1/2 is equal ...
asked
Jan 26
in
Graph Theory
by
Ram Swaroop
(
309
points)

36
views
madeeasytestseries
discrete_maths
graphtheory
0
votes
0
answers
Self Doubt: Previous GO: DM
Let the set of all natural numbers be N. Which of the following are countable sets? The set of all functions from N to {0,1} The set of all functions from {0,1} to N The largest subset of N I, II, and III I and II only ... previous year, but I am facing difficulty in understanding them and thereby answering such questions. Any suggestions will be of much help. Thank u..
asked
Jan 26
in
Compiler Design
by
Debapaul
(
699
points)

44
views
discrete_maths
0
votes
0
answers
SELF DOUBT: WELL ORDERED POSET
Can someone explain me in naive term what is a $well$ $ordered$ $poset$ and how it differs from $toset$?
asked
Jan 24
in
Mathematical Logic
by
Debapaul
(
699
points)

17
views
discrete_maths
0
votes
0
answers
Self Doubt: Previous GO Discrete Maths
Consider a binary function $g:P P→\{true,false\},$ where $P$ is a nonempty subset of the natural numbers that contains an even number of distinct elements. Which of the following statements can be true about $g$ ? $g$ is ... two equivalence classes $g$ defines a total order but not a partial order $g$ is reflexive and antisymmetric but not a surjection
asked
Jan 24
in
Set Theory & Algebra
by
Debapaul
(
699
points)

32
views
discrete_maths
0
votes
0
answers
Made Easy test series discrete mathematics group theory
asked
Jan 22
in
Set Theory & Algebra
by
Ram Swaroop
(
309
points)

31
views
madeeasytestseries
discrete_maths
#group
0
votes
1
answer
Self doubtful : Discrete Maths
Every Kn,n is Hamilton graph. True or False?
asked
Jan 21
in
Graph Theory
by
Chirag Shilwant
(
181
points)

22
views
discrete_maths
graphtheory
hamiltoniangraph
+1
vote
0
answers
Collinear points on a plane
Suppose 10 points are drawn on a plane such that exactly 4 of the points are collinear and among the remaining points no three points are collinear. How many distinct lines can be drawn by connecting any two among these 10 points?
asked
Jan 21
in
Combinatory
by
Akash Papnai
(
17
points)

30
views
discrete_maths
permutationandcombination
0
votes
1
answer
Self doubt graph theory Hamilton graph
graph G which has a cut edge cannot be Hamiltonian ?
asked
Jan 19
in
Graph Theory
by
Ram Swaroop
(
309
points)

67
views
graphtheory
discrete_maths
0
votes
1
answer
The maximum value of the minimum degree in connected planar bipartite graph is ____?
asked
Jan 18
in
Mathematical Logic
by
smosh
(
6
points)

80
views
discrete_maths
graphtheory
madeeasytestseries
gate
+2
votes
0
answers
MADE EASY TEST: BIPARTITE GRAPH
Maximum value of the minimum degree in a connected planar bipartite graph is ?
asked
Jan 12
in
Graph Theory
by
Debapaul
(
699
points)

135
views
madeeasytestseries
graphtheory
discrete_maths
0
votes
1
answer
ace test series mock test discretemaths
Q. 55.
asked
Jan 12
in
Mathematical Logic
by
Rahul Burman
(
21
points)

32
views
aceacademytestseries
discrete_maths
mathematicallogic
+1
vote
1
answer
Made Easy test series multiple subject graph theory
asked
Jan 9
in
Mathematical Logic
by
Ram Swaroop
(
309
points)

41
views
madeeasytestseries
discrete_maths
graphtheory
0
votes
0
answers
Made Easy test series multiple subject discrete mathematics combinatorics
asked
Jan 9
in
Mathematical Logic
by
Ram Swaroop
(
309
points)

13
views
madeeasytestseries
discrete_maths
permutationandcombination
#combinatory
0
votes
1
answer
Made Easy test series discrete mathematics combinatorics
asked
Jan 9
in
Mathematical Logic
by
Ram Swaroop
(
309
points)

73
views
madeeasytestseries
discrete_maths
permutationandcombination
#combinatory
0
votes
0
answers
Set Theory : Self doubt
Consider a set A ={} then which of the following is true. 1. A is irreflexive. 2. A is reflexive. 3. A is neither reflexive nor irreflexive.
asked
Jan 2
in
Set Theory & Algebra
by
Chirag Shilwant
(
181
points)

32
views
discrete_maths
settheory
emptyset
Page:
1
2
3
next »
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users
Jul 2020
Shaik Masthan
39 Points
hiteshpujari
9 Points
fazin
7 Points
divi2719
7 Points
srestha
7 Points
gaurav2697
6 Points
Venkatesh Akhouri
6 Points
Meghana518
6 Points
beastincarnate
6 Points
athenahermes
6 Points
7,565
questions
1,784
answers
10,872
comments
90,500
users