IE2100
Homework 3 Solutions
Question 1: #24
Let Xn be the color of the nth ball selected
Xn = 0
if nth ball selected is red
1
if nth ball selected is white
2
if nth ball selected is blue
0 4 / 5
1/ 5
P = 2 / 7 3/ 7 2 / 7
3/ 9 4 / 9 2 / 9
Check conditio

IE2100
Homework 5 Solutions
Question 1: Chapter 5, #47
[ ]=
Thus,
=
[ ]=
1
1
2
+ [ ]
+2
+2
1
2
+ ( [ ] + [ ])
+2
+2
+
( + )
Moreover, an alternative way to answer part (c) is as follows:
Let N be the number of lost customers in one unit of time. [ ] =
whe

IE2100
Homework 6
Due at 5pm (outside QIRC Lab, E1-07-17) on April 11 2012
Question 1: Chapter 6, #15
Make sure that the random variables are properly defined, the state space is specified, the
transition rate and transition probability are calculated, an

IE2100
Homework 4
Due (in class) March 21 2012
Question 1 Chapter 5, #4
Question 2 Chapter 5, #9
Question 3: Chapter 5, #20
Question 4: Chapter 5, #24
Calculate
by conditioning.
Lets denote
S1: the event that the last job is done by server 1
S2: the event

IE2100
Homework 6
Due at 5pm (outside QIRC Lab, E1-07-17) on April 11 2012
Continuous Time Markov Chains
Question 1: Chapter 6, #15 (First, model the problem as a CTMC, and give the
parameters of the CTMC, i,e. vis and Pijs, and draw the rate transitio n

IE2100
Semester II 2011/2012
Homework 2
Due (in class) February 15 2012
Chapter 4
For questions 2-5, define clearly the Discrete Time Markov Chain used to solve the
problems
Question 1: Chapter 4, #5
Question 2: Chapter 4, #8
Question 3: Chapter 4, #9
Que

IE2100
Semester II 2011/2012
Homework 3
Due (in class) February 27 2012
Chapter 4
For all questions, define clearly the Discrete Time Markov Chain used to solve the
problems
Question 1: Chapter 4, #24
Question 2: Chapter 4, #28
Question 3: Chapter 4, #29