0% found this document useful (0 votes)
364 views8 pages

Practice Test: Chapter 7: Counting Principles

Uploaded by

Doctor Vidda
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
364 views8 pages

Practice Test: Chapter 7: Counting Principles

Uploaded by

Doctor Vidda
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd

PRACTICE TEST

Chapter 7: Counting Principles

INSTRUCTIONS: Answer each question below. Once you finish taking the test, check
the answers provided in the Answer Key at the end of this test.

1. Find the number of binary strings of length 8.


A: 2
B: 16
C: 64
D: 256

2. Find the number of ways to pick one pair of pants to wear, where there are green
pants and blue pants. The green pants are cuffed or straight leg and each of these
is with a waist band or without a waist band. The blue pants are pleated front or
straight front; both of these have a waist band.
A: 6
B: 8
C: 12
D: 16

3. Find the number of one-to-one maps from a set A with 7 elements to a set B with
12 elements.
A: 12!
B: 127
C: 7!
D: none of the above

4. Find the number of functions from a set with 6 elements to a set with 4 elements.
A: 64
B: 6!
C: 46
D: none of the above

5. How many numbers between 1 and 100 are multiples of 5 or 3?

©2010 Cengage Learning Asia Pte Ltd


A: 53
B: 47
C: 54
D: none of the above

6. Suppose 15 classmates are born in 1982. What can be concluded about the
births?
A: At least two people were born in the same month
B: 7 are girls
C: 8 are girls
D: No conclusions can be made.

7. Jim has 7 pairs of socks in his drawer, each pair is a different color. If he draws
one sock at a time from the drawer in the dark, what is the least number of socks
he must choose to be certain he has at least 2 of the same color?
A: 2
B: 3
C: 8
D: 13

8. What is the size of the smallest set S of positive integers you must have to be
certain that at least two of the elements of S have the same remainder when
divided by 100?
A: 51
B: 100
C: 101
D: none of the above

9. Let S ={1,2,3,4,5,6,7,8,9}. What is the smallest subset T of S that will assure us


that T contains 2 elements whose sum is 10?
A: 2
B: 6
C: 7
D: none of the above
10. How many ways can 5 boys and 5 girls stand in one line?

©2010 Cengage Learning Asia Pte Ltd


A: 5!
B: 5! × 5!
C: 10!
D: none of the above

11. How many ways can 5 boys and 5 girls stand in one line where boys and girls
alternate in line with a girl first?
A: 5!
B: 5! x 5!
C: 10!
D: none of the above

12. How many ways can 5 boys and 5 girls stand in one line where boys and girls
alternate in line?
A: 5!
B: 5! x 5!
C: 10!
D: none of the above

13. How many different social security numbers are there with distinct digits
assuming 0 cannot be the first digit? ( SS#'s have 9 digits)
A: 9!
B: 9 x 9!
C: 10!
D: none of the above

14. How many 3 letter words can be formed from the letters in MISSISSIPPI if no
letters are repeated?
A: 4
B: 6
C: 4!
D: none of the above

15. How many 4 letter words can be formed from the letters in MISSISSIPPI if no
letters are repeated and the third letter must be an I?

©2010 Cengage Learning Asia Pte Ltd


A: 4
B: 6
C: 4!
D: none of the above

16. In how many ways can a team of 5 players be selected from 12 candidates?
A: 120
B: 792
C: 792 x 5!
D: none of the above

17. In how many ways can a team of 5 players be drafted from 12 candidates? Note
"drafting" implies that the order of selection makes a difference.
A: 120
B: 792
C: 792 x 5!
D: none of the above

18. For what value of r is C(15,r) the largest, as r = 0,1,2,...,15?


A: 0
B: 8
C: 15
D: none of the above

19. A committee is to consist of 8 people at least 6 of whom are women. There are 10
women and 8 men willing to serve, in how many ways can the committee be
formed?
A: 5880
B: 6840
C: 6885
D: none of the above

20. What is the number of ways the 11 letters in MISSISSIPPI can be arranged?
A: 11!

©2010 Cengage Learning Asia Pte Ltd


B: 69300
C: 34650
D: none of the above

21. What is the number of nonnegative integer solutions to the equation x1 + x2 + x3 +


x4 = 25?
A: 3276
B: 20475
C: 12650
D: none of the above

22. What is the number of ways to place an order for 12 hot dogs from 3 types: slaw
dogs, chili dogs, and cheese dogs?
A: 91
B: 364
C: 1320
D: none of the above

23. What is the number of integer solutions to the equation x1 + x2 + x3 + x4 = 25 with


each xi  1?
A: 2024
B: 3276
C: 21252
D: none of the above

24. What is the coefficient of x5y7 in the expansion of (x+y)12?


A: 1
B: 792
C: 95040
D: none of the above

25. What is the sum of the entries of the fifth row of Pascal’s triangle?
A: 16

©2010 Cengage Learning Asia Pte Ltd


B: 25
C: 32
D: none of the above

26. In listing the permutations on A = {1,2,3,4,5,6,7} what permutation follows


6 1 3 2 7 5 4 in lexicographic order?
A: 6 1 3 4 7 5 2
B: 6 1 3 4 2 5 7
C: 3 1 6 4 5 7 2
D: none of the above

27. A box contains 10 Math books, 20 computer Science books, 8 German books, 16
History books, and 22 Geography books. The number of ways we choose 12
books to ensure that we have 12 books in the same subject.

A: 50
B: 52
C: 53
D: none of the above

28. Robin has six friends. In how many ways can he invite one or more friend in his
birth day party?
A: 6
B: 127
C: 128
D: none of the above

29. In how many ways can 10 balls be distributed to 8 boys?


A: 8
B: 12
C: 36
D: none of the above

30.
30 books contain a total of 61328 pages. Then one of the books must contain
A: at least 2045 pages

©2010 Cengage Learning Asia Pte Ltd


B: at least 2045 pages
C: at least 2045 pages
D: none of the above

©2010 Cengage Learning Asia Pte Ltd


Answers:

1. D 2. A 3. D 4. C 5. B 6. A 7. C 8. C 9. B 10. C
11. B 12. D 13. B 14. C 15. B 16. B 17. C 18. B 19. C 20. C
21. A 22. A 23. A 24. B 25. C 26. B 27. B 28. B 29. C 30. A

©2010 Cengage Learning Asia Pte Ltd

You might also like