Chapter 4, Problem 54C

Question

Want to see the full answer?

Answer 1

Expert Solution & Answer

Chapter 4, Problem 54C

Explanation of Solution

a.

Simple method to compute p(x):

Let us consider the “p(x)” polynomial of degree “n”.

The method to compute the polynomial of degree is given below:

//Define the simplePolynomial() method

public static double simplePolynomial(double a[], double n)

{

//Declare the variable

double sum = 0;

//Loop executes until the length of array

for(int i=0; i<a.length; i++)

//Compute the polynomial of degree

sum = sum + a[i] * Math.pow(n, a.length - i - 1);

//Return the polynomial of degree

return sum;

}

Running time:

In the above code, the computation of polynomial of degree is given below:

For each and every array term,

a[0] is “0” operation.

a[1]× x is “1” operation.

a[2]× x × x is “2” operations.

a[3]× x × x × x is “3” operations

Explanation of Solution

b.

Method to compute p(x) in O(n(logn)) time:

Let us consider the “p(x)” polynomial of degree “n”.

The method to compute the polynomial of degree is given below:

//Define the Polynomial() method

public static double Polynomial(double a[], double n)

{

//Declare the variable

double sum = 0;

int i=0;

//Loop executes until the length of array

while(i<a.length)

{

//Compute the polynomial of degree

sum = sum + a[i] * Math.pow(n, a.length - i - 1);

//Increment "i" by "1"

i = i++;

}

//Return the polynomial of degree

return sum;

}

Running time:

In the above code, the computation of polynomial of degree is given below:

For each and every array term,

a[0] is “0” operation.

a[1]× x is “1” operation

Explanation of Solution

c.

Horner method to compute p(x):

Let us consider the “p(x)” polynomial of degree “n”.

The method to compute the polynomial of degree is given below:

//Define the HornerPolynomial() method

public static double HornerPolynomial(double a[],double n)

