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:
me desculpe mais eu preciso de pontos para ajudr meu irmão autista
1. go back to the feedback you submitted
2.Locate the order, and then click remove
3.select a reason for the removal and click to remove the feedback button.
(But why would you write a rude comment in the first place to begin with?)
Answer:
B. The remainder when dividing a whole number by 2
Explanation:
A binary digit can have the values 0 or 1. The remainder from division of an integer by 2 will be 0 or 1. Hence that remainder can be represented by a single binary digit.
__
That fact can be used to do conversion of a number to binary.
Answer:
True
Explanation:
Everything typed into a computer is saved as data and logged.
