Algorithms - Algorithm Design Techniques
- Option : A
- Explanation : p(x) = a0 + a1x + a2x2 + a3x3 p(x) = a0 + (Ca3x + a2)x + a)x t = cl3* x t = t + a2 t = t * x t = t + a1 t = t * x t = t + a0 So minimum 3 multiplication are needed to e valuate P.
- Option : B
- Explanation : I n Bellman Ford shortest path algorithm, we choose a node first and then we find any negative weighted cycle is reachable from source.
