Val Ed DLP

● Grade 10 – Probability and Statistics (Math)
Detailed Lesson Plan
School: CMU Laboratory High School Time Allotment: 1 hour
Teacher: Lloyd Vincent Gondao Learning Area: Values Education
Date: April 12, 2024 Fourth Quarter
I. OBJECTIVES
Content Standard:
Performance Standard:
Learning Competency:
At the end of the lesson, 90% the students must be able to:
a.
b
c.
II. SUBJECT MATTER/ CONTENT

A. References:
1.
B. Materials Needed and Technology Integration: PowerPoint Presentation, Laptop, TV,

Chalk, Blackboard.
C. Teaching Methods/Strategies: Cooperative Learning, Discussion
D. Values Integration: Determination, Fairness, Cooperation and Perseverance.
III. LESSON PROPER/ TEACHING AND LEARNING PROCESSES
Teacher's Activities Learner’s Activities
A. Preliminaries
May I request everyone to please stand up. (Mr. Carlo starts praying.)
Let us start the class by offering a prayer to
our Almighty Father. Mr. Carlo, please lead
the prayer. Everyone: Good morning, Ma’am.
Thank you for that Ms., good morning

class.
Before sitting down, please arrange your Everyone: Yes, Ma’am.
chairs and check if there is no garbage
on the floor.
Is anyone absent? Everyone: We are okay Ma’am, and Yes, we

Very good. are all ready.
How are you, class? I hope you are still

doing great, are you ready for today’s
class?
That is good to hear. Now I want to

remind everyone of the general rules/
the house rules.
1. Cell Phones must be in silent mode.

Keep your cell phones in your bag.
2. Listen attentively when the teacher is
discussing. Avoid unnecessary noise.
3. Actively participate in classroom
discussions/ activities.
4. Speak only when called or recognized
and stand up to give the answer.
5. Show respect to anyone inside and
outside of the classroom.
B. Motivation
Before we start let us have a game, you will be

divided into two teams, this row will be team 1
and this will be team 2
it is game that we are all familiar with it. It is,
CHARADES.
For those who are not familiar, it is a kind of a Answer:
guessing game in which one will act and the
other members will guess what word is being
described, you will have 15 secs to guess. Of
course, in this class the words are related to our
topic. You guess the word right and you get a
point. The group with the most points will win
the game.
Are you all ready?
Congratulations everyone, especially to our

winners.
C.Unlocking of Difficulties/ Review of

Prerequisite Knowledge.
Matthew: We discussed more examples of
Now, settle down everyone, this time I want the Fundamental Counting principle Ma’am
someone from the class to tell us what was your
previous all about?
Okay Kathleen, you are raising your hand Everyone: 5 options Ma’am
Thank you, Kathleen, you can now sit down
D.Lesson Development (Discussion, Everyone: Still 5 options Ma’am

Application, Activities)
a. Discussion
Today we will start our dicussion with a think

pair share activity, kindly choose a partner so
that you will have someone to share your
insights
we will give you a reading passage entitled
“Believe in me, you will read it for 5 minutes and
you will share your insights with your pair in
also five minutes. We will then choose 2 to 3
pairs to share in the class, the rest will be
collected.
Derek: An arrangement Ma’am
b. Application Everyone will read the definition
Okay, let us have an example. You can jot it

down if you want.
Example 1:10 Regional cyclist participated in a

regional race for a cause.
a. How many ways can the participants be rank

from 1st to 10th place? Everyone will read the definition
That is our example for permutation of objects

all at once. Now let us have the example for
Permutation of objects taken at a time.
b. If only the top three finalist can move to the

