Order ID:89JHGSJE83839 | Style:APA/MLA/Harvard/Chicago | Pages:5-10 |
Instructions:
Assignment of a dynamic-programming algorithm
1. Write a program that, given two strings S and T, returns an optimal alignment in O(|S||T|) time, as shown in the lecture notes. If S = AGATACATCA and T = GATTAGATACAT, for example, the best alignment is AGAT-ACAT-CA-GATTAGATACAT (I think). You are not required to analyze or prove the correctness of your algorithm.
2. EXPLAIN a linear-time dynamic-programming technique for maximum-subarray on https://leetcode.com/problems/ (It’s not difficult to obtain code online, but the most of the explanations are bad.) Remember, there’s an issue if you can’t explain your response!)
3. Assume that your professor has allocated a “profit” to each of numerous indivisible food items, indicating how much he enjoys each. He’s now stuffing his knapsack with products in an attempt to maximize the total profit. Because the food supplies are light yet heavy, the knapsack’s volume capacity, rather than its weight, is the limiting factor today. Even while the food products cannot be sliced, they can be crushed, which reduces their volume by a factor of two while also lowering their profit (since squashed food is not as appetizing). Write a dynamic programming algorithm that tells your professor which food items to select and which ones to squash in a time polynomial in the number of items and the capacity of the knapsack (in litres) and runs in time polynomial in the number of items and the capacity of the knapsack (in litres). It’s safe to suppose that the knapsack’s capacity and each item’s original volume in litres are both integers. Justify your algorithm’s correctness.
4. Create pseudo-code for an O(n log n) time method that accepts a sequence of n integers and finds the longest slowly increasing subsequence (LSIS), where an LSIS is a sequence in which each number after the first is greater than its predecessor but not by more than ten. Justify your algorithm’s correctness.
5. Modify the code for generating an optimal binary search tree in the lecture notes (to be provided by June 21st) so that it runs in O(n 2 ) time instead of O(n 3 ) time. You are not required to analyze or prove the correctness of your algorithm.
Requirements: 5 word questions |.doc file
RUBRIC |
||||||
Excellent Quality 95-100%
|
Introduction
45-41 points The background and significance of the problem and a clear statement of the research purpose is provided. The search history is mentioned. |
Literature Support 91-84 points The background and significance of the problem and a clear statement of the research purpose is provided. The search history is mentioned. |
Methodology 58-53 points Content is well-organized with headings for each slide and bulleted lists to group related material as needed. Use of font, color, graphics, effects, etc. to enhance readability and presentation content is excellent. Length requirements of 10 slides/pages or less is met. |
|||
Average Score 50-85% |
40-38 points More depth/detail for the background and significance is needed, or the research detail is not clear. No search history information is provided. |
83-76 points Review of relevant theoretical literature is evident, but there is little integration of studies into concepts related to problem. Review is partially focused and organized. Supporting and opposing research are included. Summary of information presented is included. Conclusion may not contain a biblical integration. |
52-49 points Content is somewhat organized, but no structure is apparent. The use of font, color, graphics, effects, etc. is occasionally detracting to the presentation content. Length requirements may not be met. |
|||
Poor Quality 0-45% |
37-1 points The background and/or significance are missing. No search history information is provided. |
75-1 points Review of relevant theoretical literature is evident, but there is no integration of studies into concepts related to problem. Review is partially focused and organized. Supporting and opposing research are not included in the summary of information presented. Conclusion does not contain a biblical integration. |
48-1 points There is no clear or logical organizational structure. No logical sequence is apparent. The use of font, color, graphics, effects etc. is often detracting to the presentation content. Length requirements may not be met |
|||
You Can Also Place the Order at www.collegepaper.us/orders/ordernow or www.crucialessay.com/orders/ordernow
Assignment of a dynamic-programming algorithm |
Assignment of a dynamic-programming algorithm