Mining Engineering > GATE 2021 > Aptitude
⊙ and ⊕ are two operators on numbers p and q such that
p⊙q=p-q, and p⊕q=p×q
Then, (9⊙(6⊕7))⊙(7⊕(6⊙5))=
A
40
B
-26
C
-33
D
-40

Explanation

Correct : d

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