ISyE 6644 Fall 2016 Test #1 Solutions

Similar documents
ISyE 3044 Fall 2017 Test #1a Solutions

ISyE 3044 Fall 2015 Test #1 Solutions

ISyE 6644 Fall 2015 Test #1 Solutions (revised 10/5/16)

ISyE 2030 Practice Test 1

ISyE 6644 Fall 2014 Test #2 Solutions (revised 11/7/16)

Hand Simulations. Christos Alexopoulos and Dave Goldsman 9/2/14. Georgia Institute of Technology, Atlanta, GA, USA 1 / 26

ISyE 6644 Fall 2014 Test 3 Solutions

Closed book and notes. 60 minutes. Cover page and four pages of exam. No calculators.

Math 426: Probability MWF 1pm, Gasson 310 Exam 3 SOLUTIONS

Class 8 Review Problems 18.05, Spring 2014

3. Poisson Processes (12/09/12, see Adult and Baby Ross)

Review of Probability. CS1538: Introduction to Simulations

ECE 302, Final 3:20-5:20pm Mon. May 1, WTHR 160 or WTHR 172.

Midterm Exam 1 (Solutions)

Queueing Theory and Simulation. Introduction

1 Basic continuous random variable problems

CS 1538: Introduction to Simulation Homework 1

STAT Chapter 5 Continuous Distributions

2. Suppose (X, Y ) is a pair of random variables uniformly distributed over the triangle with vertices (0, 0), (2, 0), (2, 1).

EECS 126 Probability and Random Processes University of California, Berkeley: Spring 2015 Abhay Parekh February 17, 2015.

Functions of two random variables. Conditional pairs

EECS 126 Probability and Random Processes University of California, Berkeley: Fall 2014 Kannan Ramchandran November 13, 2014.

1 Basic continuous random variable problems

Chapter 2 Queueing Theory and Simulation

Midterm Exam 1 Solution

Recap. Probability, stochastic processes, Markov chains. ELEC-C7210 Modeling and analysis of communication networks

Stat 150 Practice Final Spring 2015

System Simulation Part II: Mathematical and Statistical Models Chapter 5: Statistical Models

STAT 418: Probability and Stochastic Processes

Math 151. Rumbos Fall Solutions to Review Problems for Exam 2. Pr(X = 1) = ) = Pr(X = 2) = Pr(X = 3) = p X. (k) =

Tutorial 1 : Probabilities

CSE 312, 2017 Winter, W.L. Ruzzo. 7. continuous random variables

Queueing Review. Christos Alexopoulos and Dave Goldsman 10/6/16. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA

7 Variance Reduction Techniques

Chapter 1: Revie of Calculus and Probability

Queueing Review. Christos Alexopoulos and Dave Goldsman 10/25/17. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA

1. Consider a random independent sample of size 712 from a distribution with the following pdf. c 1+x. f(x) =

Guidelines for Solving Probability Problems

SDS 321: Practice questions

Math 510 midterm 3 answers

HW1 (due 10/6/05): (from textbook) 1.2.3, 1.2.9, , , (extra credit) A fashionable country club has 100 members, 30 of whom are

ACM 116: Lectures 3 4

STAT 414: Introduction to Probability Theory

Qualifying Exam CS 661: System Simulation Summer 2013 Prof. Marvin K. Nakayama

Stat 5101 Notes: Algorithms

ENGG2430A-Homework 2

Final Exam # 3. Sta 230: Probability. December 16, 2012

Chapter 4. Continuous Random Variables

Statistics 427: Sample Final Exam

ISyE 2030 Practice Test 2

ISyE 6739 Test 1 Solutions Summer 2015

Class 8 Review Problems solutions, 18.05, Spring 2014

Midterm Exam 2 (Solutions)

Figure 10.1: Recording when the event E occurs

Topic 4: Continuous random variables

SDS 321: Introduction to Probability and Statistics

Topic 4: Continuous random variables

Practice Exam 1: Long List 18.05, Spring 2014

Math 30530: Introduction to Probability, Fall 2013

f X, Y (x, y)dx (x), where f(x,y) is the joint pdf of X and Y. (x) dx

HW7 Solutions. f(x) = 0 otherwise. 0 otherwise. The density function looks like this: = 20 if x [10, 90) if x [90, 100]

ISyE 6650 Test 2 Solutions

