Answer:
When you move into a new home or apartment, the first thing on your checklist should be to have the <u>locks</u> changed
Explanation:
Changing the locks
Given that the way the previous owners of the new home or apartment made use of the locks and the keys are usually not completely known to the new owners, one may never know all those that have a key or a means to gain access into the apartment or home. Therefore, in order to guarantee proper security, it is a good practice to have as one of the first thing on the checklist, the changing of the locks of the entrance doors and windows of the new home or apartment.
Fist one correct.
second wrong because not all heat is used for work, some of it lost to other.
third wrong because fuel burn inside is called combustion engine
<span />
Answer:
Step by step explanation along with code and output is provided below
Explanation:
#include<iostream>
using namespace std;
// print_seconds function that takes three input arguments hours, mints, and seconds. There are 60*60=3600 seconds in one hour and 60 seconds in a minute. Total seconds will be addition of these three
void print_seconds(int hours, int mints, int seconds)
{
int total_seconds= hours*3600 + mints*60 + seconds;
cout<<"Total seconds are: "<<total_seconds<<endl;
}
// test code
// user inputs hours, minutes and seconds and can also leave any of them by entering 0 that will not effect the program. Then function print_seconds is called to calculate and print the total seconds.
int main()
{
int h,m,s;
cout<<"enter hours if any or enter 0"<<endl;
cin>>h;
cout<<"enter mints if any or enter 0"<<endl;
cin>>m;
cout<<"enter seconds if any or enter 0"<<endl;
cin>>s;
print_seconds(h,m,s);
return 0;
}
Output:
enter hours if any or enter 0
2
enter mints if any or enter 0
25
enter seconds if any or enter 0
10
Total seconds are: 8710
YOU COULD POTTENTIALLY HAVE TO WIPE ALL CURRENT FILES CLEAN OR U MAY HAVE TO PAY FOR CERTAIN PROGRAMS
Answer:
Explanation:
Algorithm:
a. In each day, you will have to loop through the hotels that come to the hotel after you stayed last night.
b. If a hotel 'h' is found at more than 'd' distance away from last stayed hotel, then the hotel previous of 'h' is chosen to wait for that night. This is the greedy step, and you stay in this hotel.
c. The process for steps a and b is then repeated until we've reached the last hotel xn.
Running time:
Notice that the worst case occurs if each hotel is at a distance of successive multiples of 'd'. The best move is to estimate the distance to each hotel twice the whole computation in the scenario.
Thus, the total running time that could occur in the worst case is O(2n) = O(n). This is said to be linear time.
