Discrete mathematics

Question 1 of 8

How many subsets does a set of n elements have?

Question 2 of 8

The number of ways to choose k items from n, order not mattering, is:

Question 3 of 8

The contrapositive of "if P then Q" is:

Question 4 of 8

The pigeonhole principle states that putting n+1 items into n boxes means:

Question 5 of 8

A graph is bipartite if and only if it:

Question 6 of 8

Proof by induction requires:

Question 7 of 8

A tree with n vertices has exactly:

Question 8 of 8

Big-O notation describes: