Write an algorithm to find the maximum sum

Assignment Help Computer Engineering

Reference no: EM131832977

Problem

1. Use the dynamic programming approach to write an algorithm to find the maximum sum in any contiguous sub list of a given list of n real values. Analyze your algorithm, and show the results using order notation.

2. Let us consider two sequences of characters S1 and S₂. For example, we could have S1 = A$CMA*MN and S₂ = AXMC4ANB. Assuming that a subsequence of a sequence can be constructed by deleting any number of characters from any positions, use the dynamic programming approach to create an algorithm that finds the longest common subsequence of S1 and S₂. This algorithm returns the maximum-length common subsequence of each sequence.

Reference no: EM131832977

Questions Cloud

Draw a representation of an initially empty array list a : Draw a representation of an initially empty array list A after performing the following sequence of operation: add(0,4), add(0,3), add(0,2), add(2,1), add(1,5).

Which projects will lexmark take on : Let's turn this information into a demand curve for loanable funds. Organize this data to convert it into Lexmark's "loanable funds demand" curve.

Find the conditional probability : A number, denoted by X1> is chosen at random from the set of integers {I, 2, 3, 4}. A second number, denoted by X2, is chosen at random from the set {1, 2, ...

Problem on time bunching and inter temporal substitution : Can you think of some reasons why the following examples of time bunching and inter temporal substitution might be true?

Write an algorithm to find the maximum sum : Use the dynamic programming approach to write an algorithm to find the maximum sum in any contiguous sub list of a given list of n real values.

Arbitrary day is the same as on the preceding day : Suppose the probability is equal to P that the weather (rain or no rain) on any arbitrary day is the same as on the preceding day

What is the probability that the coin tossed on the nth toss : What is the probability that the coin tossed on the nth toss will fall heads if (i) n = 2, (ii) n = 4, (iii) n = 6, (iv) n is very large?

Define effect of amplifying a negative real shock : Consider the following economic events. Which of them will have the effect of amplifying a negative real shock and which are intended to offset a shock?

How many different binary search trees can be constructed : How many different binary search trees can be constructed using six distinct keys? Create the optimal binary search tree for the given items.

User Account

All Pages