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:
20
Explanation:
assuming the print statement is not indented, the program effectively calculates 2+5+6+7.
The range(...) is <em>excluding </em>the end value (8 in this case).
Answer:
It is an example of a matrix structure
Explanation:
The matrix structure is a structure in which jurisdiction, controls and duties are carried and uphold by a group of employees instead of just the manager.
In other words, employees have dual reporting relationships; they can give reports to the functional manager and they can also give reports to the product manager.
The Bennetton design selected by the network of Bennetton retail sales agents made activities to be easily coordinated because, they have collectively performed the duty as a unit and this is one of the advantages of this form of the matrix organizational structure.
I think the answer to this would be true
