Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Highest voted questions in Discrete Mathematics
1
votes
1
answer
2551
Narsingh Deo Problem 2-28
ankitgupta.1729
1.2k
views
ankitgupta.1729
asked
Apr 15, 2018
Graph Theory
graph-theory
narsingh
deo
+
–
1
votes
2
answers
2552
Show that the two graphs are isomorphic (Narsingh Deo)
Show that the two graphs are isomorphic
Show that the two graphs are isomorphic
Mk Utkarsh
5.6k
views
Mk Utkarsh
asked
Apr 15, 2018
Graph Theory
graph-theory
narsingh
deo
graph-isomorphism
+
–
1
votes
1
answer
2553
Graph Theory
Let G be a simple graph in which every vertex has degree 3. Prove that G decomposes into claws iff G is bipartite.
Let G be a simple graph in which every vertex has degree 3. Prove that G decomposes into claws iff G is bipartite.
Sammohan Ganguly
340
views
Sammohan Ganguly
asked
Apr 15, 2018
Graph Theory
graph-theory
discrete-mathematics
+
–
1
votes
1
answer
2554
Testbook Test Series: Combinatory - Permutations And Combinations
NUMBER OF WAYS WE CAN ARRAYS LETTERS OF THE WORD "TESTBOOK" SO THAT NO TWO VOWELS ARE TOGETHER IS
NUMBER OF WAYS WE CAN ARRAYS LETTERS OF THE WORD "TESTBOOK" SO THAT NO TWO VOWELS ARE TOGETHER IS
Ismail
848
views
Ismail
asked
Apr 13, 2018
Combinatory
testbook-test-series
combinatory
discrete-mathematics
+
–
1
votes
0
answers
2555
Permutation of 4 Gs out of 5 Gs
Given symbols:- $GGGGGAAATTTECCS$ No of ways such that exactly 4 Gs out of 5 Gs are together. I am getting$ \frac{11! × 11}{3!×3!×2!} $. Some one verify it?
Given symbols:- $GGGGGAAATTTECCS$No of ways such that exactly 4 Gs out of 5 Gs are together. I am getting$ \frac{11! × 11}{3!×3!×2!} $.Some one verify it?
Jason
655
views
Jason
asked
Apr 12, 2018
Combinatory
combinatory
engineering-mathematics
+
–
1
votes
1
answer
2556
Kenneth Rosen Edition 6th Exercise 6.4 Question 33 (Page No. 442)
Use generating function to solve the recurrence relation $a_k=3{a_{k-1}} + 2$ with initial conditions $a_0=1 $.
Use generating function to solve the recurrence relation $a_k=3{a_{k-1}} + 2$ with initial conditions $a_0=1 $.
Abhinavg
3.3k
views
Abhinavg
asked
Apr 12, 2018
Combinatory
kenneth-rosen
discrete-mathematics
generating-functions
+
–
1
votes
0
answers
2557
ISI-SAMPLE-2014-22
jjayantamahata
147
views
jjayantamahata
asked
Apr 11, 2018
1
votes
0
answers
2558
Propositional Logic
Number of nonequivalent propositional functions ( different truth tables ) possible with 'n' atomic propositions is ? and explain also a) $2^n$ b) $n^2$ c) 2^2^n (means 2 raise to power 2 raise to power n) d) 2^n^2
Number of nonequivalent propositional functions ( different truth tables ) possible with 'n' atomic propositions is ? and explain alsoa) $2^n$b) $n^2$c) 2^2^n (means 2 ...
Siddharth Bhardawaj
1.1k
views
Siddharth Bhardawaj
asked
Apr 10, 2018
1
votes
1
answer
2559
Graph Book
The maximum number of edges in a n-node undirected graph WITH self-loops is?
The maximum number of edges in a n-node undirected graph WITH self-loops is?
targate2018
1.2k
views
targate2018
asked
Apr 7, 2018
Graph Theory
graph-theory
graph-connectivity
+
–
1
votes
1
answer
2560
Kenneth Rosen Edition 6th Exercise 8.7 Question 25 (Page No. 610)
How to Find Whether Given Graph is NonPlanar using Kuratwoski's Theorem ?
How to Find Whether Given Graph is NonPlanar using Kuratwoski's Theorem ?
Sayed Athar
749
views
Sayed Athar
asked
Apr 6, 2018
Graph Theory
kenneth-rosen
discrete-mathematics
graph-theory
+
–
1
votes
1
answer
2561
Graph Theory
Consider the following undirected graph with some edge costs missing. Suppose the wavy edges form a Minimum Cost Spanning Tree for $G$. Then, which of the following inequalities NEED NOT hold? $cost(a,b)\geq 6$. $cost(b,e)\geq 5$. $cost(e,f)\geq 5$. $cost(a,d)\geq 4$. $cost(b,c)\geq 4$. Please someone solve and explain :)
Consider the following undirected graph with some edge costs missing.Suppose the wavy edges form a Minimum Cost Spanning Tree for $G$. Then, which of the following inequa...
gauravkc
634
views
gauravkc
asked
Apr 6, 2018
Graph Theory
graph-theory
discrete-mathematics
graph-connectivity
+
–
1
votes
2
answers
2562
Graph Theory
Can someone solve this? Also please attempt this question on Algorithms time complexity if interested :) https://gateoverflow.in/210836/algorithms-time-complexity
Can someone solve this?Also please attempt this question on Algorithms time complexity if interested :)https://gateoverflow.in/210836/algorithms-time-complexity
gauravkc
1.2k
views
gauravkc
asked
Apr 5, 2018
Graph Theory
graph-theory
discrete-mathematics
graph-connectivity
+
–
1
votes
1
answer
2563
Permutations
shivanisrivarshini
553
views
shivanisrivarshini
asked
Apr 4, 2018
Combinatory
combinatory
isisamplepapers
+
–
1
votes
1
answer
2564
Indistinguishable objects and Indistinguishable boxes
Can please anybody explain how to solve the case for indistinguishable objects and indistinguishable boxes. Ques. How many ways are there to pack six copies of the same book into four identical boxes,where a box can contain as many as ... it's equivalent of writing n as the sum of at most k positive integers in non increasing order. How??
Can please anybody explain how to solve the case for indistinguishable objects and indistinguishable boxes.Ques. How many ways are there to pack six copies of the same bo...
Na462
1.8k
views
Na462
asked
Apr 4, 2018
Combinatory
combinatory
+
–
1
votes
2
answers
2565
counting
Using the letters PQRST , without repetition , how many 4 letters strings can be formed that, 1) start or end with P.. 2) start with either P or Q. 3) start with Q or end with T. 4) contain the letter R.. 5) don't have the letter P. 6) contain S and T.
Using the letters PQRST , without repetition , how many 4 letters strings can be formed that,1) start or end with P..2) start with either P or Q.3) start with Q or end wi...
saurabh rai
405
views
saurabh rai
asked
Apr 4, 2018
Mathematical Logic
counting
combinatory
+
–
1
votes
2
answers
2566
Kenneth Rosen , Recurrence relation, Exercise 6.1 Qno. - 19
A vending machine dispensing books of stamps accepts only dollar coins, $1 bills,and $5 bills. a) Find a recurrence relation for the number of ways to deposit n dollars in the vending machine, where the order in which the coins ... 10 for a book of stamps ? Plz tell how to approach this question and solve especially with the Bold part.
A vending machine dispensing books of stamps accepts only dollar coins, $1 bills,and $5 bills.a) Find a recurrence relation for the number of ways to deposit n dollars in...
Abhinavg
3.9k
views
Abhinavg
asked
Apr 2, 2018
1
votes
1
answer
2567
#test series
himgta
263
views
himgta
asked
Apr 1, 2018
Mathematical Logic
mathematical-logic
+
–
1
votes
3
answers
2568
ISI-2016-02
How many complex numbers $z$ are there such that $\mid z+1 \mid = \mid z+i \mid$ and $\mid z \mid = 5$ ? $0$ $1$ $2$ $3$
How many complex numbers $z$ are there such that $\mid z+1 \mid = \mid z+i \mid$ and $\mid z \mid = 5$ ?$0$$1$$2$$3$
jjayantamahata
383
views
jjayantamahata
asked
Mar 30, 2018
Mathematical Logic
engineering-mathematics
complex-number
+
–
1
votes
1
answer
2569
ISI-2017-23
What is the smallest degree of a polynomial with real coefficients and having roots $2\omega, 2+3\omega, 2{\omega}^2, -1-3\omega \text{ and } 2-\omega-{\omega}^2$? [Here $\omega \neq 1$ is a cube root of unity.] $5$ $7$ $9$ $10$
What is the smallest degree of a polynomial with real coefficients and having roots $2\omega, 2+3\omega, 2{\omega}^2, -1-3\omega \text{ and } 2-\omega-{\omega}^2$?[Here $...
jjayantamahata
981
views
jjayantamahata
asked
Mar 28, 2018
1
votes
2
answers
2570
ISI-2017-6
In a class of $80$ students, $40$ are girls and $40$ are boys. Also, exactly $50$ students wear glasses. Then the set of all possible number of boys without glasses is $\{0,.....,30\}$ $\{10,....,30\}$ $\{0,.....,40\}$ $\text{none of these}$
In a class of $80$ students, $40$ are girls and $40$ are boys. Also, exactly $50$ students wear glasses. Then the set of all possible number of boys without glasses is$\{...
jjayantamahata
1.5k
views
jjayantamahata
asked
Mar 26, 2018
Page:
« prev
1
...
123
124
125
126
127
128
129
130
131
132
133
...
357
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register