Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized for You

we will pick new questions that match your level based on your Timer History

Track Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice Pays

we will pick new questions that match your level based on your Timer History

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

A shirt factory has a six-stage manufacturing process. Each [#permalink]
24 Aug 2006, 02:53

00:00

A

B

C

D

E

Difficulty:

(N/A)

Question Stats:

0% (00:00) correct
0% (00:00) wrong based on 1 sessions

A shirt factory has a six-stage manufacturing process. Each of the six stages is manned by experts and novices, whose sewing times differ, as shown above. A shirt being made passes through each of the six stages, and at each stage, the probability that a shirt is assigned to an expert worker is 0.5. Which most closely approximates the probability that a shirt that is manufactured will undergo at most two hours of sewing?

You will be able to finish the shirt under two hours if you use a skilled worker in stage-2 and stage-3. It doesn't matter which worker does the job at other stages. The required probability is 0.5*0.5 = 0.25. _________________

for every person who doesn't try because he is
afraid of loosing , there is another person who
keeps making mistakes and succeeds..

If novices work on the shirt in all stages, it would take 190 minutes and if experts work on the shirt in all stages, it would take 98 minutes. We can see that the stage-3 is very much critical. If we use a novice in stage-3, there is no way we can complete the shirt in less than or equal to 120 minutes. So, we have

XXEXXX where X denotes either novice or expert. Now, besides the third stage, we need the experts in three more stages. So, the idea is that we must have the expert take care of the stage-3, and also take care of 3 or more stages of the remaining 5. The required probability is

Kevin, i had miscalculated the number of minutes. I was under the impression that it will boil down to only two stages. The new answer/explanation has already been posted. _________________

for every person who doesn't try because he is
afraid of loosing , there is another person who
keeps making mistakes and succeeds..

Taking a crack at it [#permalink]
29 Aug 2006, 09:53

This is a tough one.... how much time would you allocate to this?? Took me at least 5 mins to even think through!!! And I'm still not at the answer - this is a partial answer looking for help (I suck at probability and trying to work at it)

Here is what I did:

Total cases are of course 2 ^ 6 = 64.

Min time calculation (all experts) = 99 (best case scenario)
Time diff calculation at each stage = 15, 7, 30, 20, 10, 10.

Now starting from the minimum and seeing which ones have to be done by experts or can be left to the others... to reach a max of 120 (2 hrs).

The first stage, second and last two can be done by expert or non expert (as long as the others are all done by experts). Also 2 and 5 or 2 and 6 can be done togehter by non experts. Any other cases and we wont keep to the time limit.

At this point I'm at a loss how to convert these cases into numbers! But will keep plugging away and come back with a solution if I can.

oooh calculation mistake [#permalink]
29 Aug 2006, 10:08

The summing up was wrong... the expert total actually comes to 97 minutes, leaving us a leeway of 23 minutes and not 21 like I had assumed (infact I somehow managed to assume 19 mins... but this time I have it!!!)

So we can afford anything that will add under 23 mins to the process.
This will add the following cases:

a. {n1, e2-e6} (n1=>e1 i.e. n1 replaced e1)ExcessTime: 7mins b. {n1, n2, e3-e6} (n1=>e1, n2=> e2) ET: 0mins c. {e1-e3, n4, e5, e6} {n4=>e4} ET: 2 mins d. {e1, n2, e3, e4, n5, e6} {n2=>e2, n5=> e5} ET: 5 mins e. {e1, n2, e3, e4, e5, n6} {n2=> e2, n6=>e6} ET: 5 mins f. {e1-e4, n5, n6} {n5=>e5, n6=>e6} ET: 2 mins g. {e1, n2, e3-e6} {n2=>e2} ET: 15mins h. {e1-e4, n5, e6} {n5=>e5} ET: 12mins i. {e1-e5, n6} {n6=> e6} ET : 12 mins j. {e1-e6} ET: 22 mins <<< Thanks to Mikki!! >>>>

Total number of ways: 10 for processing in atmost 120mins

Possible # of ways = 64

Prob = 10/64= 0.16

Answer: A

Last edited by haas_mba07 on 29 Aug 2006, 10:29, edited 1 time in total.