menu
QAmmunity.org
Login
Register
My account
Edit my Profile
Private messages
My favorites
Ask a Question
Questions
Unanswered
Tags
Categories
Ask a Question
exactly how many multiplication's and additions are used to evaluate a polynomial of degree n at x = c?
asked
Mar 3, 2017
17.6k
views
2
votes
exactly how many multiplication's and additions are used to evaluate a polynomial of degree n at x = c?
Computers and Technology
high-school
Tristan Tran
asked
by
Tristan Tran
7.1k
points
answer
comment
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
5
votes
multiplication and addition and all other operators and their order and handled by using " order and precedence "
Nijogeorgep
answered
Mar 10, 2017
by
Nijogeorgep
7.9k
points
ask related question
comment
share this
0 Comments
Please
log in
or
register
to add a comment.
← Prev Question
Next Question →
Related questions
asked
Feb 7, 2024
80.5k
views
There is a more efficient algorithm (in terms of the number of multiplications and additions used) for evaluating polynomials than the conventional algorithm. It is called Horner's method. This pseudocode
Patkil
asked
Feb 7, 2024
by
Patkil
7.9k
points
Mathematics
high-school
1
answer
4
votes
80.5k
views
asked
Sep 20, 2024
177k
views
Consider the following algorithm segment. Assume that n is a positive integer. max := a[5] for i:= 6 ton if max < a[i] then max := a[i] next i (a) What is the actual number of elementary operations (additions, subtractions, multiplications, divisions, and comparisons) that are performed when the algorithm segment is executed? For simplicity, count only comparisons that occur within if-then statements, and ignore those implied by for-next loops. To find the answer, it may be helpful to review Example 11.3.3 and the solutions to Exercise 11.3.11a and Exercise 11.3.14a. Express your answer in terms of n. The number of operations is 2n – 16 (b) Apply the theorem on polynomial orders to the expression in part (a) to find that an order for the algorithm segment is n'
Evsheino
asked
Sep 20, 2024
by
Evsheino
8.1k
points
Computers and Technology
high-school
1
answer
1
vote
177k
views
asked
Mar 21, 2024
193k
views
There is a more efficient algorithm (in terms of the number of multiplications and additions used) for eval- uating polynomials than the conventional algorithm de- scribed in the previous exercise. It
BigBugCreator
asked
Mar 21, 2024
by
BigBugCreator
7.4k
points
Mathematics
college
1
answer
4
votes
193k
views
Ask a Question
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.
9.5m
questions
12.2m
answers
Other Questions
“What does it mean when we “rework” copyrighted material?”
The book shows how to add and subtract binary and decimal numbers. However, other numbering systems are also very popular when dealing with computers. The octal (base 8) numbering system is one of these.
Seven basic internal components found in a computer tower
Please help me ! All you do is just put it it all in your own words ! Please this is for my reported card!i don't know how to put it in my own words because my English is not that good!
describe an advance in technology that makes life more enjoyable. what discoveries contribute to this technology?
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
Search QAmmunity.org