Given Information : Three different functions are given: Function-1: /clear1 function with a pointer variable and integer as arguments / void clear1 ( point p, int n) { //variable declaration int i,j; //traverse throughout the structure for(i=0;i<n;i++) for(j=0;j<3;j++) //multiply the point with velocity p[i].vel[j]=0; for(j=0;j<3;j++) //multiply the point with acceleration p[i].acc[j]=0; } } Function-2: /clear2 function with a pointer variable and integer as arguments / void clear2 ( point p, int n) { //variable declaration int i,j; //traverse throughout the structure for(i=0;i<n;i++) for(j=0;j<3;j++) //multiply the point with velocity p[i].vel[j]=0; //multiply the point with acceleration p[i].acc[j]=0; } Function-3: /clear3 function with a pointer variable and integer as arguments / void clear3 ( point *p, int n) { //variable declaration int i,j; //traverse throughout the structure for(j=0;j<3;i++) for(i=0;i<n;j++) //multiply the point with velocity p[i].vel[j]=0; for(i=0;i<n;j++) //multiply the point with acceleration p[i].acc[j]=0; } }

Question

Want to see the full answer?

Answer 1

Question

Chapter 6.2, Problem 6.8PP

Program Plan Intro

Given Information:

Three different functions are given:

Function-1:

/clear1 function with a pointer variable and integer as arguments /

void clear1 ( point p, int n)

{

//variable declaration

int i,j;

//traverse throughout the structure

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

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

//multiply the point with velocity

p[i].vel[j]=0;

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

//multiply the point with acceleration

p[i].acc[j]=0;

}

}

Function-2:

/clear2 function with a pointer variable and integer as arguments /

void clear2 ( point p, int n)

{

//variable declaration

int i,j;

//traverse throughout the structure

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

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

//multiply the point with velocity

p[i].vel[j]=0;

//multiply the point with acceleration

p[i].acc[j]=0;

}

Function-3:

/clear3 function with a pointer variable and integer as arguments /

void clear3 ( point *p, int n)

{

//variable declaration

int i,j;

//traverse throughout the structure

for(j=0;j<3;i++)

for(i=0;i<n;j++)

//multiply the point with velocity

p[i].vel[j]=0;

for(i=0;i<n;j++)

//multiply the point with acceleration

p[i].acc[j]=0;

}

}

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Problem 2: (Basic Problems: True or False) Specify the following state- ments are true (T) or false (F). Specify some BRIEF arguments (say, no more than 3 lines). • (2.1) Since Bayesian estimation only yields a posterior distribution, thus it is impossible for Bayesian estimation to suggest some single point estimation for parameter. • (2.2) MLE estimates views the parameter as deterministic and should work well in case your sample set is of small size. • (2.3) For rectangle matrix A, AA' and A' A are both non-negative definite, and have the same eigenvectors.

Problem No.1 Given: Eight (8) Queens and 8 x 8 chess board Goal: Arrange the 8 Queens in the 8 x 8 chess board as given in the layout above such that only one (1) Queen will be placed in any column, row, and diagonal/s. That is, no two or more Queens are placed in any column, row, and diagonal/s. Solve the problem set by the giving the solution, which is the sequence of steps, that will satisfy the goal. NOTE: The respective Queens are move in their column location only. For example, QA is move along column A, QB column B, and so on. However, you need to give the remaining moves to attain the required goal. Set the column labels from left to right A, B, C, D, E, F, G, and H, respectively. Set the row labels from top to bottom 8, 7, 6, 5, 4, 3, 2, and 1, respectively.

I want the solution for problem 1, 2 and 3