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:
Lowest Level; Machine Language.
Explanation:
The lowest level of a computer is machine language, which are strings of 0's and 1's in bits, and it's possible to perform tasks at this level. It's however difficult to do and humans created <em>Assembly</em>; a type of low level programming language to be readable, and converts to machine language so that we don't have to work in binary.
Go to the me colum when you first open the app
Hack means hack computer and crack means I guess your behind
Selection is the step in algorithm that let's the computer decide which group of steps to perform.
<h3>What is Algorithm?</h3>
This can be defined as set of instructions which are used for solving a problem or accomplishing a task.
Selection happens when there are one or more options are available in which the computer decide which group of steps to perform.
Read more about Algorithm here brainly.com/question/11302120
