Solutions for the Homework 1
1. Let Ak , k 1.n denote an event of a ball being in box k (since we only have one ball, all Ak form
a set of mutually exclusive events), B denote uncovering the ball in the box i.
It is given that probability of uncovering th
CS6352 Homework 1 Solutions
1(a). Given 10 tosses, the probability that coin A is selected for the 10 tosses is p(A) =
0.5, the probability that coin B is selected for the 10 tosses is p(B) = 0.25, and the
probability that coin C is selected for the 10 to
The University of Texas at Dallas
CS/CE 6352, Performance of Computer Systems and Networks
Fall 2010
Homework 3
due Thursday, October 7, 2010
1. Robertazzi, Problems 2.24, 2.25, 2.39a
2. Consider a closed system in which 4 terminals submit jobs to a compu
The University of Texas at Dallas
CS 6352, Performance of Computer Systems and Networks
Spring 2011
Homework 4
Due Tuesday, April 12, 2011
1. Robertazzi, Third Edition, Problems 2.34, 2.41, 6.24, 6.27 (Also, (b) nd an expression for the probability that a
The University of Texas at Dallas
CS 6352, Performance of Computer Systems and Networks
Spring 2009
Homework 4
Due Friday, April 10, 2009
1. Robertazzi, Third Edition, Problems 6.9, 6.10, 6.25 (Also, (b) nd an expression for the probability
that a given p
The University of Texas at Dallas
CS 6352, Performance of Computer Systems and Networks
Fall 2008
Homework 4
Due Thursday, November 13, 2008
1. Robertazzi, 3rd edition, Problem 2.41.
2. Consider a preemptive priority M/M/2/3 queueing system with two class
The University of Texas at Dallas
CS/CE 6352, Performance of Computer Systems and Networks
Spring 2010
Homework 3
due Friday, February 26, 2010
1. Robertazzi, Problems 2.24, 2.31, 2.41
2. A company is planning to install machines in its factory. The machi
The University of Texas at Dallas
CS 6352, Performance of Computer Systems and Networks
Spring 2009
Homework 3
due Friday, February 27, 2009
1. Robertazzi, Problems 2.23, 2.25, 2.26, 2.34
2. A queueing system consists of a single queue with an exponential
The University of Texas at Dallas
CS 6352, Performance of Computer Systems and Networks
Spring 2011
Homework 3
due Thursday, March 3, 2011
1. Robertazzi, Problems 2.26, 2.31, 2.39a
2. A company is planning to install machines in its factory. The machines
The University of Texas at Dallas
CS 6352, Performance of Computer Systems and Networks
Spring 2009
Homework 3 - additional problem
due Friday, March 6, 2009
1. Consider components that arrive to a facility for testing. The components arrive according to
The University of Texas at Dallas
CS 6352 - 001, Performance of Computer Systems and Networks
Spring 2009
Homework 2
due Friday, February 13, 2009
1. Consider a machine which manufactures components. The machine operates for a random period of
time T befo
The University of Texas at Dallas
CS 6352 - 501, Performance of Computer Systems and Networks
Spring 2011
Homework 2
due Tuesday, February 15, 2011
1. Robertazzi, Problems 2.9(b)(c), 2.19, 2.36, 2.37
2. Consider a machine which manufactures components. Th
The University of Texas at Dallas
CS/CE 6352 - 001, Performance of Computer Systems and Networks
Spring 2010
Homework 2
due Friday, February 12, 2010
1. Robertazzi, Problems 2.16, 2.36, 2.37
2. Consider a machine which manufactures components. The machine