Answer:
A supercapacitor, also called an ultracapacitor, is a high-capacity capacitor with a capacitance value much higher than other capacitors, but with lower voltage limits, that bridges the gap between electrolytic capacitors and rechargeable batteries.
Explanation:
Answer:
See explaination
Explanation:
Please kindly check attachment for the step by step solution of the given problem.
Answer:
d. low earth orbit (LEO)
Explanation:
This type of satellites form a constellation deployed as a series of “necklaces” in such a way that at any time, at least one satellite is visible by a receiver antenna, compensating the movement due to the earth rotation.
Opposite to that, a geostationary satellite is at an altitude that makes it like a fixed point over the Earth´s equator, rotating synchronously with the Earth, so it is always visible in a given area.
Answer:
Out of the four options provided
option A. actuator
is correct
Explanation:
An actuator is the only device out of the four mentioned devices that provides power and ensures the motion in it in order to manipulate the movement of the moving parts of the damper or a valve used whereas others like ratio regulator are used to regulate air or gas ratio and none mof the 3 remaining options serves the purpose
Answer:
Codes for each of the problems are explained below
Explanation:
PROBLEM 1 IN C++:
#include<iostream>
using namespace std;
//fib function that calculate nth integer of the fibonacci sequence.
void fib(int n){
// l and r inital fibonacci values for n=1 and n=2;
int l=1,r=1,c;
//if n==1 or n==2 then print 1.
if(n==1 || n==2){
cout << 1;
return;
}
//for loop runs n-2 times and calculates nth integer of fibonacci sequence.
for(int i=0;i<n-2;i++){
c=l+r;
l=r;
r=c;
cout << "(" << i << "," << c << ") ";
}
//prints nth integer of the fibonacci sequence stored in c.
cout << "\n" << c;
}
int main(){
int n; //declared variable n
cin >> n; //inputs n to find nth integer of the fibonacci sequence.
fib(n);//calls function fib to calculate and print fibonacci number.
}
PROBLEM 2 IN PYTHON:
def fib(n):
print("fib({})".format(n), end=' ')
if n <= 1:
return n
else:
return fib(n - 1) + fib(n - 2)
if __name__ == '__main__':
n = int(input())
result = fib(n)
print()
print(result)
