Search the courses, subjects, tracks, games and features, or jump straight to a page.
2 cards from this section. Quick, good the night before a test.
Define a partition in your own words.
Think of subsets that do not overlap.
Give an example of two disjoint sets.
Look for sets with no shared elements.
What is a requirement for a set to be partitioned?
Think about the definitions we've covered.
True or False: Two subsets can have common elements and still form a valid partition.
Remember the condition of disjoint subsets.
Given the set {A, B, C, D, E, F}, create two different valid partitions and explain why they satisfy partition requirements.
Remember to check if all elements are covered.
Can the equivalence classes generated from the relation of 'having the same first initial' on the set of names form a partition? Why or why not?
Think about names that would fall into the same equivalence class.
4 more questions in this section. Enroll free to practise them all.
Enroll free