×
Log in to StudySoup
Get Full Access to Discrete Mathematics And Its Applications - 7 Edition - Chapter 3.3 - Problem 14e
Join StudySoup for FREE
Get Full Access to Discrete Mathematics And Its Applications - 7 Edition - Chapter 3.3 - Problem 14e

Already have an account? Login here
×
Reset your password

There is a more efficient algorithm (in terms of the

Discrete Mathematics and Its Applications | 7th Edition | ISBN: 9780073383095 | Authors: Kenneth Rosen ISBN: 9780073383095 37

Solution for problem 14E Chapter 3.3

Discrete Mathematics and Its Applications | 7th Edition

  • Textbook Solutions
  • 2901 Step-by-step solutions solved by professors and subject experts
  • Get 24/7 help from StudySoup virtual teaching assistants
Discrete Mathematics and Its Applications | 7th Edition | ISBN: 9780073383095 | Authors: Kenneth Rosen

Discrete Mathematics and Its Applications | 7th Edition

4 5 1 297 Reviews
26
4
Problem 14E

Problem 14E

There is a more efficient algorithm (in terms of the number of multiplications and additions used) for evaluating polynomials than the conventional algorithm described in the previous exercise. It is called Horner's method. This pseudocode shows how to use this method to find the value of anxn + an-1xn-1+ … +a1x + a0 at x = c

procedure Honer(c, a0. a1 ,, an: real numbers)

y := an

for i := 1 to n

y := y * c + an−1

return y {y = ancn + an−1cn−1 + … + a1c + a0}

a)     Evaluate 3x2 + x + 1 at x = 2 by working through each step of the algorithm showing the values assigned at each assignment step.

b)    Exactly how many multiplications and additions are used by this algorithm to evaluate a polynomial of degree n at x = c? (Do not count additions used to increment the loop variable.)

Step-by-Step Solution:

Solution:

Step 1

In this problem we need to find the value of polynomial at   using the given algorithm.

Given algorithm :

procedure Honer(real numbers)

y :=

for i := 1 to n

y :=

return y {}

where the final value of y is the value of the polynomial at x = c.

Step 2 of 2

Chapter 3.3, Problem 14E is Solved
Textbook: Discrete Mathematics and Its Applications
Edition: 7
Author: Kenneth Rosen
ISBN: 9780073383095

This full solution covers the following key subjects: multiplications, Algorithm, additions, used, method. This expansive textbook survival guide covers 101 chapters, and 4221 solutions. Since the solution to 14E from 3.3 chapter was answered, more than 575 students have viewed the full step-by-step answer. Discrete Mathematics and Its Applications was written by and is associated to the ISBN: 9780073383095. This textbook survival guide was created for the textbook: Discrete Mathematics and Its Applications, edition: 7. The answer to “There is a more efficient algorithm (in terms of the number of multiplications and additions used) for evaluating polynomials than the conventional algorithm described in the previous exercise. It is called Horner's method. This pseudocode shows how to use this method to find the value of anxn + an-1xn-1+ … +a1x + a0 at x = cprocedure Honer(c, a0. a1 ,…, an: real numbers)y := anfor i := 1 to ny := y * c + an?1return y {y = ancn + an?1cn?1 + … + a1c + a0}a) Evaluate 3x2 + x + 1 at x = 2 by working through each step of the algorithm showing the values assigned at each assignment step.________________b) Exactly how many multiplications and additions are used by this algorithm to evaluate a polynomial of degree n at x = c? (Do not count additions used to increment the loop variable.)” is broken down into a number of easy to follow steps, and 147 words. The full step-by-step solution to problem: 14E from chapter: 3.3 was answered by , our top Math solution expert on 06/21/17, 07:45AM.

Other solutions

Discover and learn what students are asking








Statistics: Informed Decisions Using Data : Applications of the Normal Distribution
?If X is a normal random variable with mean 40 and standard deviation 10 and P(X > 45) = 0.3085, then P(X < 35) = _______ .





People also purchased

Related chapters

Unlock Textbook Solution

Enter your email below to unlock your verified solution to:

There is a more efficient algorithm (in terms of the