Best answer is: Owners manual based on driving habits
Explanation:
If you are one of the many people who let a windshield reminder sticker govern when they get an oil change, here's our advice to you: Drop that habit. Instead, follow the automaker's recommended service intervals. In many modern cars, your best bet is to rely on the vehicle's oil life monitoring system to let you know when it's time for a change.
Answer:
I am sure the answer is A
Explanation:
As you can see from the graph, the first time they pumped air, the numbers were 6, 1.2, and 2. Once they start pumping the numbers decrease. Therefore, I think the answer is A. It went to 5.7, 4, and 2 from 6, 1.2, and 2.1.
Answer:
1.
class TIME
{
int hour , min , sec ;
public :
TIME()
{
hour=min=sec=0;
}
TIME( int h , int m , int s )
{
hour = h;
min = m;
sec = s;
}
void change ( int Hour)
{
hour = Hour;
}
void stdtime()
{
if(hour>12)
cout<<"The Standard time is"<<(hour-12)<<":"<<min<<":"<<sec<<"P.M\n";
else
cout<<"The Standard time is"<<hour<<":"<<min<<":"<<sec<<"A.M\n";
}
void miltime()
{
cout<<"The Military time is"<<hour<<":"<<min<<":"<<sec<<" hours\n";
}
};
void main()
{
TIME A , B(13,25,30);
A .stdtime();
A.change(23);
A.miltime();
B.stdtime();
B.change(9);
B.miltime();
}
2.
class elevator
{
int CurrentFloor;
int GoingUp;
int GoingDown;
public:
elevator()
{
CurrentFloor=0;
GoingUp=1;
GoingDown=-1;
}
elevator(int floor)
{
CurrentFloor=floor;
GoingUp=1;
GoingDown=-1;
}
void goUp(int y)
{
if( CurrentFloor>3)
cout<<"\nNO MORE FLOORS\n";
else
CurrentFloor=CurrentFloor+y*GoingUp;
}
void goDown(int x)
{
if(CurrentFloor<0)
cout<<"\nNO MORE FLOORS";
else
CurrentFloor=CurrentFloor+x*GoingDown;
}
};
void main()
{
elevator A(1);
A.goUp(1);
A.goUp(1);
A.goUp(1);
A.goDown(1);
A.goDown(1);
}
Answer:
See explaination
Explanation:
Keep two iterators, i (for nuts array) and j (for bolts array).
while(i < n and j < n) {
if nuts[i] == bolts[j] {
We have a case where sizes match, output/return
}
else if nuts[i] < bolts[j] {
this means that size of nut is smaller than that of bolt and we should go to the next bigger nut, i.e., i+=1
}
else {
this means that size of bolt is smaller than that of nut and we should go to the next bigger bolt, i.e., j+=1
}
}
Since we go to each index in both the array only once, the algorithm take O(n) time.
Answer:
E-book : online edition of a new novel .
e-zine:online issue of today’s newspaper.
Online reference: online encyclopedia
blog: online website that posts restaurants reviews
Explanation:
Are you doing edge?
Also pleaseeeeeeeeeeeeeeeeeee mark me brainliest.
