Mechanical Engineering > GATE 2015 SET-2 > Calculus

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

At x = 0, the function f(x) = |x| has

A

a minimum

B

a maximum

C

a point of inflexion

D

neither a maximum nor minimum

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