### Discrete Math : Combinations, Permutations and Probability (25 MC Problems)

This test consists of 25 equally weighted questions. 1. Given a two-step procedure where there are n1 ways to do Task 1, and n2 ways to do Task 2 after completing Task 1, then there are _________ ways to do the procedure. a. n1 + n2 b. n1 log n2 c. n1 * n2 d. n12 2. How many bit strings of length 10 begin with 1101? a.