N PYTHON – first determine how many easy and how many challenging jobs there are. Observe that the num- ber of easy jobs has binomial distribution with parameters n and p. Hence, to get your values, draw one sample (call it m) from binomial random variable with your parameters. Then m is the realized number of simple jobs and n −m is the number of challenging jobs. – draw m samples from normal (with parameters μ1,σ1) distribution and n −m samples from exponential (with average μ2) – add all samples together to calculate the total processing time – write down the total processing time value using random valyes for p, μ1,σ1,μ2
N PYTHON – first determine how many easy and how many challenging jobs there are. Observe that the num- ber of easy jobs has binomial distribution with parameters n and p. Hence, to get your values, draw one sample (call it m) from binomial random variable with your parameters. Then m is the realized number of simple jobs and n −m is the number of challenging jobs. – draw m samples from normal (with parameters μ1,σ1) distribution and n −m samples from exponential (with average μ2) – add all samples together to calculate the total processing time – write down the total processing time value using random valyes for p, μ1,σ1,μ2
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
IN PYTHON
– first determine how many easy and how many challenging jobs there are. Observe that the num-
ber of easy jobs has binomial distribution with parameters n and p. Hence, to get your values,
draw one sample (call it m) from binomial random variable with your parameters. Then m is the
realized number of simple jobs and n −m is the number of challenging jobs.
– draw m samples from normal (with parameters μ1,σ1) distribution and n −m samples from
exponential (with average μ2)
– add all samples together to calculate the total processing time
– write down the total processing time value
using random valyes for p, μ1,σ1,μ2
Expert Solution
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 2 steps with 1 images
Recommended textbooks for you
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…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
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…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
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)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY