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
Recent questions in Discrete Mathematics
1
votes
1
answer
5181
ME-FST-Q21
KISHALAY DAS
384
views
KISHALAY DAS
asked
Nov 13, 2016
0
votes
0
answers
5182
ME-FST-Q16
KISHALAY DAS
230
views
KISHALAY DAS
asked
Nov 13, 2016
0
votes
0
answers
5183
Discrete Math-Group Theory
KISHALAY DAS
938
views
KISHALAY DAS
asked
Nov 12, 2016
0
votes
0
answers
5184
HOW MANY NONISOMORPHIC ROOTED TREES ARE THERE WITH 3 VERTICES(use isomporphism for directed graphs)
santhoshdevulapally
497
views
santhoshdevulapally
asked
Nov 12, 2016
0
votes
0
answers
5185
HOW MANY NONISOMORPHIC UNROOTED TREES ARE THERE WITH 3 VERICES
santhoshdevulapally
414
views
santhoshdevulapally
asked
Nov 12, 2016
0
votes
1
answer
5186
ACE practice booklet vol-2 chapter-3, Q.8
If a tree T with n vertices is isomorphic to T bar (complement) then n =?
If a tree T with n vertices is isomorphic to T bar (complement) then n =?
Devasish Ghosh
355
views
Devasish Ghosh
asked
Nov 12, 2016
Graph Theory
graph-theory
engineering-mathematics
+
–
0
votes
0
answers
5187
GATE practice booklet - ACE engineering publication, chatper 3 q.7
how many simple non isomorphic graphs are possible with 9 vertices, 9 edges and degree of each vertex is 2?
how many simple non isomorphic graphs are possible with 9 vertices, 9 edges and degree of each vertex is 2?
Devasish Ghosh
285
views
Devasish Ghosh
asked
Nov 12, 2016
Graph Theory
graph-theory
engineering-mathematics
+
–
0
votes
1
answer
5188
doubt in propositional logic
can someone explain NULL QUANTIFICATION in depth??
can someone explain NULL QUANTIFICATION in depth??
sushmita
307
views
sushmita
asked
Nov 11, 2016
1
votes
0
answers
5189
how many ways can Harry select 24 of these candies so that he has at least six black one
If there is an unlimited number of red, green, blue and black jelly beans in how many ways can Harry select 24 of these candies so that he has at least six black one? _________.
If there is an unlimited number of red, green, blue and black jelly beans in how many ways can Harry select 24 of these candies so that he has at least six black one? ___...
Akriti sood
488
views
Akriti sood
asked
Nov 11, 2016
Combinatory
combinatory
+
–
3
votes
1
answer
5190
Discrete Maths
Messages are transmitted through a communication channel using two signals. The transmission of one signal requires $1 $ microsecond, the transmission of other signal requires $2$ microseconds. Assume that each signal in a message is immediately followed by the next signal. The ... of sequences of these two signals that can be sent in $10 \mu s$ is _________ ? Please explain ...?
Messages are transmitted through a communication channel using two signals. The transmission of one signal requires $1 $ microsecond, the transmission of other signal req...
Prajwal Bhat
2.7k
views
Prajwal Bhat
asked
Nov 11, 2016
Combinatory
fibonacci-sequence-application
combinatory
+
–
2
votes
2
answers
5191
GATE CSE 1987 | Question: 2f
State whether the following statements are TRUE or FALSE: Every infinite cyclic group is isomorphic to the infinite cyclic group of integers under addition.
State whether the following statements are TRUE or FALSE:Every infinite cyclic group is isomorphic to the infinite cyclic group of integers under addition.
makhdoom ghaya
934
views
makhdoom ghaya
asked
Nov 9, 2016
Graph Theory
gate1987
graph-theory
graph-isomorphism
true-false
out-of-gate-syllabus
+
–
4
votes
1
answer
5192
GATE CSE 1987 | Question: 2e
State whether the following statement is TRUE or FALSE: There is a linear-time algorithm for testing the planarity of finite graphs.
State whether the following statement is TRUE or FALSE:There is a linear-time algorithm for testing the planarity of finite graphs.
makhdoom ghaya
1.4k
views
makhdoom ghaya
asked
Nov 9, 2016
Graph Theory
gate1987
graph-theory
graph-planarity
true-false
+
–
22
votes
4
answers
5193
GATE CSE 1987 | Question: 2d
State whether the following statements are TRUE or FALSE: The union of two equivalence relations is also an equivalence relation.
State whether the following statements are TRUE or FALSE:The union of two equivalence relations is also an equivalence relation.
makhdoom ghaya
5.6k
views
makhdoom ghaya
asked
Nov 9, 2016
Set Theory & Algebra
gate1987
set-theory&algebra
relations
true-false
+
–
2
votes
1
answer
5194
prepositional logic
when ∀xP(x) --> Q(x) is given does it mean (∀xP(x)) --> Q(x) or it means ∀x(P(x) --> Q(x))? in short precedence of quantifiers is greater or implies is greater?
when ∀xP(x) Q(x) is givendoes it mean (∀xP(x)) Q(x) or it means ∀x(P(x) Q(x))?in short precedence of quantifiers is greater or implies is greater?
Anusha Motamarri
420
views
Anusha Motamarri
asked
Nov 7, 2016
Mathematical Logic
mathematical-logic
first-order-logic
+
–
1
votes
1
answer
5195
There are 10 bacteria in a flask. Every hour 3 bacteria die and the remaining ones are each divided into 2 after 1 day
There are 10 bacteria in a flask. Every hour 3 bacteria die and the remaining ones are each divided into 2 after 1 day, how many bacteria will live there?Assume that the ...
Akriti sood
615
views
Akriti sood
asked
Nov 7, 2016
Combinatory
combinatory
counting
+
–
3
votes
1
answer
5196
Combinatory
In a country, there are coins of denominations ${$2}$, ${$3}$ and ${$7}$. How many different ways are there to pay exactly ${$10}$ ?
In a country, there are coins of denominations ${$2}$, ${$3}$ and ${$7}$. How many different ways are there to pay exactly ${$10}$ ?
Akriti sood
663
views
Akriti sood
asked
Nov 7, 2016
Combinatory
combinatory
+
–
3
votes
2
answers
5197
A palindrome is a string whose reversal is identical to the string. How many bit strings of length n are palindromes?
A palindrome is a string whose reversal is identical to the string. How many bit strings of length n are palindromes? 2⌈n⁄2⌉ 2(⌊ n/2⌋ ) 2⌈n⁄2⌉ -1 2(�...
Akriti sood
6.8k
views
Akriti sood
asked
Nov 7, 2016
Combinatory
counting
combinatory
+
–
5
votes
2
answers
5198
permutation combo
In how many ways can seven different jobs be assigned to 4 different employees so that each employee is assigned at least one job and the most difficult job is assigned to the best employee?
In how many ways can seven different jobs be assigned to 4 different employees so that each employee is assigned at least one job and the most difficult job is assigned t...
Akriti sood
3.5k
views
Akriti sood
asked
Nov 7, 2016
Combinatory
combinatory
+
–
1
votes
1
answer
5199
ME-Practice Book Discrete Math Q#19
KISHALAY DAS
563
views
KISHALAY DAS
asked
Nov 5, 2016
1
votes
1
answer
5200
ME-Practice Book Discrete Math Q#49
KISHALAY DAS
502
views
KISHALAY DAS
asked
Nov 5, 2016
Page:
« prev
1
...
255
256
257
258
259
260
261
262
263
264
265
...
357
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register