Wuanberri Start free
← Back to Discrete Math

Discrete Math final exam

Fifteen questions on all of Discrete Math. Answer all 15 to see your score. Questions are drawn from a bank of 45, so every attempt is different.

0 of 15 answered

Question 1 of 15

p -> q is equivalent to:

Question 2 of 15

The negation of 'every student passed' is:

Question 3 of 15

A proof that assumes the negation and derives an impossibility is:

Question 4 of 15

A set with 4 elements has how many subsets?

Question 5 of 15

|A union B| when |A| = 12, |B| = 9, |A intersect B| = 4:

Question 6 of 15

A function that is both one-to-one and onto is:

Question 7 of 15

The pigeonhole principle implies that among 367 people:

Question 8 of 15

1 + 2 + ... + 50 equals:

Question 9 of 15

Induction requires a base case and:

Question 10 of 15

The towers of Hanoi with n discs needs:

Question 11 of 15

The characteristic equation of a_n = a_(n-1) + 6a_(n-2) has roots:

Question 12 of 15

How many ways can 3 prizes (1st, 2nd, 3rd) go to 10 people?

Question 13 of 15

How many 3-person committees from 10 people?

Question 14 of 15

The coefficient of x^3 y in (x + y)^4 is:

Question 15 of 15

Ways to give 6 identical sweets to 3 children:

Back to all units