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:
CLS
INPUT"Enter any three numbers";a,b,c
IF a>b AND a>c THEN
PRINT a;"is the greatest"
ELSEIF b>a AND b>c THEN
PRINT b;"is the greatest"
ELSE
PRINT c;"is the greatest"
ENDIF
END
Answer:
It's up to personal preference.
Explanation:
iPhone/Apple gives more compliments to security than Android.
Android has more friendly user GUI and dev tools.
Culture identifies who you are, what you value, and how you act.