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:
Stack.
Explanation:
Topological sort requires a bit of addition to DFS algorithm.So DFS can be done by two ways that are either you can use recursion or you can use Stack data structure to implement DFS.
Since recursion uses stack memory when it makes recursive calls and if you want to do it iteratively you can stack data structure.
Answer:
The three options are:
1. Avoid sharing files and folders over the network without the permission of your administrators. You might fall in trouble otherwise.
2. Never share your credit card details with a third party through the internet. You can lose a lot of or all your money.
3. Always ensure that your password is strong enough or else your account can be hacked, And never share them with anybody.
Explanation:
Please check the answer.
When a formula contains the address of a cell, it is called a c<span>ell reference.
hope this helps!</span>
Hello,
Well my advice for Sara when using the web would be 3 things.
1: Never tell anyone where you live,Your name, Or any other personal information.
This is important as it will keep you safe and others that are in your family.
2: Get anti virus hardware on your devise.
This will help to stop bad people, and bugs/glitches,this will also protect you from information thieves.
3: Make sure to keep your passwords saved on paper.
I know a lot of people use, google(ect.) to save there passwords to make everything easy, but a good way to never loss them is to wright them down.
Have a great day!
