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

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Exams
Recent questions tagged discrete_maths
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)

4
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 16
in
Combinatory
by
Mitali gupta
(
6
points)

23
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)

43
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
(
683
points)

32
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)

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

12
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 25
in
Graph Theory
by
Ram Swaroop
(
305
points)

29
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 25
in
Compiler Design
by
Debapaul
(
699
points)

34
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)

16
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 23
in
Set Theory & Algebra
by
Debapaul
(
699
points)

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

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

21
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 20
in
Combinatory
by
Akash Papnai
(
17
points)

25
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
(
305
points)

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

55
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)

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

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

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

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

41
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
(
180
points)

32
views
discrete_maths
settheory
emptyset
0
votes
1
answer
Maths Matrices
For the following set of simultaneous equations 1.5x – 0.5y +z =2 4x + 2y + 3z =9 7x + y +5z =10 The solution is unique infinitely many solutions exist the equations are incompatible finite many solutions exist Anyone please clarify.
asked
Jan 1
in
Linear Algebra
by
Shivateja MST
(
113
points)

22
views
discrete_maths
engineeringmaths
discretemaths
0
votes
0
answers
Hasse Diagram Doubt
In case if we have edges in a Hasse Diagram what is significance of it? ANyone please clarify.
asked
Dec 31, 2019
in
Set Theory & Algebra
by
Shivateja MST
(
113
points)

17
views
discrete_maths
hassediagram
0
votes
0
answers
Mathematics Group Theory Abelian Group
If we consider a group (G,*) and consider two elements g and f that belongs to G then how can we define (g * f)^3? Is it like (g * f)(g * f )(g * f)? Anyone please clarify,
asked
Dec 31, 2019
in
Set Theory & Algebra
by
Shivateja MST
(
113
points)

20
views
discrete_maths
groups
engineeringmaths
0
votes
1
answer
Made Easy Test chromati number
The chromatic number of the graph is________________. I am getting $3$ by using the concept of independent sets but the answer given is $4$
asked
Dec 31, 2019
in
Mathematical Logic
by
CSHuB
(
16
points)

25
views
discrete_maths
chromatic
number
+1
vote
1
answer
Made Easy Test chromati number
The chromatic number of the graph is________________. I am getting $3$ by using the concept of independent sets but the answer given is $4$
asked
Dec 31, 2019
in
Mathematical Logic
by
CSHuB
(
16
points)

33
views
discrete_maths
chromatic
number
0
votes
0
answers
MadeEasy Demo Test Q30
asked
Dec 30, 2019
in
Combinatory
by
ssap09
(
42
points)

6
views
madeeasytestseries
#gatepreparation
discrete_maths
permutation&combination
0
votes
0
answers
Isomorphism self doubt
Whether 2 finite graph are isomorphic or not is a __________ problem (Assume P ! =NP) 1. NP Hard but not NpComplete 2. NpComplete 3. NP but not NpComplete 4. None of the above
asked
Dec 28, 2019
in
Graph Theory
by
Chirag Shilwant
(
180
points)

12
views
graphtheory
isomorphism
discrete_maths
computation
0
votes
1
answer
Made Easy test series discrete mathematics group
Assume g is an element of the group G. Consider the following conditions of g with e as identity element. $g^8 = e$ $g^2 \neq e$ Order of g is not 8. Find the order of g. Answer 4 how
asked
Dec 27, 2019
in
Set Theory & Algebra
by
Ram Swaroop
(
305
points)

18
views
madeeasytestseries
discrete_maths
#group
0
votes
0
answers
MathematicsSyllabus doubt
Is it necessary to read Convergence and Divergence and their related tests of Improper Integrals,Volume of solids of revolution,length of arc of a curve for GATE ? It seems there are no questions in these from past few years. Anyone please clarify.
asked
Dec 27, 2019
in
Calculus
by
Shivateja MST
(
113
points)

18
views
engineeringmaths
discrete_maths
0
votes
1
answer
Discrete Maths : Self Doubt
Is Set of all real numbers under division operation a poset ?
asked
Dec 26, 2019
in
Set Theory & Algebra
by
Debapaul
(
699
points)

