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
Blogs
Previous Year
Exams
Recent questions tagged discretemaths
0
votes
1
answer
BS Gerewal engineering mathematics
hey guys, what is meant by the statement “cards are drawn in succession” . does it means whether one by one the cards were drawn OR all the cards were drawn at once any help is really appreciated….
asked
2 days
ago
in
Probability
by
rish1602
(
5
points)

10
views
discretemaths
combinatory
counting
0
votes
0
answers
Gatebook function
How to solve this type of question ?
asked
Oct 2
in
Set Theory & Algebra
by
Raj_81
(
7
points)

15
views
discretemaths
functions
0
votes
1
answer
NPTEL DISCRETE STRUCTURE ASSIGNMENT QUESTION
Which of the following are logical consequences of { ($\alpha$ → $\beta$’), $\beta$, ($\gamma$ ’ → $\alpha$) } ($\alpha$ → $\beta$’) $\beta$’ $\gamma$ $\alpha$ Answer given is C but if this question asked as MSQ question then can A be the possible answer??
asked
Sep 19
in
Mathematical Logic
by
Akanksha Agrawal
(
309
points)

59
views
discretemaths
0
votes
1
answer
Self doubt  Graph Connectivity (NPTEL & PY)
Let G be a graph with n vertices and if every vertex has a degree of at least $\frac{n−1}{2}$ then G is connected. Source : https://gateoverflow.in/1221/gate200723 Let G be a graph with n vertices and if every vertex has a degree of at ... then G is connected. source : https://nptel.ac.in/courses/106/106/106106183/ My doubt : Which one is right?
asked
Sep 17
in
Graph Theory
by
KUSHAGRA गुप्ता
(
1.4k
points)

35
views
discretemaths
graphtheory
0
votes
1
answer
Self Doubt  Planar graph (PY)
$K_5$ is nonplanar. I am showing you my proof. Please tell me whether this is the right way or not to prove that $K_5$ is nonplanar. $\sum$ (deg)$=4+4+4+4+4=20$ $e=10$ and $n=5$ Assume $K_5$ is planar. $ve+r=2$ ... $K_5$ is nonplanar. If this is the right way, why this method didn't work in this graph. Source: https://gateoverflow.in/87129/gate19903vi
asked
Sep 15
in
Graph Theory
by
KUSHAGRA गुप्ता
(
1.4k
points)

28
views
discretemaths
graphplanarity
graphtheory
selfdoubt
0
votes
2
answers
KENNETH ROSEN DISCRETE MATHEMATICS PAGE 432 Q11
How many ways are there to chose eight coins from piggy bank containing 100 identical pennies and 80 identical nickels.
asked
Sep 14
in
Combinatory
by
Shashank Rustagi
(
519
points)

51
views
kennethrosen
combinatory
counting
discretemaths
+1
vote
1
answer
LATTICE ASSOCIATIVITY DOUBT
I wasn't convinced about the associativity property of lattices, and the proof i found on math.stackexchange seemed reasonable, but still i couldnt wrap my head around it. I tried to make a counter example, and in the above diagram (b join c) ... otherwise it would've satisfied associativity. But i cant seem to figure out why this diagram isn't a lattice. Please help.
asked
Aug 22
in
Set Theory & Algebra
by
rish18
(
9
points)

47
views
discretemaths
settheory&algebra
selfdoubt
0
votes
3
answers
Self Doubt in Propositional Logic
Translate this English proposition to Logical expression : “you will not get an A grade unless you work hard”
asked
Aug 21
in
Mathematical Logic
by
AbhayPrajapati
(
7
points)

30
views
propositionallogic
logic
discretemaths
0
votes
1
answer
ISI CSB 2018
State, with justification, which of the following expressions f, g and h, define valid realvalued functions over the set of positive rational numbers. We denote a rational number by m/n, where m and n are positive integers. (a) f(m/n) = 2^m − 2^n. (b) g(m/n) = log m − log n. (c) h(m/n) = (m^2 − n^2)/(mn).
asked
Aug 20
in
Set Theory & Algebra
by
suparna kar
(
9
points)

25
views
discretemaths
sets
+1
vote
1
answer
K Rosen(7th ed). Chapter 6. Exercise 6.4. Q.17.
Question: Answer 1: Answer 2: I am not able to understand the solution.What’s happening here? Please help.
asked
Aug 13
in
Combinatory
by
RasMalai
(
27
points)

27
views
kennethrosen
combinatory
counting
discretemaths
0
votes
2
answers
SelfDoubt 10 couple, { 10 men and 10 women }, Number of Ways
asked
Aug 12
in
Combinatory
by
mamtuj
(
25
points)

50
views
selfdoubt
discretemaths
permutation&combination
0
votes
1
answer
ISI CSB 2018
Given A = {1, 2, 3, .... , 70}, show that for any six elements a1, a2, a3, a4, a5 and a6 belonging to A, there exists one pair ai and aj for which ai − aj ≤ 14 (i not equals to j).
asked
Aug 11
in
Set Theory & Algebra
by
suparna kar
(
9
points)

