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
Timekeeping has been a part of society since Ancient Egypt. The use of spring-powered mechanisms allowed clocks to be made smaller ... Essentially, the church bells and the mechanical clock now became the monitor of the working day.
Explanation:
Answer:
public class Triangle
{
public static void main( String[] args )
{
show( 5 );
}
public static void show( int n )
{
int i,j,k;
for (i = 0; i < n - 1; i++ )
{
for (j = 0; j < i; j++ )
{
System.out.print( " " );
}
for (k = n - i; k > 0; k-- )
{
System.out.print( "* " );
}
System.out.println();
}
for (i = 0; i < n; i++ )
{
for (j = n - i; j > 1; j-- )
{
System.out.print( " " );
}
for (k = 0; k < i + 1; k++ )
{
System.out.print( "* " );
}
System.out.println();
}
Answer: The answer is Proximity.
Explanation:
