- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Consider the matrices P, Q and R which a...

Q. |
## Consider the matrices P, Q and R which are 10 x 20, 20 x 30 and 30 x 40 matrices respectively. What is the minimum number of multiplications required to multiply the three matrices? |

A. | 18000 |

B. | 12000 |

C. | 24000 |

D. | 32000 |

Answer» A. 18000 | |

Explanation: the minimum number of multiplications are 18000. this is the case when the matrices are parenthesized as (p*q)*r. |

View all MCQs in:
Design and Analysis of Algorithms

- Consider the string “abbccbba”. What is the minimum number of insertions required to make the string a palindrome?
- Consider the brute force implementation in which we find all the possible ways of multiplying the given set of n matrices. What is the time complexity of this implementation?
- You are given infinite coins of denominations v1, v2, v3,…..,vn and a sum S. The coin change problem is to find the minimum number of coins required to get the sum S. This problem can be solved using
- You are given infinite coins of N denominations v1, v2, v3,…..,vn and a sum S. The coin change problem is to find the minimum number of coins required to get the sum S. What is the time complexity of a dynamic programming implementation used to solve the coin change problem?
- You are given infinite coins of denominations 1, 3, 4. What is the minimum number of coins required to achieve a sum of 7?
- Consider a undirected graph G with vertices { A, B, C, D, E}. In graph G, every edge has distinct weight. Edge CD is edge with minimum weight and edge AB is edge with maximum weight. Then, which of the following is false?
- If all the weights of the graph are positive, then the minimum spanning tree of the graph is a minimum cost subgraph.
- How many 2*2 matrices are used in this problem?
- A complete bipartite graph is a one in which each vertex in set X has an edge with set Y. Let n be the total number of vertices. For maximum number of edges, the total number of vertices hat should be present on set X is?
- Minimum time required to solve tower of hanoi puzzle with 4 disks assuming one move takes 2 seconds, will be

Login to Continue

It will take less than 2 minutes

Report MCQ