Computer Science, asked by khemchandanidivisha, 2 days ago

✔Given an expression Each of the following expressions is intended to evaluate the above given expression. Some are correct while others are not. Classify each as being correct or incorrect. For those that are incorrect, give the reason(s). (a) (a*x*x+b)/(c* x + d) (b) (a * Math.pow(x, 2) + b)/(c* x + d) (c) ((a) (x) (x) + (b))/((c) (x) + d) (d) (b+x* (x* (a)))/(d+x* (c)) (e) (a) * Math.pow(x, 2) + (b)/((c) * (x) + d) () (a* (x * x)) + (b)/c* (x) + d
wrong answer will be reported
write answer will mark brainliest
answer​

Answers

Answered by XItzBabeX
2

Answer:

Binary search is a more efficient search algorithm which relies on the elements in the list being sorted. We apply the same search process to progressively smaller sub-lists of the original list, starting with the whole list and approximately halving the search area every time.

Answered by jungkook192007
0

Explanation:

Given an expression Each of the following expressions is intended to evaluate the above given expression. Some are correct while others are not. Classify each as being correct or incorrect. For those that are incorrect, give the reason(s). (a) (a*x*x+b)/(c* x + d) (b) (a * Math.pow(x, 2) + b)/(c* x + d) (c) ((a) (x) (x) + (b))/((c) (x) + d) (d) (b+x* (x* (a)))/(d+x* (c)) (e) (a) * Math.pow(x, 2) + (b)/((c) * (x) + d) () (a* (x * x)) + (b)/c* (x) + d

wrong answer will be reported

write answer will mark brainliest

answer

Similar questions