Mechanical Engineering > GATE 2016 SET-2 > Quantitative Aptitude
The binary operation ☐ is defined as a ☐ b = ab + (a+b) where a and b are any two real numbers. The value of the identity element of this operation, defined as the number x such that a ☐ x = a, for any a, is
A
0
B
1
C
2
D
10

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