EC > Gate 2013 SET-2 > Approximations

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

The maximum value of θ until which the approximation sin θ ≈ θ holds to within 10% error is

A

10°

B

18°

C

50°

D

90°

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