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
5781
graph
Assume G is connected planar graph that has 14 vertices and 20 regions . All interior regions are bounded by a cycle of length 3(i.e. 3 edges). The no of edges bounded the interior region is ?
Assume G is connected planar graph that has 14 vertices and 20 regions . All interior regions are bounded by a cycle of length 3(i.e. 3 edges). The no of edges bounded t...
Jhunjhunuwala
882
views
Jhunjhunuwala
asked
Jan 28, 2016
0
votes
1
answer
5782
Even number
How many 4 digit even number are possible with each digit distinct ?
How many 4 digit even number are possible with each digit distinct ?
Banti Arya
418
views
Banti Arya
asked
Jan 28, 2016
Combinatory
engineering-mathematics
+
–
0
votes
1
answer
5783
MadeEasy Test Series: Combinatory - Permutations And Combinations
Number of solutions are there of x+y+z=17 in positive integers are_________ Here in this do we have to take constraints of x>=1,y>=1,z>=1?
Number of solutions are there of x+y+z=17 in positive integers are_________Here in this do we have to take constraints of x>=1,y>=1,z>=1?
UK
965
views
UK
asked
Jan 28, 2016
Combinatory
made-easy-test-series
engineering-mathematics
discrete-mathematics
combinatory
+
–
17
votes
1
answer
5784
Haming Distance and Chromatic Number
Consider the undirected graph G defined as follows. The vertices are bit string of length 5. We have an edge between vertex “a” and vertex “b” iff “a” and “b” differ only in one bit possible (i.e., hamming distance1). What is the ratio of chromatic number of G to the diameter of G? Model Question : https://gateoverflow.in/3564/gate2006-it_25
Consider the undirected graph G defined as follows. The vertices are bit string of length 5. We have an edge between vertex “a” and vertex “b” iff “a” and “...
pC
2.4k
views
pC
asked
Jan 28, 2016
Graph Theory
engineering-mathematics
algorithms
graph-coloring
+
–
1
votes
1
answer
5785
palindrome
How many seven length palindrome possible using English alphabet.?
How many seven length palindrome possible using English alphabet.?
Banti Arya
871
views
Banti Arya
asked
Jan 27, 2016
1
votes
1
answer
5786
Permutation n combination
what is the correct solution to this question??
what is the correct solution to this question??
UK
364
views
UK
asked
Jan 27, 2016
Combinatory
combinatory
engineering-mathematics
+
–
0
votes
1
answer
5787
In how many ways can 2n+1 seats in a congress be divided among 3 parties ?
In how many ways can $2n+1$ seats in a congress be divided among 3 parties so that coalition of any 2 parties will ensure them majority?
In how many ways can $2n+1$ seats in a congress be divided among 3 parties so that coalition of any 2 parties will ensure them majority?
radha gogia
1.2k
views
radha gogia
asked
Jan 27, 2016
Combinatory
combinatory
counting
+
–
6
votes
3
answers
5788
Virtual Gate Test Series: Discrete Mathematics - Graph Theory (Matching Number)
Find the matching number for the given graph-
Find the matching number for the given graph-
learncp
932
views
learncp
asked
Jan 26, 2016
Graph Theory
discrete-mathematics
graph-theory
graph-matching
virtual-gate-test-series
+
–
9
votes
2
answers
5789
MadeEasy Test Series: Mathematical Logic - First Order Logic
Match the following Lists List-I A. There are atmost two apples. B. There are exactly two apples. C. There is atmost one apple. D. There is exactly one apple. List-II 1. ... D (a) 1 2 3 4 (b) 3 2 1 4 (c) 1 3 2 4 (d) 3 1 2 4 $a$ $b$ $c$ $d$
Match the following ListsList-IA. There are atmost two apples.B. There are exactly two apples.C. There is atmost one apple.D. There is exactly one apple.List-II1. $\foral...
vikas khuswaha
1.5k
views
vikas khuswaha
asked
Jan 26, 2016
Mathematical Logic
made-easy-test-series
engineering-mathematics
discrete-mathematics
mathematical-logic
first-order-logic
+
–
1
votes
1
answer
5790
Made easy
saurav04
663
views
saurav04
asked
Jan 26, 2016
Graph Theory
graph-theory
+
–
3
votes
2
answers
5791
Logic
Which of the following are true? ∃x(P(x)->Q(x)) ->(∀xP(x)->∀xQ(x)) ∃xP(x)->∀x Q(x) ->∀x(P(x)->Q(x))
Which of the following are true?∃x(P(x)->Q(x)) ->(∀xP(x)->∀xQ(x))∃xP(x)->∀x Q(x) ->∀x(P(x)->Q(x))
Pooja Palod
800
views
Pooja Palod
asked
Jan 25, 2016
Mathematical Logic
first-order-logic
mathematical-logic
+
–
5
votes
2
answers
5792
PREDICATE LOGIC
Recall that a predicate logic statement is contingent if its truth value depends on the choice of the universe and on the interpretations of the predicate symbol $S$ and the constant symbol $b$ involved. Consider the following predicate logic statements in ... . Always true - Contingent - Always false. Always true - Contingent - Contingent. Contingent - Always true - Always false.
Recall that a predicate logic statement is contingent if its truth value depends on the choice of the universe and on the interpretations of the predicate symbol $S$ and ...
Aboveallplayer
696
views
Aboveallplayer
asked
Jan 25, 2016
3
votes
4
answers
5793
subgraphs
number of subgraph for K3 is
number of subgraph for K3 is
Pooja Palod
1.4k
views
Pooja Palod
asked
Jan 24, 2016
Graph Theory
graph-theory
+
–
1
votes
1
answer
5794
Ace Test Series: Graph Theory - Graph Connectivity
I think the explanation is for edges for which graph is always connected.
I think the explanation is for edges for which graph is always connected.
Tushar Shinde
535
views
Tushar Shinde
asked
Jan 24, 2016
Graph Theory
ace-test-series
engineering-mathematics
discrete-mathematics
graph-theory
graph-connectivity
+
–
0
votes
1
answer
5795
Ace Test Series: Set Theory & Algebra - Functions
I thought answer would be (C). Because, inner 'f' is outputting values 8, 9, 3, 1, 2. So, outer 'f' should take these values for final output. But as these values are not in its domain [S], so that should be undefined.. Right?
I thought answer would be (C). Because, inner 'f' is outputting values 8, 9, 3, 1, 2. So, outer 'f' should take these values for final output. But as these values are not...
Tushar Shinde
630
views
Tushar Shinde
asked
Jan 24, 2016
Set Theory & Algebra
ace-test-series
discrete-mathematics
set-theory&algebra
functions
+
–
1
votes
2
answers
5796
Max Number of edges
A simple undirected graph ‘X’ has 10 vertices. If ‘X’ has 5 equally sized connected components, the maximum number of edges in graph ‘X’ is _________.
A simple undirected graph ‘X’ has 10 vertices. If ‘X’ has 5 equally sized connected components, the maximum number of edges in graph ‘X’ is _________.
Akanksha Kesarwani
2.9k
views
Akanksha Kesarwani
asked
Jan 22, 2016
Graph Theory
graph-theory
graph-connectivity
+
–
0
votes
1
answer
5797
Permutation1.1
If there are 9 students in a class and each team contain 3 students then how many number of ways 9 students can be partitioned into 3 teams? Why is this not 9C3*6C3*3C3?
If there are 9 students in a class and each team contain 3 students then how many number of ways 9 students can be partitioned into 3 teams?Why is this not 9C3*6C3*3C3?
Aspi R Osa
869
views
Aspi R Osa
asked
Jan 22, 2016
Combinatory
combinatory
+
–
0
votes
1
answer
5798
Number of ISOMORPHISMs of a cycle graph?
How many different isomorphisms are there from one cycle on n-vertices to another cycle on n-vertices.
How many different isomorphisms are there from one cycle on n-vertices to another cycle on n-vertices.
Aspi R Osa
1.4k
views
Aspi R Osa
asked
Jan 22, 2016
2
votes
1
answer
5799
minimum number of vertices of planner graph of edges e
monali
318
views
monali
asked
Jan 21, 2016
0
votes
1
answer
5800
Find out the equivalent expression
(P∨Q)∧(P→R)∧(Q→S) is equivalent to- a) S∧R b)S→R c)S∨R d)None.
(P∨Q)∧(P→R)∧(Q→S) is equivalent to-a) S∧Rb)S→Rc)S∨Rd)None.
sampad
649
views
sampad
asked
Jan 21, 2016
Page:
« prev
1
...
285
286
287
288
289
290
291
292
293
294
295
...
357
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register