Daily Lesson Plan: Basic Education Department Junior High School

You might also like

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 4

BASIC EDUCATION DEPARTMENT

JUNIOR HIGH SCHOOL


SUBJECT: Mathematics 10
GRADE LEVEL/SECTION: 10- St. Paul, 10 - St. James
DATE: March 13, 2023

DAILY LESSON PLAN


The learner demonstrates understanding of key concepts of combinatorics and
CONTENT STANDARD:
probability.
The learner is able to use precise counting technique and probability in
PERFORMANCE STANDARD:
formulating conclusions and making decisions.
- Illustrate key concepts of fundamental counting principle and permutation.
- Show perseverance in solving for fundamental counting principle and
LEARNING COMPETENCIES: permutation problems.
- Solve and analyze problems involving fundamental counting principle and
permutation.

I. LEARNING OBJECTIVES - Assessing the learning for fundamental counting principle and permutation.

II. LEARNING CONTENT


Subject Matter: Assessment for Fundamental Counting Principle and Permutation

Reference: E-Math and The World of Mathematics and Beyond 10 pages 259-261
Materials: Textbooks, Slide Presentations, Blackboard, Chalk
Values: Perseverance and honesty (Integrity)
- Greetings
Good morning, Class!
- Prayer
A student will lead the prayer.
III. LEARNING PROCEDURE - Classroom Management
- Checking of Attendance
Is everyone present today?
To those who are present, kindly share your learnings to your classmates
whom cannot attend this class today.
TEACHER’S ACTIVITY
EXPLORE Review

Fundamental Counting Principle


Three Methods of Counting Events
1. Tree Diagram
How many possible outcomes when you flip a coin and a die?
2. Grid Table
How many possible outcomes when you flip a coin and a die?
H T
1 H,1 T,1
2 H,2 T,2
3 H,3 T,3
4 H,4 T,4
5 H,5 T,5
6 H,6 T,6
12 possible outcomes
3. Systematic Listing
How many possible outcomes when you flip a coin and a die?
(H,1), (H,2), (H,3), (H,4), (H,5), (H,6), (T,1), (T,2), (T,3), (T,4), (T,5), (T,6)
12 possible outcomes

Permutation
1. Permutation with Repetition
a. Supposing that a safe lock has 10 numbers to choose from (that is, from 0 to 9),
how many different 5-digit number combination can you possibly choose?
P = nr n=10, r=5
P = 105 = 100,000 possible arrangements
b. Suppose a password consisted of 8 letters; how many possible passwords can
be permutated of this premise?
P = nr n=26, r=8
P= 268 = 208,827,064,576 possible passwords
2, Permutation with Repetition
a. Supposing that a safe lock has 10 numbers to choose from (that is, from 0 to 9),
how many different 10-digit number combination can you possibly choose?
(Without repeating digits)
nPn = n!

10P10 = 10! = 10⦁9⦁8⦁7⦁6⦁5⦁4⦁3⦁2⦁1= 3,628,800 possible arrangemets


b. Suppose a password consisted of 8 letters; how many possible passwords can
be permutated of this premise? (Without repetition)
n!
n Pr =
( n−r ) !
26
26 ! 26 ! 26 ⦁ 25⦁ 24 ⦁ 23 ⦁ 22⦁ 21 ⦁20 ⦁ 19 ⦁18 !
P8= = = =26 ⦁25 ⦁ 24 ⦁ 23 ⦁ 22⦁ 21⦁ 20
( 26−8 ) ! 18 ! 18 !
¿ 62,990,928,000
c. How many can the word MISSISSIPPI be arranged in a row?
Solution:
n=11
m=1 i=4 s=4 p=2
n!
P=
n1 ! ⦁ n2 ! ⦁ n 3 ! ⦁ … … … nk !
11! 11 ⦁ 10⦁ 9⦁ 8 ⦁ 7 ⦁ 6⦁ 5 ⦁ 4 ⦁ 3 ⦁ 2⦁ 1
P= = =34,650 arrangements
1 ! ⦁ 4 ! ⦁ 4 ! ⦁ 2 ! 1⦁ ( 4 ⦁ 3⦁ 2 ⦁1 ) ⦁ ( 4 ⦁ 3 ⦁ 2⦁ 1 ) ⦁ (2 ⦁ 1 )

Long Quiz

Fundamental Counting Principal


I. Illustrate the following:
1. Show how many possible outcomes when tossing two coins and a die using a
tree diagram. (5 points)
2. Show how many possible outcomes when tossing two coins and a die using a
grid table. (5 points)

Permutation and Factorials


II. Evaluate the following: (2 points each)
1. 2! ⦁7! 6. 10P5
TRANSFER 2. 3! ⦁4! 7. 13P9
2! ⦁ 8 ! 8. 16P7
3.
6!
16 ! 9. 100P3
4.
7 ! ⦁160
5. 22⦁2! ⦁4! 10. 10P6 ⦁ 10P7
III. Solve the following problems. (5 points each)
1. In how many ways can 8 books be arranged on a shelf?
2. In how many ways can 7 out of 14 math problems be chosen for a quiz?
3. In how many ways can the letters of the word "SIMPLE" be arranged?
4. In how many ways can the letters of the word "ANTETOKOUNMPO" be
arranged?
Assignment
Read about Combinations.
I. ASSIGNMENT
Goodbye class! See you tomorrow!
Prepared by:
______________________________________
Mr. King Ernie P. Menor
Student Teacher

Reviewed by:
______________________________________ ______________________________________
Ms. Jan Marielli M. Mendoza Mr. Joshua B. Dalangin
Cooperating Teacher Subject Coordinator

Checked by: Noted by:


______________________________________ ______________________________________
Ms. Mila A. Castro Mr. Wyndell S. Gaspan III
JHS Academic Coordinator Basic Education Dept. Principal

You might also like