Scribd
Upload
22 views5 pages

Tutorial 2

The document contains a tutorial on probability and random processes with various questions related to paths through servers, byte configurations, arrangements of indistinguishable and distinguishable particles in cells, and combinations of colored balls from an urn. Each question requires calculations of possible arrangements, probabilities of specific events, and constraints on selections. The tutorial aims to enhance understanding of combinatorial principles and probability theory.

Uploaded by

Dominic Dasing Mojuntin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
22 views5 pages

Tutorial 2

The document contains a tutorial on probability and random processes with various questions related to paths through servers, byte configurations, arrangements of indistinguishable and distinguishable particles in cells, and combinations of colored balls from an urn. Each question requires calculations of possible arrangements, probabilities of specific events, and constraints on selections. The tutorial aims to enhance understanding of combinatorial principles and probability theory.

Uploaded by

Dominic Dasing Mojuntin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

KE36803 Probability and Random Processes

Tutorial 2

Question No. 1
A message can follow different paths through servers on a network. The sender’s message can go to
one of five servers for the first step, each of them can send to five servers at the second step,
each of which can send to four servers at the third step, and then the message goes to the
recipient’s server.

(a) How many paths are possible?


(b) If all paths are equally likely, what is the probability that a message passes through the first of
four servers at the third step?
Question No. 2

A byte is a sequence of eight bits and each bit is either 0 or 1.

(a) How many different bytes are possible?


(b) If the first bit of a byte is a parity check, that is, the first byte is determined from the other seven
bits, how many different bytes are possible?
Question No. 3
In a given experiment, we observe 5 particles occupying some of 10 cells in quantum phase. Assume
the particles are indistinguishable and the cells are distinguishable.

(a) How many physically distinguishable arrangements are there for placing the particles?

(b) Determine the probability of the event that none of the particles are in the first cell.

(c) Determine the probability of the event that the first cell contains at most 2 particles and the
second cell contains at least 1 particle.

(d) Determine the probability that only 3 of the cells contained particle.

(e) If no cell can contain more than one particle, determine the number of arrangements for placing
the particles.
Question 4
In a given experiment, we observe 4 particles occupying some of 10 cells in quantum phase. Assume
the particles are distinguishable and the cells are also distinguishable.

(a) How many physically distinguishable arrangements are there for placing the particles?

(b) Determine the probability of the event that the second cell contains at least 2 particles.

(c) Determine the probability that only 2 of the cells contained particles.

(d) If no cell can contain more than one particle, determine the number of arrangements for placing
the particles.

(e) Determine the probability that if you find a particle in the first cell, that will be the only particle
in the first cell.
Question No. 5
An urn contains red, blue, green, yellow, white, and black balls. In how many ways can we choose:

(a) 10 balls?

(b) 20 balls with least 2 colors each?

(c) 20 balls with no more than 3 blue balls?

(d) 20 balls with at least 4 red balls, at least 2 green balls, at least 6 white balls, and no more than 3
black balls?

You might also like