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 and answers in Discrete Mathematics
0
votes
0
answers
Gatebook test series
Why option B is not correct here ? B’coz he can be a politician as he thinks about politics.
asked
18 minutes
ago
in
Mathematical Logic
by
Raj_81
(
5
points)

1
view
0
votes
1
answer
Applied scholarship test
The number of straight lines that can be drawn through 90 points.Given that 10 of them lie on a straight line.
answered
1 day
ago
in
Combinatory
by
himanshu2021
(
123
points)

27
views
0
votes
1
answer
Applied Scholarship Test
A)1/16 B)1/15 C)1/4 D)NONE
answered
1 day
ago
in
Combinatory
by
himanshu2021
(
123
points)

15
views
0
votes
0
answers
Combinatorics and Propositional logic
Which book should i refer for Combinatorics and Propositional logic?
asked
Sep 22
in
Mathematical Logic
by
kaleen bhaiya
(
7
points)

14
views
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??
answered
Sep 19
in
Mathematical Logic
by
Ehraz Hasan
(
364
points)

48
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?
answered
Sep 18
in
Graph Theory
by
Shaik Masthan
(
1.4k
points)

28
views
discretemaths
graphtheory
0
votes
1
answer
Test Question of Applied Gate
Not able to solve this question. How to solve this type of questions?
answered
Sep 16
in
Combinatory
by
Ehraz Hasan
(
364
points)

23
views
combinatory
0
votes
3
answers
RosenChapter 8, Ex 8.5,Question 24
Find the probability that when a fair coin is flipped five times tails comes up exactly three times, the first and last flips come up tails, or the second and fourth flips come up heads.
answered
Sep 16
in
Combinatory
by
S.R.
(
433
points)

83
views
kennethrosen
discretemathematics
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
answered
Sep 16
in
Graph Theory
by
S.R.
(
433
points)

25
views
discretemaths
graphplanarity
graphtheory
selfdoubt
0
votes
0
answers
UGC NET 2016 as well as Discrete Maths Kenneth Rosen PAGE Pg 657 Q21
[closed]
asked
Sep 15
in
Set Theory & Algebra
by
S.R.
(
433
points)

17
views
kennethrosen
combinatory
0
votes
0
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
S.R.
(
433
points)

29
views
kennethrosen
combinatory
counting
discretemaths
0
votes
0
answers
Ace Academy Practise Book
The chromatic number of a star graph with n vertices (n≥ 2) is ________.
asked
Sep 11
in
Graph Theory
by
Vishal_kumar98
(
7
points)

12
views
0
votes
0
answers
Self doubt on Permutations and combination
If no three diagonals of a convex decagon meet at the same point inside the decagon, into how many line segments are the diagonals divided by their intersection?
asked
Sep 9
in
Combinatory
by
S.R.
(
433
points)

12
views
0
votes
0
answers
Self Doubt on Combinatorics
Why these 2 questions solved in different manner while it seems like both are same type questions?? Anyone Please.
asked
Sep 4
in
Combinatory
by
AbhayPrajapati
(
7
points)

20
views
combinatory
selfdoubt
maths
combinatory
0
votes
0
answers
self doubt o this question
How can you get like for 2 I’s (3!*4)/2! ?? I know i am asking such a basic question but i’m little bit confused that’s why i asking.
asked
Sep 4
in
Combinatory
by
AbhayPrajapati
(
7
points)

16
views
0
votes
1
answer
Self Doubt on Combinatorics
Is there any difference between these 2 questions?? If yes then how can we solve this???
answered
Sep 3
in
Combinatory
by
S.R.
(
433
points)

43
views
maths
selfdoubt
combinatory
0
votes
1
answer
Previous year question
The maximum number of edges in a bipartite graph on 12 vertices is _________. Please tell any generalized solution for this problem, if exists.
answered
Sep 2
in
Graph Theory
by
Sherrinford03
(
73
points)

