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 .
Answer:
I am sure the answer is A
Explanation:
As you can see from the graph, the first time they pumped air, the numbers were 6, 1.2, and 2. Once they start pumping the numbers decrease. Therefore, I think the answer is A. It went to 5.7, 4, and 2 from 6, 1.2, and 2.1.
Answer:
scope of pet name is limited to pet class and color is accessible to the whole program
Explanation:
