Mining Engineering > GATE 2016 > Calculus

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

Sinh (x) is

A

(e^x-e^-x)/4

B

(e^x-e^-x)/2

C

(e^x+e^-x)/2

D

(e^x+e^-x)/4

Check Answer

Explanation

Correct : b

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