MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
Consider the following dynamic programming implementation of the matrix chain problem: Which of the following lines should be inserted to complete the above code? |
| A. | arr[row][k] – arr[k + 1][col] + mat[row – 1] * mat[k] * mat[col]; |
| B. | arr[row][k] + arr[k + 1][col] – mat[row – 1] * mat[k] * mat[col]; |
| C. | arr[row][k] + arr[k + 1][col] + mat[row – 1] * mat[k] * mat[col]; |
| D. | arr[row][k] – arr[k + 1][col] – mat[row – 1] * mat[k] * mat[col];View Answer |
| Answer» D. arr[row][k] – arr[k + 1][col] – mat[row – 1] * mat[k] * mat[col];View Answer | |