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:
The correct answer to the following question will be "Flash memory card".
Explanation:
A flash memory card seems to be a storage (small) medium which stores data or information on fordable or remote devices using non-volatile transistor technology hardware.
- Most newer offerings include flash storage or memory chips, even though the development of other memory innovations is underway.
- This would be the storage mechanism from which the configuration tool was replicated by Thomas' friend.
Answer:
1, 4, 7
Explanation:
The instruction in the question can be represented as:
for i in range(1,10,3):
print i
What the above code does is that:
It starts printing the value of i from 1
Increment by 3
Then stop printing at 9 (i.e.. 10 - 1)
So: The sequence is as follows
Print 1
Add 3, to give 4
Print 4
Add 3, to give 7
Print 7
Add 3, to give 10 (10 > 10 - 1).
So, it stops execution.
This could have happened when:
- Lack of Internet service or failure
- Wrong application.
<h3>What do you mean by Internet?</h3>
The Internet is seen as a form of a network that helps people to connects their computers all over the nation.
In this age, Through the help of the Internet, people are able to share information and navigate through places.
Note that the problem of bad direction could have happened when:
- Lack of Internet service or failure
- Wrong application.
Learn more about Internet from
brainly.com/question/2780939
#SPJ1
Aerospace, petroleum, and automotive industries
