Code a function cdf(x) that returns P(X
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
plz solve question (c) with explanation I will give you upvotes
![In Dice Game, you must run across a 140m bridge before it collapses. You are given two 6-
sided dices with these numbers on their faces:
-8, -7, 1, 2, 7, 8 on the first dice
-7, -2, 1, 3, 7, 7 on the second dice
At every move, you throw the two dice simultaneously to obtain a score X which is the product
of the top faces of the two dice. You are then required to run forward X meters across the
bridge. If unfortunately, X is negative, you need to run backwards X meters. You can only
make 3 moves before the bridge collapses.
For example, if you throw (8, 7), (2, -2) and (-7, -7), you will have run a total of 101m (since
8 x 7 + 2 x (-2) + (-7) x (-7) = 56 - 4 + 49 = 101). Sadly, this means you will still be on the
bridge when it collapses.
You are not allowed to import any packages in this question, unless stated otherwise.
(a)
List the unique scores X you can get per move in ascending order.
Code a function pmfx) that returns P(X=x). Compute to 6 decimal places the values
P(X=-21)
Р(X --14)
P(X=14)
P(X=50)
(b)
Code a function cdf(x) that returns P(X<x). Compute to 6 significant figures the values
P(X<-21)
P(X< -14)
P(X<14)
Р(X < 50)](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fe285aae1-8716-43a8-99df-a1f5b101de81%2F62c310d7-a9ea-463b-9ff7-0ec159c89eee%2F55fbu2c_processed.png&w=3840&q=75)
Transcribed Image Text:In Dice Game, you must run across a 140m bridge before it collapses. You are given two 6-
sided dices with these numbers on their faces:
-8, -7, 1, 2, 7, 8 on the first dice
-7, -2, 1, 3, 7, 7 on the second dice
At every move, you throw the two dice simultaneously to obtain a score X which is the product
of the top faces of the two dice. You are then required to run forward X meters across the
bridge. If unfortunately, X is negative, you need to run backwards X meters. You can only
make 3 moves before the bridge collapses.
For example, if you throw (8, 7), (2, -2) and (-7, -7), you will have run a total of 101m (since
8 x 7 + 2 x (-2) + (-7) x (-7) = 56 - 4 + 49 = 101). Sadly, this means you will still be on the
bridge when it collapses.
You are not allowed to import any packages in this question, unless stated otherwise.
(a)
List the unique scores X you can get per move in ascending order.
Code a function pmfx) that returns P(X=x). Compute to 6 decimal places the values
P(X=-21)
Р(X --14)
P(X=14)
P(X=50)
(b)
Code a function cdf(x) that returns P(X<x). Compute to 6 significant figures the values
P(X<-21)
P(X< -14)
P(X<14)
Р(X < 50)
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 3 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Concepts of Database Management](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY