What forced induction device is more efficient?

thier only motto and goal is to work for society and not make any profits A.small business entreprenuership B.scalable start up

sweet-ann [11.9K]

Answer:

social entrepreneurship

8 0

3 years ago

Read 2 more answers

Multiple Choice

ra1l [238]

I need more details to your question

4 0

2 years ago

Read 2 more answers

1. A glass window of width W = 1 m and height H = 2 m is 5 mm thick and has a thermal conductivity of kg = 1.4 W/m*K. If the inn

emmasim [6.3K]

Answer:

1. $\dot Q=19600\ W$

2. $\dot Q=120\ W$

Explanation:

1.

Given:

height of the window pane, $h=2\ m$

width of the window pane, $w=1\ m$

thickness of the pane, $t=5\ mm= 0.005\ m$

thermal conductivity of the glass pane, $k_g=1.4\ W.m^{-1}.K^{-1}$

temperature of the inner surface, $T_i=15^{\circ}C$

temperature of the outer surface, $T_o=-20^{\circ}C$

<u>According to the Fourier's law the rate of heat transfer is given as:</u>

$\dot Q=k_g.A.\frac{dT}{dx}$

here:

A = area through which the heat transfer occurs = $2\times 1=2\ m^2$

dT = temperature difference across the thickness of the surface = $35^{\circ}C$

dx = t = thickness normal to the surface = $0.005\ m$

$\dot Q=1.4\times 2\times \frac{35}{0.005}$

$\dot Q=19600\ W$

2.

air spacing between two glass panes, $dx=0.01\ m$

area of each glass pane, $A=2\times 1=2\ m^2$

thermal conductivity of air, $k_a=0.024\ W.m^{-1}.K^{-1}$

temperature difference between the surfaces, $dT=25^{\circ}C$

<u>Assuming layered transfer of heat through the air and the air between the glasses is always still:</u>

$\dot Q=k_a.A.\frac{dT}{dx}$

$\dot Q=0.024\times 2\times \frac{25}{0.01}$

$\dot Q=120\ W$

5 0

3 years ago

g For this project you are required to perform Matrix operations (Addition, Subtraction and Multiplication). For each of the ope

Kruka [31]

Answer:

C++ code is explained below

Explanation:

#include<iostream>

using namespace std;

//Function Declarations

void add();

void sub();

void mul();

//Main Code Displays Menu And Take User Input

int main()

{

int choice;

cout << "\nMenu";

cout << "\nChoice 1:addition";

cout << "\nChoice 2:subtraction";

cout << "\nChoice 3:multiplication";

cout << "\nChoice 0:exit";

cout << "\n\nEnter your choice: ";

cin >> choice;

cout << "\n";

switch(choice)

{

case 1: add();

break;

case 2: sub();

break;

case 3: mul();

break;

case 0: cout << "Exited";

exit(1);

default: cout << "Invalid";

}

main();

}

//Addition Of Matrix

void add()

