<em><u>Answer</u></em>
5 hours
<em><u>Explanation</u></em>
The two working together can finish a job in
Also, working alone, one machine would take one hour longer than the other to complete the same job.
Let the slower machine working alone take x hours. Then the faster machine takes x-1 hours to complete the same task working alone.
Their combined rate in terms of x is
This should be equal to 20/9 hours.
Multiply through by;
Factor to get:
It is not feasible for the slower machine to complete the work alone in 4/9 hours if the two will finish in 20/9 hours.
Therefore the slower finish in 5 hours.
Answer:
By Using the Greedy- Activity- Selection algorithm
Explanation:
The Greedy- Activity- Selection algorithm in this case involves
First finding a maximum size set S1, of compatible activities from S for the first lecture hall.
Then using it again to find a maximum size set S2 of compatible activities from S - S1 for the second hall.
This is repeated till all the activities are assigned.
It requires θ(n2) time in its worse .
C is the correct answer I believe
Answer:
Below
Explanation:
I believe that it's a bit of a case by case scenario. However, personal biases will inevitably show throughout any sort of writing or other presenting within media. That's why you should always be careful about what you read and believe is true