EECS 126 Probability and Random Processes University of California, Berkeley: Spring 2018 Kannan Ramchandran February 14, 2018.

EECS 126 Probability and Random Processes University of California, Berkeley: Fall 2014 Kannan Ramchandran September 23, 2014.

Statistics Examples. Cathal Ormond

X = X X n, + X 2

Stat 5101 Lecture Slides Deck 5. Charles J. Geyer School of Statistics University of Minnesota

Basic concepts of probability theory

continuous random variables

Chapter 5. Chapter 5 sections

Basic concepts of probability theory

Class 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis.

PRACTICE PROBLEMS FOR EXAM 2

Continuous random variables

Practice Examination # 3

ECE353: Probability and Random Processes. Lecture 18 - Stochastic Processes

Lecture 2: Review of Probability

S n = x + X 1 + X X n.

IE 230 Probability & Statistics in Engineering I. Closed book and notes. 60 minutes.

Networking = Plumbing. Queueing Analysis: I. Last Lecture. Lecture Outline. Jeremiah Deng. 29 July 2013

ECE Homework Set 3

Queueing Theory. VK Room: M Last updated: October 17, 2013.

Math Spring Practice for the final Exam.

Stochastic Models of Manufacturing Systems

Basic concepts of probability theory

Sandwich shop : a queuing net work with finite disposable resources queue and infinite resources queue

The exponential distribution and the Poisson process

Class 26: review for final exam 18.05, Spring 2014

EECS 126 Probability and Random Processes University of California, Berkeley: Spring 2017 Kannan Ramchandran March 21, 2017.

1.225J J (ESD 205) Transportation Flow Systems

Massachusetts Institute of Technology

Disjointness and Additivity

IEOR 3106: Second Midterm Exam, Chapters 5-6, November 7, 2013

Notes on Continuous Random Variables

Chapter 5 continued. Chapter 5 sections

Name of the Student:

NATCOR: Stochastic Modelling

Stat 5101 Notes: Algorithms (thru 2nd midterm)

Midterm 2 Review. CS70 Summer Lecture 6D. David Dinh 28 July UC Berkeley

1 st Midterm Exam Solution. Question #1: Student s Number. Student s Name. Answer the following with True or False:

Transcription:

1 NAME ISyE 6644 Fall 2016 Test #1 Solutions This test is 85 minutes. You re allowed one cheat sheet. Good luck! 1. Suppose X has p.d.f. f(x) = 3x 2, 0 < x < 1. Find E[3X + 2]. Solution: E[X] = 1 0 x 3x2 dx = 3/4. Thus, E[3X + 2] = 17/4. 2. Suppose X has p.d.f. f(x) = 3x 2, 0 < x < 1. Find E[ 1 X ]. Solution: E[ 1 X ] = 1 0 1 x 3x2 dx = 1.5. 3. TRUE or FALSE? For any positive random variable X with mean µ, we have Var(µ 2 X) 0. Solution: TRUE. Var(µ 2 X) = Var(X) 0. 4. The number of arrivals to a parking lot over time can best be represented by (a) a Brownian motion process. (b) an independent, identically distributed process (c) a Poisson process (d) a nonhomogeneous Poisson process (e) a Yellowian motion process Solution (d) a nonhomogeneous Poisson process. 5. Suppose that the Atlanta Braves play i.i.d. games, each of which has win probability 0.4. Find the probability that their first win will occur on game 4. Solution: The number of games until the first win is X Geom(0.4), so that Pr(X = 4) = q x 1 p = (0.6) 3 (0.4) = 0.0864.

2 6. Suppose that machine breakdowns occur according to a Poisson process at the rate of 2/week. What s the probability that there will be exactly 5 breakdowns during the next 3 weeks? Solution: Let X denote the number of breaks during the next 3 weeks. Then X Pois(6), so that Pr(X = 5) = e 6 6 5 5! = 0.1606. 7. Again suppose that machine breakdowns occur according to a Poisson process at the rate of 2/week. What is the distribution of the time between the 3rd and 6th breakdowns? (Name the distribution with any relevant parameters.) Solution: Add up 3 Exp(2) s, so that the answer is Erlang 3 (2). 8. Suppose that X has p.d.f. f(x) = 2x, 0 x 1. What s the distribution of the random variable X? Solution: Let Y = X. We have Pr(Y y) = Pr( X y) = Pr(X y 2 ) = y 2 0 2x dx = y 4. This implies that f Y (y) = 4y 3, 0 y 1. 9. Suppose that U 1 and U 2 are i.i.d. Unif(0,1). Name the distribution of 4 ln(u 1 U 2 ). (Include any relevant parameters.) Solution: We have 4 ln(u 1 U 2 ) = 4 ln(u 1 ) 4 ln(u 2 ) Exp(1/4)+Exp(1/4) Erlang 2 (1/4). 10. Suppose X is a normal random variable with mean 1 and variance 4. What is the probability that X 3?

