Set theory Flashcards

1
Q

What is a complement of a set

A

All the items not in the set A, in the global set

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What are De-morgans’ Laws

A

not(A unison B) = Not(A) intersection Not(B)

not(A Intersection B) = Not(A) unison Not(B)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is the definition of a partition

A

a partition is a collection of sets that
are “mutually exclusive and collectively exhaustive”.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is the Cardinallity of a set?

A

For a set A, the cardinality of A is the number of items in the set A

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is the Inclusion exclusion principle?

A

If A and B are sets of finite cardinality

|𝐴 ∪ 𝐵| = |𝐴| + |B| - |𝐴 ∩ 𝐵|.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is the product principle of counting

A

states that when 𝐴1, 𝐴2, … , 𝐴𝑛 are finite sets, then the cardinality of their Cartesian product is equal to the product of their
individual cardinalities:

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

The unordered sequence of 𝑘 elements, selected without replacement, from a set with 𝑛 elements is called a combination. The number of possible combinations, 𝐶(𝑛, 𝑘)
is given by:

A

𝐶(𝑛,𝑘) = (𝑛) = 𝑛! / 𝑘 (𝑛 − 𝑘)!𝑘!

n and k are referred to as the binomial coefficients

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is the number of possible outcomes in ordered sampling with replacement

A

n^k

k = number of items removed
n = set cardinallity

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

what is the number of possible outcomes in ordered sampling without replacement, when order does not matter

A

n choose k

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly