Answer:
It looks like... A machine that reads electric pulse and surge... Not sure though.
Explanation:
Answer:
32000 bits/seconds
Explanation:
Given that :
there are 16 signal combinations (states) = 2⁴
bits n = 4
and a baud rate (number of signals/second) = 8000/second
Therefore; the number of bits per seconds can be calculated as follows:
Number of bits per seconds = bits n × number of signal per seconds
Number of bits per seconds = 4 × 8000/second
Number of bits per seconds = 32000 bits/seconds
Answer:
Going green means increasing one's initiatives toward a concern for the environment.
Explanation:
Going green involves all the knowledge and practices that can lead to more environmentally friendly and ecologically responsible decisions and lifestyles, which would protect and sustain the natural resources present in the environment for both present and future generations.
Answer:
Ponding will occur in 40mins
Explanation:
We say that the infiltration rate is the velocity or speed at which water enters into the soil. This often times is measured by the depth (in mm) of the water layer that can enter the soil in one hour. An infiltration rate of 15 mm/hour means that a water layer of 15 mm on the soil surface, will take one hour to infiltrate.
Consider checking attachment for the step by step solution.
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)