{

int rows1,cols1,i,j,rows2,cols2;

cout << "\nmatrix1 # of rows: ";

cin >> rows1;

cout << "\nmatrix1 # of columns: ";

cin >> cols1;

int m1[rows1][cols1];

//Taking First Matrix

for(i=0;i<rows1;i++)

for(j=0;j<cols1;j++)

{

cout << "\nEnter element (" << i << "," << j << "): ";

cin >> m1[i][j];

cout << "\n";

}

//Printing 1st Matrix

for(i=0;i<rows1;i++)

{

for(j=0;j<cols1;j++)

cout << m1[i][j] << " ";

cout << "\n";

}

cout << "\nmatrix2 # of rows: ";

cin >> rows2;

cout << "\nmatrix2 # of columns: ";

cin >> cols2;

int m2[rows2][cols2];

//Taking Second Matrix

for(i=0;i<rows2;i++)

for(j=0;j<cols2;j++)

{

cout << "\nEnter element (" << i << "," << j << "): ";

cin >> m2[i][j];

cout << "\n";

}

//Displaying second Matrix

cout << "\n";

for(i=0;i<rows2;i++)

{

for(j=0;j<cols2;j++)

cout << m2[i][j] << " ";

cout << "\n";

}

//Displaying Sum of m1 & m2

if(rows1 == rows2 && cols1 == cols2)

{

cout << "\n";

for(i=0;i<rows1;i++)

{

for(j=0;j<cols1;j++)

cout << m1[i][j]+m2[i][j] << " ";

cout << "\n";

}

else

cout << "operation is not supported";

main();

}

void sub()

{

int rows1,cols1,i,j,k,rows2,cols2;

cout << "\nmatrix1 # of rows: ";

cin >> rows1;

cout << "\nmatrix1 # of columns: ";

cin >> cols1;

int m1[rows1][cols1];

for(i=0;i<rows1;i++)

for(j=0;j<cols1;j++)

{

cout << "\nEnter element (" << i << "," << j << "): ";

cin >> m1[i][j];

cout << "\n";

}

for(i=0;i<rows1;i++)

{

for(j=0;j<cols1;j++)

cout << m1[i][j] << " ";

cout << "\n";

}

cout << "\nmatrix2 # of rows: ";

cin >> rows2;

cout << "\nmatrix2 # of columns: ";

cin >> cols2;

int m2[rows2][cols2];

for(i=0;i<rows2;i++)

for(j=0;j<cols2;j++)

{

cout << "\nEnter element (" << i << "," << j << "): ";

cin >> m2[i][j];

cout << "\n";

}

for(i=0;i<rows2;i++)

{

for(j=0;j<cols2;j++)

cout << m1[i][j] << " ";

cout << "\n";

}

cout << "\n";

//Displaying Subtraction of m1 & m2

if(rows1 == rows2 && cols1 == cols2)

{

for(i=0;i<rows1;i++)

{

for(j=0;j<cols1;j++)

cout << m1[i][j]-m2[i][j] << " ";

cout << "\n";

}

else

cout << "operation is not supported";

main();

}

void mul()

{

int rows1,cols1,i,j,k,rows2,cols2,mul[10][10];

cout << "\nmatrix1 # of rows: ";

cin >> rows1;

cout << "\nmatrix1 # of columns: ";

cin >> cols1;

int m1[rows1][cols1];

for(i=0;i<rows1;i++)

for(j=0;j<cols1;j++)

{

cout << "\nEnter element (" << i << "," << j << "): ";

cin >> m1[i][j];

cout << "\n";

}

cout << "\n";

for(i=0;i<rows1;i++)

{

for(j=0;j<cols1;j++)

cout << m1[i][j] << " ";

cout << "\n";

}

cout << "\nmatrix2 # of rows: ";

cin >> rows2;

cout << "\nmatrix2 # of columns: ";

cin >> cols2;

int m2[rows2][cols2];

for(i=0;i<rows2;i++)

for(j=0;j<cols2;j++)

{

cout << "\nEnter element (" << i << "," << j << "): ";

cin >> m2[i][j];

cout << "\n";

}

cout << "\n";

//Displaying Matrix 2

for(i=0;i<rows2;i++)

{

for(j=0;j<cols2;j++)

cout << m2[i][j] << " ";

cout << "\n";

}

if(cols1!=rows2)

cout << "operation is not supported";

else

{

//Initializing results as 0

for(i = 0; i < rows1; ++i)

for(j = 0; j < cols2; ++j)

mul[i][j]=0;

// Multiplying matrix m1 and m2 and storing in array mul.

for(i = 0; i < rows1; i++)

for(j = 0; j < cols2; j++)

for(k = 0; k < cols1; k++)

mul[i][j] += m1[i][k] * m2[k][j];

// Displaying the result.

cout << "\n";

for(i = 0; i < rows1; ++i)

for(j = 0; j < cols2; ++j)

{

cout << " " << mul[i][j];

if(j == cols2-1)

cout << endl;

}

main();

}

5 0

3 years ago

3. In the text, we described a multithreaded file server, showing why it is better than a single-threaded server and a finite-st

NemiM [27]

Answer and Explanation:

• 1 thread awaits the incoming request

• 1 thread responds to the request

• 1 thread reads the hard disk

A multithreaded file server is better than a single-threaded server and a finite-state machine server because it provides better response compared to the rest and can make use of the shared Web data.

Yes, there are circumstances in which a single-threaded server might be better. If it is designed such that:

- the server is completely CPU bound, such that multiple threads isn't needed. But it would account for some complexity that aren't needed.

An example is, the assistance number of a telephone directory (e.g 7771414) for an community of say, one million people. Consider that each name and telephone number record is sixty-four characters, the whole database takes 64 MB, and can be easily stored in the server's memory in order to provide quick lookup.

NOTE:

Multiple threads lead to operation slow down and no support for Kernel threads.

4 0

3 years ago