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: Console-Based
Explanation:
A console based application is an application that helps in facilitating the reading and the writing of the characters from a console.
It is vital in the provision of a simple user interface for the applications that requires little interaction. Since the application accepts input and displays a response to the user and cannot create a graphical interface for this application, then it's a console based application.
by typing ctrl+ s on keyboard