Mechanical Engineering > GATE 2014 SET-2 > Functions

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

The best approximation of the minimum value attained by e^−xsin(100x) for x ≥ 0 is _______

Check Answer

Explanation

Correct : −1

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