Resposta:
44,76 Kwh
Explicació:
1 cavall = 746 watts
Per tant, 30 cavalls es convertiran en:
30 * 746 = 22380 watts
Temps = 2 hores
La quantitat d'energia consumida s'obté mitjançant la relació:
Energia consumida = Potència * temps
Energia consumida = 22380 watts * 2 hores
Energia consumida = 44760 Wh
A quilowatts (Kwh)
44760 Kwh / 1000 = 44,76 Kwh
Answer:
The algorithm to find A is even or odd.
- input A.
- Check the remainder on diving by 2 by A%2.
- If remainder is 1 then A is odd Print(Odd).
- If remainder is 0 print(Even).
Explanation:
To check if the number is even or odd we use modulo operator(%).Which gives the remainder on dividing.So if we do this A%2 it will give the remainder that will come out on dividing the value of A by 2.
So if the remainder comes out is 1 then the number is odd and if the remainder is 0 then the number is odd.
Answer:
He will temporarily have less money in his bank account.
Explanation:
Philip will have less money in his bank account at this time because he is considering modifying his motorcycle that costs approx $600, but his bike older and he also understands that he required a new bike in the next two years.
So, he decided to make an analysis table according to his choice and after that, he examines that if he tailored his bike at this time then he has a shortage of money at the time of purchasing a new bike.
Answer:
extends
Explanation:
When you create a subclass, you basically say "I'm creating a new class, but for now it will look and behave the same as that other class", then you add its own personality.
The syntax is:
class SubClass extends SuperClass
Where SubClass is your new subclass what inherits methods and variables from the SuperClass.
So, if you add nothing to the SubClass, it will be a carbon copy of the SuperClass. But you can add methods and variables exclusive to this SubClass that the SuperClass won't have.
Answer:
C++ code explained below
Explanation:
#include<bits/stdc++.h>
#include <iostream>
using namespace std;
int FiboNR(int n)
{
int max=n+1;
int F[max];
F[0]=0;F[1]=1;
for(int i=2;i<=n;i++)
{
F[i]=F[i-1]+F[i-2];
}
return (F[n]);
}
int FiboR(int n)
{
if(n==0||n==1)
return n;
else
return (FiboR(n-1)+FiboR(n-2));
}
int main()
{
long long int i,f;
double t1,t2;
int n[]={1,5,10,15,20,25,30,35,40,45,50,55,60,65,70,75};
cout<<"Fibonacci time analysis ( recursive vs. non-recursive "<<endl;
cout<<"Integer FiboR(seconds) FiboNR(seconds) Fibo-value"<<endl;
for(i=0;i<16;i++)
{
clock_t begin = clock();
f=FiboR(n[i]);
clock_t end = clock();
t1=double(end-begin); // elapsed time in milli secons
begin = clock();
f=FiboNR(n[i]);
end = clock();
t2=double(end-begin);
cout<<n[i]<<" "<<t1*1.0/CLOCKS_PER_SEC <<" "<<t2*1.0/CLOCKS_PER_SEC <<" "<<f<<endl; //elapsed time in seconds
}
return 0;
}