top three finals in how many ways can the 1 st,
2nd and 3rd be awarded?
Do you have any questions regarding the two
examples? (Students that will raise their hands will be
If none then let us proceed. acknowledged.
Harold: The first definition talks about the

Can everyone read.
permuting all the possible ways or outcomes
3. Distinguishable Permutation. while the next outcome talks about permuting
outcomes in a specific situation.
- The number of permutations of n objects
where n1, n2, n3, give the identitical type of object,
n!
is defined by .
n ! , n 2! , n 3 !
n!
Is denoted by. .
n ! , n 2! , n 3 ! …
So, it’s a bit difficult to explain it into words so (5 volunteers will be come at front)
let us jump into the example to explain it in
detail.
Example 3: In how many ways can we arrange

the letters of the words STATISTICS?
Okay so as you can see, we counted the

number of identical letters then we looked for its
factorial divided it to the total number of letters.
This kind of permutation is identifiable because
it is mostly arrangement of letters in a word.
Do you have any questions about the third

example? If none then let us have the final
example and the final type.
4. Circular Permutation
Are the arrangment of objects when they are

arranged in a circular pattern. There is no
starting point or ending point.
Is denoted by (n-1)!
Why is it n-1? Does anyone have any idea?
Diane: What if Ma’am there is a tie between
Correct since there is no starting point and two players?
ending point, so if we have 4 people arranged in
a circle, from any vantage poin the arrangment
4 ! 24
is the same giving us = =6 which is the
4 4
same as 3!
Okay so did you understand? Do you have any Everyone: Count them as one Ma’am
questions? If none then let us have our final
example
Example 4: In how many ways can you arrange

5 people be arrange to sit around in a circular
table.
Okay so we have, 24 ways to arrange 5 people

in a circular table. Solution 1
nPn=n!
Very good all your answers are correct; I think 10P10= 10 !=10 x 9 x 8 x 7 x 6 x 5 x 4 x 3 x 2 x 1
you are ready for an activity bur first let us
=3628800 ways we can rank the participants.
review.
c. Generalization.
How many types of permutation did we Solution 2:

discussed? Kindly enumerate them. n!
nPr=
( n−r ) !
10 10 10.9.8 . 7 !
= = =
Which type of permutation permutates only a (10 !−3 !) 7 ! 7!
specific number from a total? 10.9.8= 720 ways to award the 1st, 2nd, and 3rd
What is the formula for the permutation of

objects all at once?
Which type of permutation is denoted by ( n−1 ) !
This permutation counts identical objects

together.
Very good now I think that you are ready, kindly

get 1\2 sheet of paper and answer the following
questions.
Solution:
S=3
T=3
I=2 P=10
10 ! 10.9.8 .7 . 6. 5. 4 . 3.2.1
P= = =
3 ! 3 ! 2! 3! 3 ! 2 !
10.9.8.7.5.2
=50040 ways to arrange the letters in the in

the word STATISTICS.
Solution: (n-1)!
4! - 1= 3! = 3.2.1=6 ways to arrange people in
a circular table.
Everyone: 4 Ma’am, Permutation of objects all

at once, Permutation of objects taken at a
time. Distinguishable Permutation and
Circular Permutation.
Everyone: Permutation of objects taken at a
time.
Everyone: nPn=n!
Everyone: Circular Permutation
Everyone: Distinguishable Permutation
IV. EVALUATION
Part 1: True or False. Write TRUE if the statement is correct and FALSE if otherwise.
True 1. Permutation is an ordered arrangement of distinguishable objects that allows repetition

among the objects.
True 2. In a circular arrangement of a group of people the arrangement does not change even if
everyone in the group moves one place to the right of his or her original position.
n?
_False 3. Distinguishable permutation is denoted by
n ! , n 2! , n 3 ! …
n!
_False 4. Permutation of objects all at once is denoted by
( n−r ) !
True 5. The most important for permutation is arrangement.
Part 2: Problem Solving. Show the solution of the following permutation.
1. How many 6-letter arrangement can be formed from the letters of the word “TUTEES”?
Answer: 180 ways
2.In the question-and-answer portion of a beauty pageant, the top 5 candidates will each be
asked a question by designated judges. In how many ways they can arrange to answer the
judges question? (Answer:120 ways)
3. In a horse race, 7 horses joined, in how many ways can the horses be arranged with only the
winner and the runner up can advance to the next round? (Answer: 42 ways)
V. ASSIGNMENT
Copy and answer the following problems in a whole sheet of paper.
1.How many distinguishable permutations are the letters of the word “TENNESSEE”?
(Answer:3,780 ways)
2.How many different arrangements consisting of 5 letters can be formed from the letters of the
word “PARENTS”. (Answer: 2,520)
3. How many ways can 8 children hold hands and form a ring?
(Answer 5,040)
4. In how many ways can the letters O, G, T, I, D, A and P be arranged so that:
a. All the vowels are together (Answer 720 ways)

b. The vowels O and A are not together. (Answer 1440 ways)
Prepared by: Checked by:
LALAINE S. TAPAY ROY M. LABASTILLA

Student Teacher Grade 10 Math Adviser

Val Ed DLP

Uploaded by

Copyright:

Available Formats

Val Ed DLP

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Val Ed DLP

Uploaded by

Copyright:

Available Formats

● Grade 10 – Probability and Statistics (Math)

Detailed Lesson Plan

School: CMU Laboratory High School Time Allotment: 1 hour

Teacher: Lloyd Vincent Gondao Learning Area: Values Education

Date: April 12, 2024 Fourth Quarter

II. SUBJECT MATTER/ CONTENT

B. Materials Needed and Technology Integration: PowerPoint Presentation, Laptop, TV,

C. Teaching Methods/Strategies: Cooperative Learning, Discussion

D. Values Integration: Determination, Fairness, Cooperation and Perseverance.

III. LESSON PROPER/ TEACHING AND LEARNING PROCESSES

Teacher's Activities Learner’s Activities

Thank you for that Ms., good morning

Is anyone absent? Everyone: We are okay Ma’am, and Yes, we

How are you, class? I hope you are still

That is good to hear. Now I want to

1. Cell Phones must be in silent mode.

Before we start let us have a game, you will be

Are you all ready?

Congratulations everyone, especially to our

C.Unlocking of Difficulties/ Review of

Thank you, Kathleen, you can now sit down

D.Lesson Development (Discussion, Everyone: Still 5 options Ma’am

Today we will start our dicussion with a think

Okay, let us have an example. You can jot it

Example 1:10 Regional cyclist participated in a

a. How many ways can the participants be rank

That is our example for permutation of objects

b. If only the top three finalist can move to the

Harold: The first definition talks about the

Example 3: In how many ways can we arrange

Okay so as you can see, we counted the

Do you have any questions about the third

Are the arrangment of objects when they are

Example 4: In how many ways can you arrange

Okay so we have, 24 ways to arrange 5 people

How many types of permutation did we Solution 2:

What is the formula for the permutation of

Which type of permutation is denoted by ( n−1 ) !

This permutation counts identical objects

Very good now I think that you are ready, kindly

=50040 ways to arrange the letters in the in

Everyone: 4 Ma’am, Permutation of objects all

Everyone: Circular Permutation

Everyone: Distinguishable Permutation

True 1. Permutation is an ordered arrangement of distinguishable objects that allows repetition

Part 2: Problem Solving. Show the solution of the following permutation.

a. All the vowels are together (Answer 720 ways)

Prepared by: Checked by:

LALAINE S. TAPAY ROY M. LABASTILLA

You might also like