1.

Let `A = {1,2,3,4,...,n}` be a set containing n elements, then for any given `k leqn`, the number of subsets of A having k as largest element must beA. `2^(k)`B. `2^(n-k)`C. `2^(k+1)`D. `2^(k-1)`

Answer» Correct Answer - D
There are `(k-1)`


Discussion

No Comment Found

Related InterviewSolutions