Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

MI2023E Problems of Chapter 1.-Part 1pdf

Download as pdf or txt
Download as pdf or txt
You are on page 1of 6

H ANOI U NIVERSITY OF S CIENCE AND T ECHNOLOGY

S CHOOL OF A PPLIED M ATHEMATICS AND I NFORMATICS


MI2023E
D EPARTMENT OF A PPLIED M ATHEMATICS

E XERCISES OF P ROBABILITY AND


S TATISTICS

Hanoi - 2024
2
CHAPTER 1. PROBABILITY.

Chapter 1
P ROBABILITY.

1.1 E XPERIMENTS

Problem 1.1.
A fax transmission can take place at any of three speeds depending on the condition
of the phone connection between the two fax machines. The speeds are high (h) at
14400b/s, medium (m) at 9600b/s, and low (l) at 4800b/s. In response to requests for
information, a company sends either short faxes of two (t) pages, or long faxes of four
(f) pages. Consider the exp. of monitoring a fax trans and observing the trans speed
and length. An observation is a two-letter word, e.g., a high-speed, two-page fax is ht.

(a) What is the sample space of the experiment?


(b) Let A1 be the event “medium-speed fax.” What are the outcomes in A1 ?
(c)Let A2 be the event “short fax.” What are the outcomes in A2 ?
(d) Let A3 be the event “high-speed fax or low-speed fax.” What are the outcomes in
A3 ?
(e) Are A1 , A2 , and A3 mutually exclusive?
(f) Are A1 , A2 , and A3 exhaustive?

Problem1.2.
An integrated circuit factory has 3 machines X, Y, and Z. Test 1 integrated circuit pro-
duced by each machine. Either a circuit is acceptable (a) or fails (f). An observation is
a sequence of 3 test results corr. to the circuits from machines X, Y, and Z, respectively.
E.g., aa f is the observation that the circuits from X and Y pass and the circuit from Z
fails.

(a) What are the elements of the sample space of this experiment?
(b) What are the elements of the sets ZF = {circuit from Z fails}, X A = {circuit from X
is acceptable}.
(c) Are ZF and X A mutually exclusive?
(d) Are ZF and X A collectively exhaustive?
(e) What are the elements of the sets C = {more than one circuit acceptable}, D = {at
least two circuits fail}.
(f) Are C and D mutually exclusive and exhaustive?

3
1.2. COUNTING METHODS.

Problem 1.3.
Find out the birthday (month and day but not year) of a randomly chosen person. What
is the sample space of the experiment. How many outcomes are in the event that the
person is born in July?

Problem 1.4.
Let the sample space of the experiment consist of the measured resistances of two re-
sistors. Give four examples of mutually exclusive and exhaustive set of events.

Problem 1.5.
An experiment involves tossing a pair of dice, one green and one red, and recording
the numbers that come up. Let x equal the outcome on the green die and y the outcome
on the red die.

(a) Describe the sample space S by listing the elements ( x, y).


(b) List the elements corresponding to the event A that the sum is greater than 8.
(c)List the elements corresponding to the event B that a 2 occurs on either die.
(d) List the elements corresponding to the event C that a number greater than 4 comes
up on the green die.
(e) List the elements corresponding to the events A ∩ B; B ∩ C; C ∩ A.
(f) Construct a Venn diagram to illustrate the intersections and unions of the events
A, B, and C.

Problem 1.6.
A coin is flipped tiwce. Let A be the event that the first flip is head, let B be the event
that the second flip is head and let C be the event that the two flips are the same.

(a) Describe the sample space S.


(b) List the elements corresponding to the events A ∩ B; B ∩ C; C ∩ A and A ∩ B ∩ C.

1.2 C OUNTING M ETHODS .

Problem 1.7.
Consider a binary code with 5 bits (0 or 1) in each code word. An example of a code
word is 01010. How many different code words are there? How many code words have
exactly three 0’s?

4
1.2. COUNTING METHODS.

Problem 1.8.
Consider a language containing four letters: A, B, C, D. How many three-letter words
can you form in this language? How many four-letter words can you form if each letter
appears only once in each word?

Problem 1.9.
On an American League baseball team with 15 field players and 10 pitchers, the man-
ager must select for the starting lineup, 8 field players, 1 pitcher, and 1 designated
hitter. A starting lineup specifies the players for these positions and the positions in a
batting order for the 8 field players and designated hitter. If the designated hitter must
be chosen among all the field players, how many possible starting lineups are there?

Problem 1.10.
A basketball team has three pure centers, four pure forwards, four pure guards, and
one swingman who can play either guard or forward. A pure position player can play
only the designated position. If the coach must start a lineup with one center, two
forwards, and two guards, how many possible lineups can the coach choose?

Problem 1.11.
A train consists of four carriages. There are six passengers standing on the station
platform.

(a) How many ways are there to arrange six passengers in four carriages?
(b) How many ways are there to arrange six passengers in four carriages such that the
first carriage consists of 3 passengers, the second carriage consists of 2 passengers
and the third carriage consists of 1 passenger?
(c) How many ways are there to arrange six passengers in four carriages such that
one carriage consists of 3 passengers, one carriage consists of 2 passengers and
one carriage consists of 1 passenger?
(d) How many ways are there to arrange six passengers in four carriages such that
each carriage consists of at least one passenger?

Problem 1.12.
Four married couples have bought 8 seats in the same row for a concert. In how many
different ways can they be seated

(a) with no restrictions?


(b) if each couple is to sit together?

5
1.2. COUNTING METHODS.

Problem 1.13.
How many distinct permutations can be made from the letters of the word INFINITY?

Problem 1.14.
(a) In how many ways can 6 people be lined up to get on a bus?
(b) If 3 specific persons, among 6, insist on following each other, how many ways are
possible?
(c) If 2 specific persons, among 6, refuse to follow each other, how many ways are
possible?

You might also like