EC > GATE 2014 SET-2 > Calculus

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

For 0 ≤ t < ∞, the maximum value of the function f(t) = e^-t - 2 e^-2t occurs at

A

t = log_e 4

B

t = log_e 2

C

t = 0

D

t = log_e 8

Check Answer

Explanation

Correct : a

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