Answer:
Q = 424523.22 kw
Explanation:
k = 48.9 W/m - K
c = 0.115 KJ/kg- K
T_∞ = 35 degree celcius
velocity of air stream = 15 m/s
D = 40 cm
L = 200 cm
mass flow rate
solving for h
h = 675.6 kw/m^2K
Q = 675.6*2.513*(285-35)
Q = 424523.22 kw
Answer:
16-bit wide
Explanation:
In order to find the width of the address bus, we need first to know how many memory cells it is needed to address.
If the size memory is 64 KB, this means that the memory size, in bytes, is equal to the following quantity:
64 KB = 2⁶ * 2¹⁰ bytes = 2¹⁶ bytes.
In order to address this quantity of cell positions, the address bus must be able to address 2¹⁶ bytes, so it must have 16-bit wide.
Answer:
<em> - 14.943 W/m^2K ( negative sign indicates cooling ) </em>
Explanation:
Given data:
Area of FPC = 4 m^2
temp of water = 60°C
flow rate = 0.06 l/s
ambient temperature = 8°C
exit temperature = 49°C
<u>Calculate the overall heat loss coefficient </u>
Note : heat lost by water = heat loss through convection
m*Cp*dT = h*A * ( T - To )
∴ dT / T - To = h*A / m*Cp ( integrate the relation )
In ( 
) = h* 4 / ( 0.06 * 10^-3 * 1000 * 4180 )
In ( 41 / 52 ) = 0.0159*h
hence h = - 0.2376 / 0.0159
= - 14.943 W/m^2K ( heat loss coefficient )
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)
