Gate Exam

Let S = {1,2,3 ,m},m>3. Let X1 X be subsets of S each of size 3. Define a function ffrom Sto the set of natural numbers as, f(i)is the number of sets Xthat

Read Solution (Total 0)

Gate Other Question

For each element in a set of size 2n,an unbiased coin is tossed. The 2ncoin tosses are
independent. An element is chosen if the corresponding coin toss were head. The probability
that exactly n elements are chosen is: Let G=(V, E) be a graph. Define ( ) d
d G = i - d , where id is the number of vertices of degree d in G. If S and T are two different trees with x (S) = x (T), then
option
(A) S = 2 T
(B) S = T - 1
(C) S = T
(D) S = T + 1