Given the program of naive method.
for i=1 to n do
for j=1 to n do
Z[i][j]=0;
for k=1 to n do
___________________________
Fill in the blanks with appropriate formula
for i=1 to n do
for j=1 to n do
Z[i][j]=0;
for k=1 to n do
___________________________A. Z[i][j] = Z[i][j] + X[i][k]*Y[k][j]
B. Z[i][j] = Z[i][j] + X[i][k] + Y[k][j]
C. Z[i][j] = Z[i][j] * X[i][k]*Y[k][j]
D. Z[i][j] = Z[i][j] * X[i][k] + Y[k][j]
Answer: Option A
This Question Belongs to Data Structure >> Miscellaneous On Data Structures
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