azamaka
An employer has 6 applicants for a programming position and 4 applicants for a manager position. If the employer must hire 3 programmers and 2 managers, what is the total number of ways the employer can make the selection?
a) 1,490
b) 132
c) 120
d) 60
e) 23
Take the task of selecting employees and break it into
stages.
Stage 1: Select 3 programmers to hire
Since the order in which we select the programmers does not matter, we can use combinations.
We can select 3 programmers from 6 programmers in 6C3 ways (20 ways)
So, we can complete stage 1 in
20 ways
If anyone is interested, we have a free video on calculating combinations (like 6C3) in your head:
https://www.gmatprepnow.com/module/gmat- ... /video/789Stage 2: Select 2 managers to hire
Once again, we can use combinations
We can select 2 managers from 4 applicants in 4C2 ways (6 ways)
So, we can complete stage 2 in
6 ways
By the Fundamental Counting Principle (FCP), we can complete the 2 (and thus hire all of the people) in
(20)(6) ways (= 120 ways)
Answer: C
Note: the FCP can be used to solve the MAJORITY of counting questions on the GMAT. So, be sure to learn it.
RELATED VIDEOS