Great Deal! Get Instant $10 FREE in Account on First Order + 10% Cashback on Every Order Order Now

Option #1: Pascal’s Triangle: Paths and Binary Strings 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...

1 answer below »

Option #1: Pascal’s Triangle: Paths and Binary Strings

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.

07_12_44.jpg

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:

  1. Determine if there are additional paths between the START (number 1 at the top) and end point (leftmost 3). If so, describe them in words, by tracing the path on the triangle, and as binary strings. Then record all such binary strings at the ending location.
  2. Find and record at least 5 paths using binary strings between the START location and numbers in rows 4 and 5. Compare the binary strings for each number and discuss why those similarities and differences might exist. Also, explain any connections you notice between the number of possible paths ending at each location and the corresponding entry of Pascal’s Triangle.
  3. Discuss what information about an endpoint and the paths leading to it can be gathered from the length of its binary strings and the number of 1s in them.
  4. Explain the addition rule of Pascal’s Triangle in your own words in terms of the path coding scheme you worked with in this assignment.
  5. Note the type of symmetry that Pascal’s Triangle has and explain it in terms of the paths.

Additional Requirements:

  1. Paper must be written in third person.
  2. Your paper shouldbe 3-4 pages in length (counting the title page and references page) andcite and integrate at least one credible outside source.TheCSU-Global Library(Links to an external site.)is a great place to find resources.Your textbook is a credible resource.
  3. Include a title page, introduction, body, conclusion, and a reference page.
  4. The introduction should describe or summarize the topic or problem. It might discuss the importance of the topic or how it affects you or society as a whole, or it might discuss or describe the unique terminology associated with the topic.
  5. The body of your paper should answer the questions posed in the problem. Explain how you approached and answered the question or solved the problem, and, for each question, show all steps involved.Be sure this is in paragraph format, not numbered answers like a homework assignment.
  6. Theconclusion should summarize your thoughts about what you have determined from the data and your analysis, often with a broader personal or societal perspective in mind.Nothing new should be introduced in the conclusion that was not previously discussed in the body paragraphs.
  7. Include any tables of data or calculations, calculated values, and/or graphs associated with this problem in the body of your assignment.
  8. Document formatting, citations, and style should conform to the CSU-Global Library’sCSU-Global Guide to Writing & APA: Introduction(Links to an external site.). A short summary containing much that you need to know about paper formatting, citations, and references is contained in theNew Sample APA Paper(Links to an external site.). In addition, information in theCSU-Global Library(Links to an external site.)under the Writing Center/APA Resources tab has many helpful areas (Writing Center, Writing Tips, Template & Examples/Papers & Essays, and others).
Answered Same Day Aug 07, 2021

Solution

Sudipta answered on Aug 08 2021
153 Votes
1
Pascal’s Triangle: Paths and Binary Strings
PASCAL’S TRIANGLE: PATHS AND BINARY STRINGS
2
Pascal’s Triangle: Paths and Binary Strings
Introduction:
The problem deals with pascal’s triangle and one needs to find the number of way from
one start point to an end point if possible as he/she can go only down left or down right. If one
thinks about the problem then he/she will understand it’s a problem of detecting number of ways
to reach from one point to another just like a google map does. It can be solved by various ways
in programming field like BFS, DFS or Huffman coding algorithm and recursive function.
Body:
If its given that the starting point is 1(of first row) then to any end point there will be
exactly the pascal’s number of way to reach. For example if one goes from topmost 1 to 6 of row
5 then there will be exactly 6 ways (0101, 1010, 1100, 0011, 0110, 1001). The approach here is
as said in the question he can go only down left or down right so the number of 1’s and 0’s are
equal for each start to end point so if he is given with a way for example as said in question its
001for top 1 to...
SOLUTION.PDF

Answer To This Question Is Available To Download

Related Questions & Answers

More Questions »

Submit New Assignment

Copy and Paste Your Assignment Here