Practice Pseudo Code (6.5.1) - Matrix Multiplication - Design & Analysis of Algorithms - Vol 3

Practice: Pseudo Code

Lesson 6.5.1Matrix Multiplication

Practise this section

10 questions

Flashcard drill
3 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
4 questions · about 3 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is required for two matrices A and B to be multiplicable?
Show hintHide hint
Think about the dimensions of both matrices.
Question 2.
Explain what is meant by the cost of matrix multiplication.
Show hintHide hint
Consider how many operations are needed to calculate the entries.
3Question 3.
What must be true for two matrices A and B to be multiplied?
- A's rows should equal B's columns
- A's columns should equal B's rows
- A's rows and columns must be equal
Show hintHide hint
Analyze the matrix dimensions carefully.
4Question 4.
Matrix multiplication is commutative.
- True
- False
Show hintHide hint
Consider how switching two matrices changes the product.
Question 5.
Given matrices A(5x10), B(10x3), and C(3x8), calculate the total operations for both (AB)C and A(BC). Which order is more efficient?
Show hintHide hint
Use the dimensions to derive the number of operations required explicitly.
Question 6.
Imagine you have four matrices of varying dimensions. Devise an algorithm to compute the most operationally efficient multiplication order. Write the pseudo-code.
Show hintHide hint
Think in terms of breaking down the problem into smaller segments and compute their costs recursively.

6 more questions in this section. Enroll free to practise them all.