Find the output of the following code.
#include <bits/stdc++.h>
using namespace std;
void crossP(int A[], int B[], int cross[])
{
cross[0] = A[1] * B[2] - A[2] * B[1];
cross[1] = A[0] * B[2] - A[2] * B[0];
cross[2] = A[0] * B[1] - A[1] * B[0];
}
int main()
{
int A[] = { 1, 2, 4 };
int B[] = { 2, 3, 2 };
int cross[3];
crossP(A, B, cross);
for (int i = 0; i < 3; i++)
cout << cross[i] << " ";
return 0;
}
#include <bits/stdc++.h>
using namespace std;
void crossP(int A[], int B[], int cross[])
{
cross[0] = A[1] * B[2] - A[2] * B[1];
cross[1] = A[0] * B[2] - A[2] * B[0];
cross[2] = A[0] * B[1] - A[1] * B[0];
}
int main()
{
int A[] = { 1, 2, 4 };
int B[] = { 2, 3, 2 };
int cross[3];
crossP(A, B, cross);
for (int i = 0; i < 3; i++)
cout << cross[i] << " ";
return 0;
}A. 1 2 5
B. -1 -5 -3
C. -6 -8 -1
D. -8 -6 -1
Answer: Option D
Related Questions on Miscellaneous on Data Structures
Which data structure is used to implement a binary heap efficiently?
A. Array
B. Linked List
C. Stack
D. Queue
In which scenario would you use a Bloom Filter?
A. For implementing a stack-based algorithm
B. To maintain a balanced binary tree
C. For efficient sorting of elements
D. To test membership in a large dataset
A. Queue
B. Stack
C. Heap
D. Array

Join The Discussion