1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
ella [17]
2 years ago
8

Create a series of eight successive displacements that would program a robot to move in an octagonal path that is as close as yo

u can get to approximating a circle. The robot should return to its starting point after the eighth displacement. What total distance does the robot move? Calculate the radius of the circle that has this distance as its circumference.
Engineering
1 answer:
Komok [63]2 years ago
5 0

Answer:

bts biot bts biot jungkukkk

jungkukkkbiot

Explanation:

bts biot bts biot jungkukkk

jungkukkkbiot

You might be interested in
A completely reversible heat pump produces heat ata rate of 300 kW to warm a house maintained at 24°C. Theexterior air, which is
Triss [41]

Answer:

Change in entropy S = 0.061

Second law of thermodynamics is satisfied since there is an increase in entropy

Explanation:

Heat Q = 300 kW

T2 = 24°C = 297 K

T1 = 7°C = 280 K

Change in entropy =

S = Q(1/T1 - 1/T2)

= 300(1/280 - 1/297) = 0.061

There is a positive increase in entropy so the second law is satisfied.

6 0
3 years ago
A 50-lbm iron casting, initially at 700o F, is quenched in a tank filled with 2121 lbm of oil, initially at 80o F. The iron cast
insens350 [35]

Answer:

a) The final equilibrium temperature is 83.23°F

b) The entropy production within the system is 1.9 Btu/°R

Explanation:

See attached workings

8 0
3 years ago
Ultimate tensile strength is: (a) The stress at 0.2% strain (b) The stress at the onset of plastic deformation (c) The stress at
MissTica

Answer:

By definition the ultimate tensile strength is the maximum stress in the stress-strain deformation. The stress at 0.2% strain, the stress at the onset of plastic deformation, the stress at the end of the elastic deformation and the stress at the fracture correspond, by definition, to other points of the stress-strain curve.

Explanation:

4 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
2 years ago
A car accelerates from rest with an acceleration of 5 m/s^2. The acceleration decreases linearly with time to zero in 15 s, afte
Tpy6a [65]

Answer: At time 18.33 seconds it will have moved 500 meters.

Explanation:

Since the acceleration of the car is a linear function of time it can be written as a function of time as

a(t)=5(1-\frac{t}{15})

a=\frac{d^{2}x}{dt^{2}}\\\\\therefore \frac{d^{2}x}{dt^{2}}=5(1-\frac{t}{15})

Integrating both sides we get

\int \frac{d^{2}x}{dt^{2}}dt=\int 5(1-\frac{t}{15})dt\\\\\frac{dx}{dt}=v=5t-\frac{5t^{2}}{30}+c

Now since car starts from rest thus at time t = 0 ; v=0 thus c=0

again integrating with respect to time we get

\int \frac{dx}{dt}dt=\int (5t-\frac{5t^{2}}{30})dt\\\\x(t)=\frac{5t^{2}}{2}-\frac{5t^{3}}{90}+D

Now let us assume that car starts from origin thus D=0

thus in the first 15 seconds it covers a distance of

x(15)=2.5\times 15^{2}-\farc{15^{3}}{18}=375m

Thus the remaining 125 meters will be covered with a constant speed of

v(15)=5\times 15-\frac{15^{2}}{6}=37.5m/s

in time equalling t_{2}=\frac{125}{37.5}=3.33seconds

Thus the total time it requires equals 15+3.33 seconds

t=18.33 seconds

3 0
2 years ago
Other questions:
  • A converging-diverging nozzle is designed to operate with an exit Mach number of 1.75 . The nozzle is supplied from an air reser
    15·1 answer
  • What is the name of the model/shape below?
    5·2 answers
  • Water is contained in a rigid vessel of 5 m3 at a quality of 0.8 and a pressure of 1 MPa. If the pressure is reduced to 270.3 kP
    9·1 answer
  • What is kinetic energy?
    5·2 answers
  • Random question, does anyone here use Lego, do not answer unless that is a yes
    15·2 answers
  • The only way to know if a design will work in real-world conditions is to build a model, or prototype, based on the plan. This i
    7·2 answers
  • How can you contribute to achieved the mission of NSTP during pandemic in your society?
    7·1 answer
  • Explain the S.A. co-ordinate system used in surveying
    9·1 answer
  • Javier’s class visited a power plant near his city, and they learned how it produced electricity. What does this form of power d
    7·1 answer
  • the maximum load that a hori-zontal beam can carry is directly proportional to its width. if a beam 1.5 inches wide can support
    9·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!