Suppose we use the two-stage algorithm of Section 2.3.9
to compute the product of matrices M and N.
Let M have x rows and y columns, while N has y rows and z
columns. As a function of x, y, and z, express the answers
to the following questions:
- The output of the first Map function has how many different keys?
How many key-value pairs are there with each key?
How many key-value pairs are there in all?
- The output of the first Reduce function has how many keys?
What is the length of the value (a list) associated with each key?
- The output of the second Map function has how many different keys?
How many key-value pairs are there with each key?
How many key-value pairs are there in all?
Then, identify the true statement in the list below.