GATE CS 2019 Set 1 — Question 15

Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.
MCQ+1 / -0.33MediumSets, Relations & FunctionsSets & CombinatoricsEngineering MathematicsPermutations & Combinations

Engineering Mathematics → Sets & Combinatorics → Permutations & Combinations

Last updated

Question

Let U={1,2,,n}U = \{1, 2, \dots, n\}. Let A={(x,X)xX,XU}A = \{(x, X) \mid x \in X, X \subseteq U\}. Consider the following two statements on A|A|.
I. A=n2n1|A| = n2^{n-1}
II. A=k=1nk(nk)|A| = \sum_{k=1}^n k \binom{n}{k}
Which of the above statements is/are TRUE?
Your answer

Choose one option, then check your answer.

The solution stays hidden until you check.

Continue learning with Success Tracker

A step still unclear? Work through it with support

Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.

AI-powered practice· Unlimited practice on eligible plans
PYQs with solutions
Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
Practice that adapts
Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
AI doubt support
Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.

Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.

This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.

More questions on Sets & Combinatorics