Answer:
D - a doctorate degree
Explanation:
You are studying in a role as a doctors position.
Modern computers use in side a memory board to store info but back then you would use flappy disks
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 .
That IP address is either Internal, private or reserved
