Answer:
Hmm maybe because its failing?
Explanation:
i actually dont know but it happens to me sometimes
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:
There is no table, so I can only comment on the statements:
The binary value of decimal 10 is A. ==> False, however A is a hexadecimal representation of 10.
The binary value of decimal 13 is 1001 ==> False, 13 would be 1101.
The binary value of decimal 15 is 1111. ==> True.
The binary value of decimal 14 is E. ==> Again E is a hexadecimal representation of 14.
