Suppose you want to create a path between each number on Pascal's Triangle. For this exercise, suppose the only moves allowed are to go down one row either to the left or to the right.
We will code the path by using bit strings. In particular, a 0 will be used for each move downward to the left, and a 1 for each move downward to the right. So, for example, consider the first five rows of Pascal's Triangle below, and the path shown between the top number 1 (labelled START) and the left-most 3.
This path involves starting at the top 1 labelled START and first going down and to the left (code with a 0), then down to the left again (code with another 0), and finally down to the right (code with a 1). Hence, this path would be coded with binary string 001. This code is then recorded at theendinglocation on the triangle.
For Option #1, complete the following tasks based on the coding scheme described above:
Additional Requirements:
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here