Algorithms | Divide and Conquer | Question 3

Consider the polynomial p(x) = a0 + a1x + a2x^2 +a3x^3, where ai != 0, for all i. The minimum number of multiplications needed to evaluate p on an input x is:
(A) 3
(B) 4
(C) 6
(D) 9

Answer: (A)
Explanation: Multiplications can be minimized using following order for evaluation of the given expression.
p(x) = a0 + x(a1 + x(a2 + a3x))
Quiz of this Question

Article Tags :

DSA Quiz

Algorithms-Divide and Conquer

Recommended Articles

1. Algorithms | Divide and Conquer | Question 6

2. Algorithms | Divide and Conquer | Question 2

3. Algorithms | Divide and Conquer | Question 4

4. Algorithms | Divide and Conquer | Question 5

5. Algorithms | Divide and Conquer | Question 6

6. Advantages and Disadvantages of Divide and Conquer Algorithms

7. Algorithms | Analysis of Algorithms (Recurrences) | Question 1

8. Algorithms | Analysis of Algorithms (Recurrences) | Question 2

9. Algorithms | Analysis of Algorithms | Question 2

10. Algorithms | Analysis of Algorithms | Question 3

11. Algorithms | Analysis of Algorithms | Question 4

12. Algorithms | Analysis of Algorithms | Question 5

13. Algorithms | Analysis of Algorithms | Question 19

14. Algorithms | Analysis of Algorithms (Recurrences) | Question 4

15. Algorithms | Analysis of Algorithms | Question 8

16. Algorithms | Analysis of Algorithms | Question 9

17. Algorithms | Analysis of Algorithms | Question 10

18. Algorithms | Analysis of Algorithms | Question 11

19. Algorithms | Analysis of Algorithms | Question 12

20. Algorithms | Analysis of Algorithms (Recurrences) | Question 11

21. Algorithms | Analysis of Algorithms (Recurrences) | Question 6

22. Algorithms | Analysis of Algorithms | Question 13

23. Algorithms | Analysis of Algorithms (Recurrences) | Question 7

24. Algorithms | Analysis of Algorithms (Recurrences) | Question 8

25. Algorithms | Analysis of Algorithms | Question 15