The scripter as he made the script.
I'd go for <span>
FLOOR(x) </span>
The numerical function FLOOR(x) can be used to return the
largest integer value that is less than or equal to the numerical expression
provided. The numerical function CEILING (x) is the opposite of FLOOR(x) since
it gives the smallest integer value that is greater or equal to the numerical
expression.
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 .