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:
Privacy Policy
Explanation:
PRIVACY POLICY is the support function under Tech Mahindra that is governing data privacy and protection-related requirements.
Given that support functions are functions which assist and in a way contribute to the company goal.
Other support functions are human resources, training and development, salaries, IT, auditing, marketing, legal, accounting/credit control, and communications.
The above statement is based on the fact that the Privacy Policy clarifies all the data protection rights, such as the right to object to some of the production processes that TechM may carry out.
Answer:
behavior that is good for everyone
following the rules
behaving in a way that would be easy to defend
Explanation: