Engineering Board Exam Reviewer · Fundamental Counting Principle · medium
There are 3 roads from town A to town B, 4 roads from town B to town C, and 2 direct roads from town A to town C. In how many ways can a person travel from A to C?
- 24
- 14
- 9
- 12
Answer
B. 14
Solution
Through B: 3×4=12 ways (multiplication principle). Direct: 2 ways. Since these are separate options, add: 12+2=14.
More Fundamental Counting Principle questions
- How many 4-letter codes can be formed from the 26 letters of the alphabet if the first letter must be a vowel and no letter may be repeated?
- How many 3-digit even numbers are there?
- How many 3-digit numbers can be formed from the digits 1 to 9 if repetition is allowed?
- A locker code has 4 digits, each chosen from 0 to 9 with repetition allowed. How many different codes are possible?
- A menu offers 5 soups, 7 entrees, and 4 drinks. How many different meals consisting of one soup, one entree, and one drink can be ordered?
- A restaurant offers 4 appetizers, 6 main courses, and 3 desserts. How many different 3-course meals (one from each category) can be ordered?
- A license plate consists of 3 letters followed by 4 digits, and repetition is allowed. How many different license plates are possible?
- How many different outfits can be made from 5 shirts, 3 pants, and 2 pairs of shoes?
- A coin is tossed 5 times. How many different sequences of heads and tails are possible?
- How many 4-digit numbers can be formed using the digits 1 through 9 (no repetition) if the number must be even?