Purchase Solution

Path through an array

Not what you're looking for?

Ask Custom Question

Solve the following path through an array problem.
You must get the largest possible sum of 6 entries, one from each row, by starting at the best place in the 6th row, and moving between rows by going straight up, or by moving one column to the right or left.

0 -1 2 -4 -2 -2
1 1 -1 1 -1 1
-1 1 -2 -1 0 1
0 -2 -1 -4 0 -2
1 -1 -2 2 -1 -1
1 3 -1 -2 1 -2

b) Suppose you solve the "path through an array" problem twice: as above, working up and also working down starting at row #1. Explain why you get the same sum. Do you also get the same collection of optimal paths?

Purchase this Solution

Solution Summary

This solution shows how to solve a path through an array problem.

Purchase this Solution


Free BrainMass Quizzes
Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Probability Quiz

Some questions on probability