Computer Sciences > Gate 2017 Set-2 > Aptitude

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

The numbers of the roots of e^x + 0.5x² -2 = 0 in the range [-5, 5] are

A

1

B

0

C

2

D

3

Check Answer

Explanation

Correct : Aptitude

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?

Question #23 Medium

Which operations on a binary search tree have O(h) complexity?

Question #31 Easy

Compare search complexities of sorted array vs balanced BST.

Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science