{

//Declare the variable

double sum = 0;

//Loop executes until the length of array

for(int i=1;i< a

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

NO USE OF AI PLEASE

Minimum Study Hours per Week per Class Grade 15 A 12 B 9 C 6 D 0 F Application must be menu driven, and contain the following options: A. Determine Hours to Study B. Determine Grade C. Display Averages and Totals D. Quit Note: The user must be able to select any menu option in any order they want. And only exits the application when they choose. Menu option A -- Determine Hours to Study The program will READ in data from a text file named StudyHours.txt. This text file is created by you and will be submitted with your project. Your file must include 5 additional records in addition to the example at the end of this document (10 total). StudyHours.txt contains the following format: First line: Full name Second line: Number of credits Third line: Grade desired for each class The user must correct any bad data in the application. For example, if the file contains a letter grade of 'K', which is not a possible letter grade, they are asked to correct the information. You DO NOT need to…

NO AI USE PLEASE

Answer 2

Expert Solution & Answer

Chapter 4, Problem 54C

Explanation of Solution

a.

Simple method to compute p(x):

Let us consider the “p(x)” polynomial of degree “n”.

The method to compute the polynomial of degree is given below:

//Define the simplePolynomial() method

public static double simplePolynomial(double a[], double n)

{

//Declare the variable

double sum = 0;

//Loop executes until the length of array

for(int i=0; i<a.length; i++)

//Compute the polynomial of degree

sum = sum + a[i] * Math.pow(n, a.length - i - 1);

//Return the polynomial of degree

return sum;

}

Running time:

In the above code, the computation of polynomial of degree is given below:

For each and every array term,

a[0] is “0” operation.

a[1]× x is “1” operation.

a[2]× x × x is “2” operations.

a[3]× x × x × x is “3” operations

Explanation of Solution

b.

Method to compute p(x) in O(n(logn)) time:

Let us consider the “p(x)” polynomial of degree “n”.

The method to compute the polynomial of degree is given below:

//Define the Polynomial() method

public static double Polynomial(double a[], double n)

{

//Declare the variable

double sum = 0;

int i=0;

//Loop executes until the length of array

while(i<a.length)

{

//Compute the polynomial of degree

sum = sum + a[i] * Math.pow(n, a.length - i - 1);

//Increment "i" by "1"

i = i++;

}

//Return the polynomial of degree

return sum;

}

Running time:

In the above code, the computation of polynomial of degree is given below:

For each and every array term,

a[0] is “0” operation.

a[1]× x is “1” operation

Explanation of Solution

c.

Horner method to compute p(x):

Let us consider the “p(x)” polynomial of degree “n”.

The method to compute the polynomial of degree is given below:

//Define the HornerPolynomial() method

public static double HornerPolynomial(double a[],double n)

{

//Declare the variable

double sum = 0;

//Loop executes until the length of array

for(int i=1;i< a

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 3

Expert Solution & Answer

Chapter 4, Problem 54C

Explanation of Solution

a.

Simple method to compute p(x):

Let us consider the “p(x)” polynomial of degree “n”.

The method to compute the polynomial of degree is given below:

//Define the simplePolynomial() method

public static double simplePolynomial(double a[], double n)

{

//Declare the variable

double sum = 0;

//Loop executes until the length of array

for(int i=0; i<a.length; i++)

//Compute the polynomial of degree

sum = sum + a[i] * Math.pow(n, a.length - i - 1);

//Return the polynomial of degree

return sum;

}

Running time:

In the above code, the computation of polynomial of degree is given below:

For each and every array term,

a[0] is “0” operation.

a[1]× x is “1” operation.

a[2]× x × x is “2” operations.

a[3]× x × x × x is “3” operations

Explanation of Solution

b.

Method to compute p(x) in O(n(logn)) time:

Let us consider the “p(x)” polynomial of degree “n”.

The method to compute the polynomial of degree is given below:

//Define the Polynomial() method

public static double Polynomial(double a[], double n)

{

//Declare the variable

double sum = 0;

int i=0;

//Loop executes until the length of array

while(i<a.length)

{

//Compute the polynomial of degree

sum = sum + a[i] * Math.pow(n, a.length - i - 1);

//Increment "i" by "1"

i = i++;

}

//Return the polynomial of degree

return sum;

}

Running time:

In the above code, the computation of polynomial of degree is given below:

For each and every array term,

a[0] is “0” operation.

a[1]× x is “1” operation

Explanation of Solution

c.

Horner method to compute p(x):

Let us consider the “p(x)” polynomial of degree “n”.

The method to compute the polynomial of degree is given below:

//Define the HornerPolynomial() method

public static double HornerPolynomial(double a[],double n)

{

//Declare the variable

double sum = 0;

//Loop executes until the length of array

for(int i=1;i< a

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 4

Expert Solution & Answer

Chapter 4, Problem 54C

Explanation of Solution

a.

Simple method to compute p(x):

Let us consider the “p(x)” polynomial of degree “n”.

The method to compute the polynomial of degree is given below:

//Define the simplePolynomial() method

public static double simplePolynomial(double a[], double n)

{

//Declare the variable

double sum = 0;

//Loop executes until the length of array

for(int i=0; i<a.length; i++)

//Compute the polynomial of degree

sum = sum + a[i] * Math.pow(n, a.length - i - 1);

//Return the polynomial of degree

return sum;

}

Running time:

In the above code, the computation of polynomial of degree is given below:

For each and every array term,

a[0] is “0” operation.

a[1]× x is “1” operation.

a[2]× x × x is “2” operations.

a[3]× x × x × x is “3” operations

Explanation of Solution

b.

Method to compute p(x) in O(n(logn)) time:

Let us consider the “p(x)” polynomial of degree “n”.

The method to compute the polynomial of degree is given below:

//Define the Polynomial() method

public static double Polynomial(double a[], double n)

{

//Declare the variable

double sum = 0;

int i=0;

//Loop executes until the length of array

while(i<a.length)

{

//Compute the polynomial of degree

sum = sum + a[i] * Math.pow(n, a.length - i - 1);

//Increment "i" by "1"

i = i++;

}

//Return the polynomial of degree

return sum;

}

Running time:

In the above code, the computation of polynomial of degree is given below:

For each and every array term,

a[0] is “0” operation.

a[1]× x is “1” operation

Explanation of Solution

c.

Horner method to compute p(x):

Let us consider the “p(x)” polynomial of degree “n”.

The method to compute the polynomial of degree is given below:

//Define the HornerPolynomial() method

public static double HornerPolynomial(double a[],double n)

{

//Declare the variable

double sum = 0;

//Loop executes until the length of array

for(int i=1;i< a

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 5

Expert Solution & Answer

Answer 6

Expert Solution & Answer

Answer 7

Chapter 4, Problem 54C

Explanation of Solution

a.

Simple method to compute p(x):

Let us consider the “p(x)” polynomial of degree “n”.

The method to compute the polynomial of degree is given below:

//Define the simplePolynomial() method

public static double simplePolynomial(double a[], double n)

{

//Declare the variable

double sum = 0;

//Loop executes until the length of array

for(int i=0; i<a.length; i++)

//Compute the polynomial of degree

sum = sum + a[i] * Math.pow(n, a.length - i - 1);

//Return the polynomial of degree

return sum;

}

Running time:

In the above code, the computation of polynomial of degree is given below:

For each and every array term,

a[0] is “0” operation.

a[1]× x is “1” operation.

a[2]× x × x is “2” operations.

a[3]× x × x × x is “3” operations

Explanation of Solution

b.

Method to compute p(x) in O(n(logn)) time:

Let us consider the “p(x)” polynomial of degree “n”.

The method to compute the polynomial of degree is given below:

//Define the Polynomial() method

public static double Polynomial(double a[], double n)

{

//Declare the variable

double sum = 0;

int i=0;

//Loop executes until the length of array

while(i<a.length)

{

//Compute the polynomial of degree

sum = sum + a[i] * Math.pow(n, a.length - i - 1);

//Increment "i" by "1"

i = i++;

}

//Return the polynomial of degree

return sum;

}

Running time:

In the above code, the computation of polynomial of degree is given below:

For each and every array term,

a[0] is “0” operation.

a[1]× x is “1” operation

Explanation of Solution

c.

Horner method to compute p(x):

Let us consider the “p(x)” polynomial of degree “n”.

The method to compute the polynomial of degree is given below:

//Define the HornerPolynomial() method

public static double HornerPolynomial(double a[],double n)

{

//Declare the variable

double sum = 0;

//Loop executes until the length of array

for(int i=1;i< a

Answer 8

Chapter 4, Problem 54C

Explanation of Solution

a.

Simple method to compute p(x):

Let us consider the “p(x)” polynomial of degree “n”.

The method to compute the polynomial of degree is given below:

//Define the simplePolynomial() method

public static double simplePolynomial(double a[], double n)

{

//Declare the variable

double sum = 0;

//Loop executes until the length of array

for(int i=0; i<a.length; i++)

//Compute the polynomial of degree

sum = sum + a[i] * Math.pow(n, a.length - i - 1);

//Return the polynomial of degree

return sum;

}

Running time:

In the above code, the computation of polynomial of degree is given below:

For each and every array term,

a[0] is “0” operation.

a[1]× x is “1” operation.

a[2]× x × x is “2” operations.

a[3]× x × x × x is “3” operations

Answer 9

Chapter 4, Problem 54C

Explanation of Solution

a.

Simple method to compute p(x):

Let us consider the “p(x)” polynomial of degree “n”.

The method to compute the polynomial of degree is given below:

//Define the simplePolynomial() method

public static double simplePolynomial(double a[], double n)

{

//Declare the variable

double sum = 0;

//Loop executes until the length of array

for(int i=0; i<a.length; i++)

//Compute the polynomial of degree

sum = sum + a[i] * Math.pow(n, a.length - i - 1);

//Return the polynomial of degree

return sum;

}

Running time:

In the above code, the computation of polynomial of degree is given below:

For each and every array term,

a[0] is “0” operation.

a[1]× x is “1” operation.

a[2]× x × x is “2” operations.

a[3]× x × x × x is “3” operations

Answer 10

Explanation of Solution

b.

Method to compute p(x) in O(n(logn)) time:

Let us consider the “p(x)” polynomial of degree “n”.

The method to compute the polynomial of degree is given below:

//Define the Polynomial() method

public static double Polynomial(double a[], double n)

{

//Declare the variable

double sum = 0;

int i=0;

//Loop executes until the length of array

while(i<a.length)

{

//Compute the polynomial of degree

sum = sum + a[i] * Math.pow(n, a.length - i - 1);

//Increment "i" by "1"

i = i++;

}

//Return the polynomial of degree

return sum;

}

Running time:

In the above code, the computation of polynomial of degree is given below:

For each and every array term,

a[0] is “0” operation.

a[1]× x is “1” operation

Answer 11

Explanation of Solution

b.

Method to compute p(x) in O(n(logn)) time:

Let us consider the “p(x)” polynomial of degree “n”.

The method to compute the polynomial of degree is given below:

//Define the Polynomial() method

public static double Polynomial(double a[], double n)

{

//Declare the variable

double sum = 0;

int i=0;

//Loop executes until the length of array

while(i<a.length)

{

//Compute the polynomial of degree

sum = sum + a[i] * Math.pow(n, a.length - i - 1);

//Increment "i" by "1"

i = i++;

}

//Return the polynomial of degree

return sum;

}

Running time:

In the above code, the computation of polynomial of degree is given below:

For each and every array term,

a[0] is “0” operation.

a[1]× x is “1” operation

Answer 12

Explanation of Solution

c.

Horner method to compute p(x):

Let us consider the “p(x)” polynomial of degree “n”.

The method to compute the polynomial of degree is given below:

//Define the HornerPolynomial() method

public static double HornerPolynomial(double a[],double n)

{

//Declare the variable

double sum = 0;

//Loop executes until the length of array

for(int i=1;i< a

Answer 13

Explanation of Solution

c.

Horner method to compute p(x):

Let us consider the “p(x)” polynomial of degree “n”.

The method to compute the polynomial of degree is given below:

//Define the HornerPolynomial() method

public static double HornerPolynomial(double a[],double n)

{

//Declare the variable

double sum = 0;

//Loop executes until the length of array

for(int i=1;i< a

Answer 14

Expert Solution & Answer

Answer 15

Expert Solution & Answer

Answer 16

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 17

Chapter 4, Problem 1R Chapter 4, Problem 2R Chapter 4, Problem 3R Chapter 4, Problem 4R Chapter 4, Problem 5R Chapter 4, Problem 6R Chapter 4, Problem 7R Chapter 4, Problem 8R Chapter 4, Problem 9R Chapter 4, Problem 10R

Chapter 4, Problem 54C

Solution Summary: The author explains the simple method to compute the polynomial of degree.

Concept explainers

Explanation of Solution

Explanation of Solution

Explanation of Solution

Want to see the full answer?

Chapter 4 Solutions