this task is involved in creating a program analysis paperwork.
the details will be provided to the each individual bidder, via Private message
here is the overview of the task:
this is not CODING task, however I need algorithms written.
**I have 2 questions about software programming analysis, here is the first one
1- partition a string of characters that does not contain any spaces (input) into the most plausible sequence of words (output).
the concatenation of all the words in the output sequence must be exactly the input string being partitioned.
For example, the input string 'thesecretmes-sage' could be partitioned into a vast number of sequences including the plausible ('the', 'secret', 'message') and the less plausible ('these', 'cretmes', 'sage')
(a) Identify the space of subproblems whose optimal solutions can be tabulated as part of a dynamic programming algorithm that solves the string partition prob-lem. Let the input string be denoted a . . . a . [10 marks]
(b) Give a recursive speci?cation of how the score of an optimal solution to a sub-problem is determined based on the optimal solutions to smaller subproblems.[10 marks]
It's better and more secure for me to submit the assignment document to the bidders individually during bidding.
[url removed, login to view] requirements notice: As originally posted, this bid request does not have complete details. Should a dispute arise and this project go into arbitration "as is", the contract's vagueness might cause it to be interpreted against you, even though you were acting in good-faith. So for your protection, if you are interested in this project, please work-out and document the requirements onsite.
as I stated, I have 2 programming analysis questions, and the document will full details will be given to the bidders via private message.