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 think the answer would be D
Explanation:
it just seems to make the most sense
Answer:
RAM
Explanation:
"RAM" refers to <em>Random-Access Memory. </em>Just like the human brain, this stores your computer files temporarily. It is considered to be a <em>"volatile memory"</em> which means that information can only be stored<u> when there's power.</u> So, when your computer shuts down,<u> the information is los</u>t. This is similar to the human brain, especially when it comes to learning. When a person learns new things, some of the information he read before may be forgotten.
And? What’s the point? The question?
Left fingers on ASDF whilst right hand is on jkl;
A= pinkie
S= ring finger
D=Middle
F=Index.
J=Index.
K=Middle
K=Ring finger
;= pinkie
Hope this helped
