SRL Archive - Java Help and Tutorials

Hey guys I have a final tomorrow, I would like some help solving some of these problems… tbh I just don't understand what some of them are asking of me.

I will post them here, please solve as soon as possible. Will be eternally grateful :)


If you need money let me know in a PM (and I can make a black market thread for this) (but only for those who have access to black market)

Ok so I figured out a few of them, I still need help on: 6,8,9,12,13,14,15,16,18

Is this a Purdue CS class?


9.
(a) Both solve a problem through combining the solutions of the sub-problems
(b) Divide & Conquer: the sub problems are independent of each other
Dynamic: The sub problems are dependent of each other
©I. Divide & conquer is best suited for the case when there are no overlapping sub problems
Dynamic programming algorithms, we typically solve each sub problem only once and store their solutions.
II. (?)
III. Dynamic Programming solves each sub problem once and saves the solution in a table
(d) The table generated what the final output is: v[i,w], which isn't always the optimal solution. The optimal would be to switch it to keep[i,w]

10
(a)
(b)