Aerospace Engineering > GATE 2018 > Linear Algebra

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

Let →a →b be two distinct vectors that are not parallel. The vector →c=→a×→b

A

zero.

B

orthogonal to →a alone.

C

orthogonal to →a+→b.

D

orthogonal to →b alone.

Check Answer

Explanation

Correct : c

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