MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
For every rod cutting problem there will be a unique set of pieces that give the maximum price.a) Trueb) False Which line will complete the ABOVE code? |
| A. | Trueb) False Which line will complete the ABOVE code?a) prices[j-1] + max_val[tmp_idx] |
| B. | False Which line will complete the ABOVE code?a) prices[j-1] + max_val[tmp_idx] b) prices[j] + max_val[tmp_idx] |
| C. | prices[j-1] + max_val[tmp_idx – 1] |
| D. | prices[j] + max_val[tmp_idx – 1] View Answer |
| Answer» C. prices[j-1] + max_val[tmp_idx – 1] | |