3 Solution: ( Pr(X 3) = Pr Z 3 1 ) 4 = Pr(Z 1) = Φ(1) = 0.8413. 11. Suppose the joint p.d.f. of X and Y is f(x, y) = 2x/9, 0 < x < y < 3. Find E[Y ]. Solution: We have f Y (y) = f(x, y) dx = y 0 2x 9 dx = y2 9, 0 y 3, so that E[Y ] = yf Y (y) dy = 3 0 y 3 9 dy = 9/4. 12. Suppose X and Y are discrete random variables with the following joint p.m.f. Find Cov(X, Y ). f(x, y) X = 0 X = 1 Y = 0 0.5 0.1 Y = 1 0.1 0.3 Solution: Let s expand the table in the usual way. f(x, y) X = 0 X = 1 f Y (y) Y = 0 0.5 0.1 0.6 Y = 1 0.1 0.3 0.4 f X (x) 0.6 0.4 1 Then we immediately see that both X and Y are Bern(0.4). But let s see if they re correlated. To this end, E[XY ] = x Thus, xyf(x, y) = (0)(0)0.5 + (1)(0)0.1 + (1)(0)0.1 + (1)(1)0.3 = 0.3. y Cov(X, Y ) = E[XY ] E[X]E[Y ] = 0.3 (0.4)(0.4) = 0.14.

4 13. Consider the random variables X and Y, both of which are Nor(0, 3), but with Cov(X, Y ) = 1. Find Var(X Y ). Solution: Var(X) + Var(Y ) 2Cov(X, Y ) = 4. 14. Suppose that the joint p.d.f. of X and Y is f(x, y) = c e (x+y) /(x 2 + y 2 ), for 2 < x < 3, 1 < y < 2, and some appropriate value of c. Are X and Y independent? Solution: No. You can t factor the joint p.d.f. in the form a(x)b(y). 15. Suppose that the times between buses are i.i.d. Exp(4/hr). Further suppose that I showed up at the bus stop at some random time and have already been waiting for an hour. What s the probability that the next bus will come within the next 15 minutes? Solution: Let X Exp(4) be the time that the next bus arrives. We want the probability that the next bus will show up by time 75 minutes (i.e., 5/4 hours), given that we ve already been waiting an hour. By the memoryless property, Pr(X 5/4 X 1) = Pr(X 1/4) = 1 e λx = 1 e 1 = 0.632. 16. What distribution do you get if you add up three i.i.d. Nor(3,6) random variables? Solution: Nor(9, 18). 17. Suppose that X 1,..., X 400 are i.i.d. with values 1 and 1, each with probability 0.5. (This is a simple random walk.) Find the approximate probability that the sample mean X 400 will be between 0.1 and 0.1. Solution: Note that E[X i ] = 0 and Var(X i ) = E[Xi 2 ] (E[X i ]) 2 = 1. Then the Central Limit Theorem implies that the sample mean X Nor(0, 1/400), and so Pr( 0.1 < X < 0.1) Pr 0.1 0 1/400 < Z < 0.1 0 1/400 = Pr( 2 < Z < 2) = 0.954.

