Scribd
Upload
49 views2 pages

Tut 01

(i) The document is a tutorial for a probability and statistics class that provides students with 6 practice problems to work through related to probability concepts like sample spaces, events, and counting techniques. (ii) The problems involve topics like listing outcomes of random events, expressing events using set notation, counting arrangements of people in a row allowing certain restrictions, counting possible numbers formed from given digits, and counting routes between points on a grid avoiding or including certain locations. (iii) The answers provided are numbers that would be the result of working through the counting problems, like the number of possible 3-digit numbers that can be formed from a set of digits or the number of ways for Little Red Riding Hood to

Uploaded by

Sheryl Kong
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
49 views2 pages

Tut 01

(i) The document is a tutorial for a probability and statistics class that provides students with 6 practice problems to work through related to probability concepts like sample spaces, events, and counting techniques. (ii) The problems involve topics like listing outcomes of random events, expressing events using set notation, counting arrangements of people in a row allowing certain restrictions, counting possible numbers formed from given digits, and counting routes between points on a grid avoiding or including certain locations. (iii) The answers provided are numbers that would be the result of working through the counting problems, like the number of possible 3-digit numbers that can be formed from a set of digits or the number of ways for Little Red Riding Hood to

Uploaded by

Sheryl Kong
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

N ATIONAL U NIVERSITY OF S INGAPORE

D EPARTMENT OF S TATISTICS & A PPLIED P ROBABILITY


ST2334 P ROBABILITY AND S TATISTICS
S EMESTER II, AY 2022/2023

Tutorial 01

Please work on the questions before attending the tutorial.

1. The NUS library has five copies of a certain text on reserve. Two copies (1 and 2) are first editions,
and the other three (3, 4 and 5) are second editions. A student examines these books in random
order, stopping only when a second edition has been selected. One possible outcome is 5, and
another is 213 (where books 2, 1, 3 are examined, in that order).

(i) List the outcomes in the sample space S.


(ii) Let A denote the event that exactly one book is examined. List the outcomes in A.
(iii) Let B be the event that book 5 is examined. List the outcomes in B.
(iv) Let C be the event that book 1 is not examined. List the outcomes in C.
(v) List the outcomes in A∩B, A∪B, and A∩B∩C respectively. Are A and B mutually exclusive?

2. Let E, F, and G be three events. Find expressions for the events so that, of E, F, and G,

(i) only E occurs;


(ii) both E and G, but not F, occur;
(iii) at least one of the events occurs;
(iv) at least two of the events occur;
(v) all three events occur;
(vi) none of the events occurs.

3. How many ways can 4 men and 3 women sit in a row if no two women are allowed to sit together?

4. Consider the digits 0, 2, 4, 6, 8 and 9. If each digit can be used only once,

(i) how many three-digit numbers can be formed?


(ii) how many of these numbers in (i) are odd numbers?
(iii) how many of these odd numbers in (ii) are greater than or equal to 620?

5. An exam paper consists of seven questions. Candidates are asked to answer five questions. Find
the number of ways to select five questions (in each of the following cases) if

(i) there are no restrictions;


(ii) the first two questions must be answered;
(iii) at least one of the first two questions must be answered; and
(iv) exactly two from the first three questions must be answered.

6. Little Red Riding Hood lives at point A : (0, 0), and wants to visit her grandmother at point B :
(13, 8). At each step, she can only go East (Right) or North (Up) along the grid as shown below.
The Big Bad Wolf lives at Y : (10, 6).

1
Y (10, 6)
B(13, 8)

North

East

X(2, 2) A(0, 0)

(i) How many ways can Little Red Riding Hood go to visit her grandmother regardless of
whether she will pass by the Big Bad Wolf?
(ii) How many ways can she go to visit her grandmother, avoiding the Big Bad Wolf?
(iii) Little Red Riding Hood wants to buy a gift for her grandmother at X : (2, 2). How many
ways can she go to visit her grandmother, stopping by X but avoiding Y ?

Answers

4. (i) 100; (ii) 16; (iii) 7. 6. (i) 203490; (ii) 123410; (iii) 44556.
5. (i) 21; (ii) 10; (iii) 20; (iv) 12.

You might also like