30
views
discrete_maths
0
votes
0
answers
Discrete Maths: Maximum number of edges in connected components
asked
Dec 25, 2019
in
Graph Theory
by
Debapaul
(
699
points)

32
views
discrete_maths
0
votes
0
answers
Discrete Maths
What if I have a function "X" and it's inverse "Y" can I guaranteed say that the function X is bijective? Or in simple terms can I say inverse of a function exists if and only if it's bijective?
asked
Dec 24, 2019
in
Set Theory & Algebra
by
Peter Smith
(
7
points)

21
views
discretemaths
discrete_maths
engineeringmaths
0
votes
0
answers
Onto functions
The number of onto function possible from set A={1,2,3,4,5,6} to set B={a,b,c,d} Such that f(1)=a and f(2) is not b?
asked
Dec 23, 2019
in
Set Theory & Algebra
by
Peter Smith
(
7
points)

13
views
discrete_maths
engineeringmaths
functions
0
votes
2
answers
Maths Poisson Distribution
Vehicles arriving at an intersection from one of the approach roads follow the Poisson distribution. The mean rate of arrival is 900 vehicles per hour. If a gap is defined as the time difference between two successive vehicle arrivals (with vehicles ... the probability (up to four decimal places) that the gap is greater than 8 seconds is ___________ Anyone please clarify.
asked
Dec 14, 2019
in
Probability
by
Shivateja MST
(
113
points)

41
views
probability
discrete_maths
0
votes
0
answers
Maths Probability
A Set S has 20 elements.A Subset P of S is selected at random.After inspecting the elements the elements are put back in to S and then a subset Q is selected at random.Then the probability that P and Q are disjoint is _______ (1/3)^20 (1/2)^20 (2/3)^20 (3/4)^20 Anyone please clarify.
asked
Dec 13, 2019
in
Probability
by
Shivateja MST
(
113
points)

15
views
probability
discrete_maths
engineeringmaths
0
votes
0
answers
Maths Group theory
Let G= {a,b,c}.The incomplete composition table of the group (G,*) is given below. * a b c a __ __ __ b __ b __ c __ __ __ The last row of the composition table is ____ a c b b a c b c a c a b Anyone please explain how to solve such question since no conditions are given.
asked
Dec 9, 2019
in
Set Theory & Algebra
by
Shivateja MST
(
113
points)

6
views
discrete_maths
groups
0
votes
1
answer
Maths Group Theory
Let P(S) denote the power set of a non empty setS.A binary operation * is defined by A*B=(AB) U (BA). The set P(S) with respect to the binary operation * is______ a semigroup but not monoid a monoid but nota group a group not a semigroup Anyone please clarify I am getting d as the answer.
asked
Dec 9, 2019
in
Set Theory & Algebra
by
Shivateja MST
(
113
points)

21
views
discrete_maths
groups
0
votes
0
answers
Self doubt on counting
1.Number of Distributions of 5 books in 3 bookshelves such that each bookshelf get atleast 1 book 2.Number of Arrangement of 5 books in 3 bookshelves such that each bookshelf get atleast 1 book. I’m unable to understand the difference between Arrangements & Distributions. Can someone explain ?
asked
Dec 5, 2019
in
Combinatory
by
pranay562
(
926
points)

10
views
counting
discrete_maths
0
votes
0
answers
Graph Theory Complement of Graph
If a Graph G have n vertices and all but one of odd degree,then no. of vertices of odd degree in G’ is ____ Assume G is a simple connected graph. Anyone please clarify.
asked
Dec 2, 2019
in
Graph Theory
by
Shivateja MST
(
113
points)

13
views
graphtheory
engineeringmaths
discrete_maths
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
Apr 2020
Kushagra गुप्ता
36 Points
!KARAN
36 Points
Ram Swaroop
36 Points
sushmitagoswami
6 Points
ConnieSincla
5 Points
MelinaCundif
5 Points
Lolita04I641
5 Points
JackiBandy49
5 Points
skbansal97
5 Points
Rijusen
5 Points
3,522
questions
1,658
answers
10,465
comments
90,046
users