EC > GATE 2015 SET-2 > Quantitative Aptitude
If a2+b2+c2=1, then ab+bc+ac lies in the interval
A
[1, 2/3]
B
[-1/2, 1]
C
[-1, 1/2]
D
[2, -4]

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