17
views
graphtheory
previousyearquestion
maths
0
votes
1
answer
ACE Academy test series Question
Number of cycles of length 4 that are possible in the complete bipartite graph K(4,6) is
answered
Sep 2
in
Graph Theory
by
Scion_of_fire
(
47
points)

20
views
aceacademytestseries
engineeringmathematics
gatepreparation
gate
gate2021
0
votes
1
answer
Previous question paper
Construct a graph G with the following properties: edge connectivity of G =4, Vertex connectivity of G=3, and degree of every vertex of G >=5.
answered
Aug 31
in
Graph Theory
by
Nikhil_dhama
(
151
points)

24
views
graphtheory
gate
urgent
0
votes
1
answer
#Self_Doubt #Settheory #GATECSE2015
Suppose L={p,q,r,s,t}L={p,q,r,s,t} is a lattice represented by the following Hasse diagram: For any x,y∈Lx,y∈L, not necessarily distinct , x∨y and x∧y are join and meet of x,y respectively. Let L3={(x,y,z):x,y,z∈L} be the set of all ordered ... )∧(x∨z) for L1* and L2* respectively. Then (A) P1>P2 (B) P1<P2 (C) P1=P2 (D) none which one should be correct?
answered
Aug 27
in
Set Theory & Algebra
by
suvradip das
(
113
points)

23
views
0
votes
0
answers
DU MCA Entrance 2017
If A is a 3*3 Matrix with Eigenvalues 2 and 1 and the respective Eigenvectors (1 2 0) and (0 0 1), then the vectors A^3 (1 2 2) is equal to ; ( 8 16 6) (2 4 2) (8 16 1) (8 16 2)
asked
Aug 25
in
Set Theory & Algebra
by
Jatin99
(
5
points)

15
views
+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.
answered
Aug 25
in
Set Theory & Algebra
by
varsha394
(
11
points)

37
views
discretemaths
settheory&algebra
selfdoubt
0
votes
1
answer
Test series: GATE academy Logarithms question 2
answered
Aug 23
in
Mathematical Logic
by
g21
(
931
points)

31
views
engineeringmaths
engineeringmathematics
0
votes
1
answer
Test series: GATE academy Logarithms question 1
how to solve this?
[closed]
answered
Aug 23
in
Mathematical Logic
by
g21
(
931
points)

63
views
engineeringmathematics
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”
answered
Aug 21
in
Mathematical Logic
by
Ashutosh777
(
21
points)

28
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).
answered
Aug 20
in
Set Theory & Algebra
by
Arkaprava
(
625
points)

21
views
discretemaths
sets
0
votes
1
answer
Trees self doubt
S1: A tree with n vertices which has no vertices of degree 2 must have at least leaves S2: The number of trees on 5 labelled vertices is 125. Which of the following statements is true? (A). Only S1 (B). Only S2 (C). Only S1 and S2 (D). None of the above
answered
Aug 16
in
Graph Theory
by
jayeshasawa001
(
2.5k
points)

25
views
graph
trees
graphtheory
0
votes
1
answer
2a{n}=a{n1}+2pow(n)..........a[0]=1then a[100]=?
2a{n}=a{n1}+2pow(n)..........a[0]=1then a[100]=?
answered
Aug 16
in
Mathematical Logic
by
Arkaprava
(
625
points)

20
views
0
votes
1
answer
Set Practice Question
9) Let A = { a,b,c } and a relation on set A is defined as S = { (a,b) (b,c) (a,c) (c,c) (a,a) (b,a)} which of the following is true ? a) R Is equivalence relation b) R is Irreflexive relation ( or ) Antisymmetric c) R is Symmetric ( or ) ... but not (c,a). It's not asymmetric because it has a symmetric pair (a,b). False. (b,a), (a,b) present but not (b,b) Thank you.
answered
Aug 16
in
Mathematical Logic
by
Arkaprava
(
625
points)