21
views
discretemaths
0
votes
1
answer
Combinatorics and Probability
Six people, including A,B, and C, form a queue in a random order (all 6! orderings are equiprobable). Consider the event "B is between A and C in the queue". What is its probability? (The order of A and C can be arbitrary, but B should be between them).
asked
Aug 5
in
Probability
by
aryashah2k
(
2
points)

19
views
permutation&combination
conditionalprobability
discretemaths
probability
combinatory
0
votes
2
answers
Combinatorics and Probability
Six people including A,B, and C, form a queue in a random order (all 6! orderings are equiprobable). Consider the event "A precedes B in the queue". (Again this event does not mention C or other people in the queue. It happens when A is ... not require that B is the next after A, some people could be between A and B.) What is the probability of this event?
asked
Aug 5
in
Probability
by
aryashah2k
(
2
points)

153
views
conditionalprobability
permutation&combination
discretemaths
probability
0
votes
1
answer
Self Doubt : Lattice
$\left \{ 1,2,3,24,30 \right \}$ is it a lattice? I think this poset has no lub as $24$ and $30$ are not comparable. Am I right?
asked
Jul 20
in
Set Theory & Algebra
by
srestha
(
1k
points)

59
views
lattice
discretemaths
0
votes
1
answer
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
Jul 10
in
Set Theory & Algebra
by
srestha
(
1k
points)

62
views
discretemaths
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
(
5
points)

14
views
discretemaths
probability
poissondistribution
binomialdistribution
0
votes
1
answer
Graph Theory with Applications to Engineering and Computer Science, Narsingh Deo, Chapter 4 Question 27
asked
Jun 23
in
Graph Theory
by
dararirum
(
5
points)

34
views
discretemaths
graphtheory
graphisomorphism
0
votes
1
answer
Graph Theory with Applications to Engineering and Computer Science, Narsingh Deo, Chapter 2 Question 21
asked
Jun 23
in
Others
by
dararirum
(
5
points)

21
views
discretemaths
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
(
9
points)

132
views
discretemaths
expectation
0
votes
1
answer
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
(
73
points)

20
views
discretemaths
permutation&combination
discretemaths
combinatory
0
votes
1
answer
Self doubt GRAPH THEORY
asked
May 31
in
Graph Theory
by
Abhipsa
(
5
points)

29
views
graphtheory
discretemathematics
discretemaths
discretemaths
0
votes
1
answer
self doubt permutation and combination
asked
May 31
in
Combinatory
by
Abhipsa
(
5
points)

18
views
discretemaths
combinatory
0
votes
1
answer
Self Doubt recurrence equation
asked
May 31
in
Combinatory
by
Abhipsa
(
5
points)

25
views
discretemaths
combinatory
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 27
in
Combinatory
by
Abhipsa
(
5
points)

23
views
discretemathematics
combinatory
discretemaths
0
votes
0
answers
Kenneth Rosen 7th edition chapter 1.5 Exercise 12
Let I(x)be the statement x has an Internet connection and C(x,y) be the statement x and y have chatted over the Internet, where the domain for the variables x and y consists of all students in your class. Use quantiﬁers ... to ask what will be the answer if statement means there are exactly two students who have not chatted with each other .
asked
May 27
in
Mathematical Logic
by
ayush.5
(
71
points)

13
views
kennethrosen
discretemaths
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
(
5
points)

19
views
combinatory
combinatory
discretemaths
0
votes
1
answer
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
(
5
points)

14
views
graphtheory
discretemaths
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
(
5
points)

26
views
discretemaths
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 4
in
Mathematical Logic
by
nilotpola
(
9
points)

53
views
discretemaths
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
(
9
points)

9
views
discretemaths
grouptheory
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
(
13
points)

19
views
trees
combinatory
graphtheory
discretemaths
graph
0
votes
1
answer
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_
(
5
points)

17
views
discretemaths
graphtheory
0
votes
1
answer
Why Euler circuit does not exist when number of odd degree vertices is 2
asked
Apr 23
in
Graph Theory
by
darshansharma_
(
5
points)

32
views
discretemaths
graphtheory
gatepreparation
0
votes
1
answer
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_
(
5
points)

11
views
graphtheory
discretemaths
0
votes
1
answer
Proof of Euler equation
Euler equation is  V +R = E + 2 Can someone please show me how to come to above conclusion?
asked
Apr 22
in
Graph Theory
by
darshansharma_
(
5
points)

23
views
discretemaths
graphtheory
0
votes
0
answers
least upper bound and greatest lower bound
what are the greatest lower bound (glb) and the least upper bound (lub) of the sets a = {3, 9, 12} and b = {1, 2, 4, 5, 10} if they exist in Poset (z*,/)?
asked
Apr 19
in
Set Theory & Algebra
by
Shivshankar
(
5
points)

26
views
discretemaths
settheory
ugcnet2019
hassediagram
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
(
475
points)

29
views
discretemaths
combinatory
0
votes
1
answer
#discrete mathematics #exponential generating function
asked
Apr 2
in
Combinatory
by
souren
(
9
points)

14
views
discretemaths
kennethrosen
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
(
5
points)

25
views
discretemaths
Page:
1
2
3
4
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.
Recent Posts
New GATEOverflow PDFs
Guidelines to users
Recent Blog Comments
Thanks, Can you tell me till when this might get...
8,446
questions
2,720
answers
13,274
comments
95,468
users