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 .
The answer is Software as a Service (SaaS).
SaaS is one of the 3 main categories of cloud computing. In SaaS, a 3rd party provider hosts applications and make them available to customers over the internet. It removes the need for businesses to install and run applications on their own data centers or computers. It also eliminates the expense of hardware acquisition and maintenance, as well as software installation and support.
Advantages
Increase your productivity. ...
Connects you to the Internet. ...
Can store vast amounts of information and reduce waste. ...
Helps sort, organize, and search through information. ...
Get a better understanding of data. ...
Keeps you connected. ...
Help you learn and keep you informed. ...
Can make you money.
Disadvantages
Too much sitting. ...
Carpal tunnel and eye strain. ...
Short attention span and too much multitasking. ...
Potential of loss of privacy. ...
Can limit learning and create a dependency. ...
Time sink and lots of distractions....