5 18. Joey likes to play Dungeons and Dragons. If U Unif(0, 1), give Joey a simple algorithm to generate a 10-sided die toss. (If your algorithm isn t simple enough, a Justin Bieber monster will kill him so Joey is really counting on you to get this question correct.) Solution: If U Unif(0, 1), then you can use 10U. 19. How would you implement Joey s 10-sided die toss from Question 18 in Arena? Solution: Many possible answers, but a really simple one is AINT(UNIF(1,11)). 20. TRUE or FALSE? If you add up two i.i.d. Unif(0,1) random variables, you get a triangular distribution. Solution: TRUE. 21. Suppose that I pick 40000 points randomly in a unit cube, into which I ve inscribed a sphere with radius 1/2. (This sphere has volume 4 3 πr3 = π/6.) Further suppose that 21067 of those random points fall inside the inscribed sphere. Using this information, give me an estimate of π. Solution: Let p = π/6 denote the probability that a random point will be in the sphere. Then an estimator for p is the sample proportion ˆp n = 0.52668, and so the desired estimate is ˆπ n = 6ˆp n = 3.1601. 22. If you were to write a simulation of a queueing system in Python, would you likely be using the (i) event-scheduling or (ii) process-interaction approach? Solution: (i) E-S. 23. TRUE or FALSE? It is possible for an arrival event to cause multiple event deletions in the future events list.

6 Solution: TRUE. 24. What is the variance of the Arena expression NORM(-1,3) - EXPO(5)? Solution: 9 + 25 = 34. 25. In Arena, what does NR(Barber) do? Solution: It indicates the number of servers in the resource Barber who are currently working. 26. In what Arena template can you find a DELAY? (a) Basic Process (b) Advanced Process (c) Blocks (d) all of the above Solution: (d) all of the above. 27. TRUE or FALSE? You can set the value of an Arena entity attribute to the value of the variable TNOW. Solution: TRUE. 28. TRUE or FALSE? Arena s Schedule spreadsheet can define both resource and customer arrival schedules. Solution: TRUE. 29. Suppose that you want to evaluate the integral I = 2 0 e x2 /2 dx via Monte Carlo. The following numbers are a Unif(0,1) sample:

7 0.91 0.11 0.73 0.32 Use the MC method from class to approximate the integral via the estimator Ī4. Solution: Ī 4 = b a n f(a + (b a)u i ) n i=1 = 2 4 f(2u i ) 4 i=1 = 1 [ 4 (2Ui ) 2 ] exp 2 i=1 2 = 1 4 e 2U i 2 2 i=1 = 1.163. 30. What is the expected value of the estimator Ī4? Solution: Let Φ( ) denote the standard normal c.d.f. Since Ī4 is unbiased for I, we have E[Ī4] = I = 2π [Φ(2) Φ(0)] = 2π (0.4772) = 1.196. 31. Consider the differential equation f (x) = (x + 2)f(x) with f(0) = 2. Use Euler s method with increment h = 0.01 to find the approximate value of f(0.02). Solution. You can actually get the true answer using separation of variables, and it turns out to be f(x) = 2 exp{ x2 2 + 2x}. But our job is to use Euler to come up with an iterative approximation, so here goes. As usual, we start with f(x + h) = f(x) + hf (x) = f(x) + h(x + 2)f(x) = f(x)[1 + h(x + 2)], from which we obtain the following table.

8 x Euler approx true f(x) 0.00 2.0000 2.0000 0.01 2.0400 2.0406 0.02 2.0810 2.0820 Thus, the desired Euler approximation for f(0.2) is 2.0810. 32. Joey works at an ice cream shop. Starting at time 0, four customer interarrival times are as follows (in minutes): 3 2 P 5 2 P, where a P indicates a high-priority customer. Customers are served in FIFO fashion within the regular and high-priority classes. However, high-priority customers preempt any non-high-priority customer currently in service; that is, when a high-priority guy shows up, If a regular guy is currently getting served, he is temporarily kicked out of service and has to go behind the high-priority guy. The high-priority guy gets served immediately. When the high-priority guy is done, then the regular guy gets served again, picking up where he left off. In any case, the 4 customers order the following numbers of ice cream products, respectively: 6 2 3 1 Suppose it takes Joey 2 minutes to prepare each ice cream product. Further suppose that he charges $5/ice cream. Sadly, the customers are unruly and each customer causes $1 in damage for every minute the customer has to wait in line. When does customer #1 leave? Solution: Consider the following beautiful table.

9 serv start remaining kicked out cust arrl time / restart serve time / departed wait time sys time 1 3 3 12 5 0 1 9 10 12 4 1 14 7 21 2 18 2 P 5 5 4 9 0 4 3 10 21 6 27 11 17 4 P 12 12 2 14 0 2 Thus, cust #1 leaves at time 21. 33. Continuing the ice cream question, how much money will Joey make or lose with the above 4 customers? Solution: Profit = 5(number of ice creams sold) 1(total wait times) = 60 17 = $43.