24
views
sets
0
votes
1
answer
Calculus Estimating Errors
what is the solution ?
answered
Aug 16
in
Mathematical Logic
by
Arkaprava
(
625
points)

21
views
calculus
0
votes
1
answer
kenneth rosen(chapter 10 ,theorem 5) 7th edition
theorem: HALL’S MARRIAGE THEOREMThe bipartite graph G=(V,E) with bipartite (v1,v2) has a complete matching from v1 to v2 if and only if N(A)$\geq$A for all subsets of A of V1. explain with example
answered
Aug 16
in
Graph Theory
by
Arkaprava
(
625
points)

29
views
0
votes
1
answer
Kenneth rosen (7th edition) chapter 9
Let (S,R) be a poset.show that(S,$R^{1}$) is also a poset.where $R^{1}$ is the inverse of R.explain with example.
answered
Aug 16
in
Set Theory & Algebra
by
Arkaprava
(
625
points)

16
views
0
votes
1
answer
Discrete mathematics
Prove that a tree with more than 1vertex has atleast 2leaves
answered
Aug 16
in
Mathematical Logic
by
Arkaprava
(
625
points)

16
views
0
votes
1
answer
Find the coefficient of x^7 in the expansion of (1+3x2x^3)^10
answered
Aug 16
in
Mathematical Logic
by
Arkaprava
(
625
points)

22
views
0
votes
1
answer
Kenneth Rosen7th editionChapter 10/10.8
THE FOUR COLOR THEOREM: The chromatic number of a planar graph is no greater than four. Question #40 (10.8) : Show that every planar graph G can be colored using six or fewer colors. Question #41 (10.8) : Show that every planar graph G ... is already stated in the four color theorem that we don't require more than 4 colors in order to color a planar graph.
answered
Aug 16
in
Graph Theory
by
Arkaprava
(
625
points)

24
views
kennethrosen
graphtheory
0
votes
1
answer
Graph Theory with Applications to Engineering and Computer Science, Narsingh Deo, Chapter 4 Question 27
answered
Aug 16
in
Graph Theory
by
jayeshasawa001
(
2.5k
points)

30
views
discretemaths
graphtheory
graphisomorphism
0
votes
2
answers
Allan Career Institute: Discrete Math
Let $f\left ( x\right )$ be continuous probability density function of a random variable $X.$ Then probability of $a\leq X< b$ is $A)f\left ( b \right )f\left ( a \right )$ $B)f\left ( ab \right )$ $C)\int_{b}^{a}xf\left ( x \right )dx$ $D)\int_{b}^{a}f\left ( x \right )dx$ Plz give some link for probability of pdf
answered
Aug 16
in
Combinatory
by
jayeshasawa001
(
2.5k
points)

50
views
discretemaths
0
votes
1
answer
Group theory
How to tackle such proofs Prove that a group of order 9 is abelian.
answered
Aug 16
in
Mathematical Logic
by
Arkaprava
(
625
points)

27
views
grouptheory
theory
0
votes
1
answer
Let A=set of all +ve integers.Relation R is defined by aRb<>ab is divisible by 4.The equivalence class of 3 is
answered
Aug 16
in
Mathematical Logic
by
Arkaprava
(
625
points)

18
views
0
votes
1
answer
Self problems
Lim x>0 [ (cosx  cos(sinx))/x^4 ]= ?? Please!! tell me the best approach to solve this question
answered
Aug 16
in
Set Theory & Algebra
by
Arkaprava
(
625
points)

38
views
To see more, click for all the
questions in this category
.
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
2020 Sep 28  Oct 04
sankalpmittal
4 Points
Ashutosh777
4 Points
srestha
4 Points
Weekly Top User (excluding moderators) will get free access to
GATE Overflow Test Series for GATE 2021
Recent Posts
Guidelines to users
No Recent Blog Comments
Recent questions and answers in Discrete Mathematics
8,258
questions
2,617
answers
12,859
comments
95,303
users