Algorithms | Divide and Conquer | Question 3

Last Updated :
Discuss
Comments
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:
3
4
6
9

This question is part of this quiz :

Top MCQs on Divide and Conquer Algorithm with Answers
Tags:
DSA Quiz
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy