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:
the smart phone
Explanation:
It is the most widley used and accepted
Answer:
timer interrupt
Explanation:
A timer is an interrupt that is generated by the PC's system timer.When this interrupt occurs, the ROM BIOS interrupt handler is called and it increments a count in the ROM BIOS.It interrupts the system 18.2 times per second.It is used for multitasking.Hence we conclude that timer interrupt is the answer.
Answer:
yes
Explanation:
it provides a design approach to a specific type of problem
By looking up your research on websites that have (.org) or wikipedia for answers u might have to find information