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 .
What things?????? Are u talking about
Answer:b) Master reference file(MRF)
Explanation: Master reference file is the collection of data that persist the schedules records for the maintenance and administration. It is the UDC version tool .
It helps in the managing the data content present in the database, archiving and tracing any changes on the database over certain time.Master data management is the managing of data's integrity .It send the collected critical data to the master reference files.
Other given options are incorrect because backup file is for creating data backup, central directory is record of the data of users and other information and data silo is kind of fixed data having the governance of any organization.Thus, these factors don't help in the critical information management.Thus, the correct option is option(b).
