Register
Filter

Recent questions in Discrete Mathematics

#5441
10.8k
views
1 answers
3 votes
UGC NET CSE | September 2013 | Part 2 | Question: 22
A simple graph G with n vertices is connected if the graph has(n-1)(n-2)/2 edgesmore than (n-1) (n-2)/2 edgesless than (n-1) (n-2)/2 edges$\Sigma_{i=1}^k C(n_i, 2)$ edges...
User Avatar
#5442
10.9k
views
3 answers
4 votes
UGC NET CSE | September 2013 | Part 2 | Question: 8
Consider an undirected graph G with 100 nodes. The maximum number of edges to be included in G so that the graph is not connected is2451495048519900
User Avatar
#5443
2.5k
views
3 answers
6 votes
UGC NET CSE | June 2013 | Part 3 | Question: 69
If we convert$\exists u \forall v \forall x \exists y (P(f(u), v, x, y) \rightarrow Q(u,v,y))$ to $\forall v \forall x (P(f(a), v, x, g(v,x)) \rightarrow Q(a,v,g(v,x)))$....
User Avatar
#5444
3.8k
views
1 answers
1 votes
DRDO-2008
Adacency list is preferred over adjacency matrix when the graph is?A) planarB) DenseC) CliqueD) none of these
User Avatar
#5445
2.5k
views
2 answers
3 votes
UGC NET CSE | December 2014 | Part 2 | Question: 05
If we define the functions $f$, $g$ and $h$ that map $R$ into $R$ by : $f(x)=x^{4}, g(x)= \sqrt{x^{2}+1}, h(x)=x^{2}+72$, then the value of the composite functions $ho(go...
User Avatar
#5446
839
views
2 answers
4 votes
Discrete Mathematics
User Avatar
#5447
556
views
1 answers
0 votes
Discrete Mathematics Sets veii veii imp and veii trickyy question
User Avatar
#5448
371
views
0 answers
1 votes
solve this question
https://gateoverflow.in/?qa=blob&qa_blobid=3418736050134417749
User Avatar
#5449
3.1k
views
1 answers
1 votes
Discrete mathematics Sets question Veiii Veii Impp plshhh tell
User Avatar
#5450
1.8k
views
1 answers
1 votes
Discrete Mathematics Sets Question
Prove that : A △ B = ( A ∪ B ) - ( A ∩ B )
User Avatar
#5451
3.0k
views
2 answers
5 votes
UGC NET CSE | December 2014 | Part 2 | Question: 03
Consider the Graph shown below : This graph is a _________.Complete GraphBipartite GraphHamiltonian GraphAll of the above
User Avatar
#5452
2.2k
views
1 answers
0 votes
UGC NET CSE | June 2013 | Part 3 | Question: 15
A vertex cover of an undirected graph $G(V,E)$ is a subset $V_1 \subseteq V$ vertices such thatEach pair of vertices in $V_1$ is connected by an edgeIf $(u,v) \in E$ then...
User Avatar
#5453
2.4k
views
1 answers
1 votes
UGC NET CSE | December 2014 | Part 2 | Question: 01
Consider a set $A = \left\{1, 2, 3, …….., 1000\right\}$.How many members of A shall be divisible by $3$ or by $5$ or by both $3$ and $5$?533 599467 66
User Avatar
#5454
681
views
2 answers
1 votes
Engineering Mathematics
What are the subsets of set A={1,2,{3,4}} ?According to me they are {∅},{1},{2},{{3,4}},{1,{3,4}},{2,{3,4}},{1,2,{3,4}},{1,2}Now My Question is is Should we separa...
User Avatar
#5455
2.3k
views
1 answers
2 votes
UGC NET CSE | June 2013 | Part 2 | Question: 45
When a mobile telephone physically moves from one to another cell, the base station transfers ownership to the cell getting strongest signal. This process is known ashand...
User Avatar
#5456
4.1k
views
2 answers
3 votes
UGC NET CSE | June 2013 | Part 2 | Question: 43
Which one of the following is decimal value of a signed binary number 1101010, if it is in 2’s complement form?-42-22-21-106
User Avatar
#5457
7.9k
views
3 answers
4 votes
UGC NET CSE | June 2013 | Part 2 | Question: 34
The relation “devides” on a set of positive integers is_____Symmetric and transitiveAnti symmetric and transitiveSymmetric onlyTransitive only
User Avatar
#5458
787
views
1 answers
2 votes
UGC NET CSE | June 2013 | Part 2 | Question: 5
Cyclometric complexity of a flow graph G with n vertices and e edges isV(G) = e+n-2V(G) = e-n+2V(G) = e+n+2V(G) = e-n-2
User Avatar
#5459
2.3k
views
2 answers
2 votes
UGC NET CSE | December 2012 | Part 3 | Question: 75
Let $\theta(x, y, z)$ be the statement “x+y=z” and let there be two quantification given as$\forall x \forall y \exists z \theta (x,y,z)$$\exists z \forall x \forall...
User Avatar
#5460
3.4k
views
3 answers
2 votes
UGC NET CSE | December 2012 | Part 3 | Question: 58
Skolmization is the process ofbringing all the quantifiers in the beginning of a formula in FDLremoving all the universal quantifiersremoving all the extential quantifier...
User Avatar
Page: