Gate2019 cs Q15

0. Let U = {1, 2, ..., Q.16 n} and A = {(x, X), x ∈ X and X ⊆ U}. Consider the following two statements on ⏐A⏐.

  • Option : C
  • Explanation :
    A = {(x, X), x ∈ X and X ⊆ U}
    The number of k element subsets of a set U with n elements = = nCk'
    The number of possible ordered pairs (x, X) where x ∈ X is then 2n-1 Sets are possible so for all n elements total n ⋅ 2n-1 number of order pairs are possible.
    thus statement I is true and
    But since by the combinatoric identity

    statement II is identity similar to statement I thus also true.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *