Multiple Choice
Identify the
choice that best completes the statement or answers the question.
|
|
|
1.
|
 | A country has a 7 digit phone number system of the form
ABC-DEFG. The first digit ‘A’ can be any number except 0 or 1. The next 2 digits,
‘B’ and ‘C’, can be any digit, except they cannot repeat. The last 4 digits
can be any single digit number 0-9. How many unique phone numbers are possible? | | | |
a. | 7,200,000 | c. | 8,100,000 | b. | 8,000,000 | d. | 9,000,000 |
|
|
|
2.
|
 A student number system for a county requires that the student
number be 5 characters.
The first 3 characters are any single digit number, but no number can
repeat and the last 2 characters must be letters, but no letter can repeat. How many unique student
numbers are possible? | | | |
a. | 1,370 | c. | 250,000 | b. | 131,040 | d. | 468,000 |
|
|
|
3.
|
 Given a special license plate tag consists of 6 characters for
a small country.
The first 3 characters must be letters and the last 3 must be a single digit
number. Characters can repeat. The only restriction is that you can’t have the first 3
characters be the same (e.g. AAA, BBB, CCC, ... etc.). How many unique tags are possible? |  | | |
a. | 9,250,000 | c. | 15,600,000 | b. | 11,232,000 | d. | 17,550,000 |
|
|
|
4.
|
 | An online account requires a 4 character password. Each
character in the password can be a number or a letter. If a hacking computer can attempt to
enter a possible password every 0.001 seconds. How long would it take the hacking computer to
try every password possible? | | | |
a. | 28 minutes | c. | 872 minutes | b. | 79 minutes | d. | 1680 minutes |
|
|
|
5.
|
 A person is taking a 5 question multiple
choice quiz. Each question has 4 choices (A, B, C, or D).
How many different
ways could an answer sheet (Scranton form) be filled out? | | | |
|