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 .
The global positioning system (GPS) is a space-based radio-positioning and time-transfer system. GPS satellites transmit signals to proper equipment on the ground. These signals provide accurate position, velocity, and time (PVT) information to an unlimited number of users on ground, sea, air, and space.
Answer:
The answer is B = 365
Explanation:
The following variable were initialized:
a = 1
b = 10
c = 100
x = 0
Then we store the value of 'c' times 3 in 'x'
x = 3 * c = 3 * 100 = 300
x = 300
Then we add the value of 'b' times 6 to the value already in 'x'
x = x + 'b' times 6
x = x + (b * 6) = 300 + (10 * 6) = 300 + 60 = 360
x = 360
Then we add the value of 'a' times 5 to the value already in 'x'
x = x + 'a' times 5
x = x + (a * 5) = 360 + (1 * 5) = 360 + 5 = 365
x = 365.
Therefore, the value of 'x' displayed is 365.
