In DNS algorithm of matrix multiplication it used

Related MCQs

• to solve the all-pairs shortest paths problem which algorithm's is/are used a) Floyd's algorithm b) Dijkstra's single-source shortest paths c) Prim's Algorithm d) Kruskal's Algorithm
• how many basic communication operations are used in matrix vector multiplication
• The n × n matrix is partitioned among n processors, with each processor storing complete ___ of the matrix.
• The n × n matrix is partitioned among n2 processors such that each processor owns a _____ element.
• The processors compute ______ product of the vector element and the loval matrix
• The space required to store the adjacency matrix of a graph with n vertices is
• Is Best First Search a searching algorithm used in graphs.
• logical operators used in algorithm are
• Goal of good algorithm is to implement commonly used _____ pattern.
• a solution of the problem in representing the parallelismin algorithm is