How many distinct subsets can be formed from the set ?
Tap an option to check your answer.
UoH 2015 Question 15: Sets, relations and functions
Answer and worked solution
Checking your account…
Plain-text version
How many distinct subsets can be formed from the set N = {7,3,8,2,9,6}? (A) 6. (B) 64. (C) 18144. (D) 35.
Sets, relations and functions has come up 65 times in 6 exams since 2004.
What this question tests
This question is on Cardinality and countability, part of Sets, relations and functions in Mathematics.
Comparing the size of sets, including finite, countable and uncountable sets.
TestStop has 6 past-paper questions on this subtopic.
Similar questions from other papers
- Given below are two statements, one is labelled as Assertion (A) and the other is labelled as Reason (R): Assertion (A): The inverse of y = f(x) = e^x exists for all x…
- The inverse of a function: x = √(3y+9) is
- Which of the following are correct in the case of the theory of sets? A. (AUB')n(A'UC)n(BUC') = (AnBnC)U(AUBUC). B. (AUB')n(A'UC)n(BUC') = (AnBnC)U(AUBUC)'. C. AU(BnC)…
- For the set A = {3, 4}, find Power Set P(A)
- Let f:[0,∞)→ℝ be defined by f(x) = (x+1)/(x+2) for all x in the domain. Then f is
Question from the UoH 2015 paper. Solutions are TestStop's own. Not affiliated with or endorsed by any examination authority.