165
edits
User:Saroj Neupane Lesson Plan 1: Difference between revisions
User:Saroj Neupane Lesson Plan 1 (view source)
Revision as of 05:57, 27 November 2023
, 27 November 2023no edit summary
mNo edit summary |
No edit summary |
||
| Line 14: | Line 14: | ||
==Specific Objective== | |||
1.Students will understand the basic concept of algorithms. | 1.Students will understand the basic concept of algorithms. | ||
| Line 21: | Line 21: | ||
==Teaching Aids== | |||
1.Whiteboard and markers | 1.Whiteboard and markers | ||
| Line 30: | Line 30: | ||
==Introduction (2 minutes)== | |||
* Begin by asking students if they have heard the term "algorithm" before. Encourage them to share their thoughts. | * Begin by asking students if they have heard the term "algorithm" before. Encourage them to share their thoughts. | ||
| Line 37: | Line 37: | ||
==Teaching Learning Activity - Algorithm Demonstration (3 minutes)== | |||
Write a simple algorithm on the board for a familiar task, like making a sandwich. | Write a simple algorithm on the board for a familiar task, like making a sandwich. | ||
| Line 54: | Line 54: | ||
==Group Activity - Creating Algorithms (3 minutes)== | |||
Divide the class into small groups (5 students in each). | Divide the class into small groups (5 students in each). | ||
Provide each group with an index card and ask them to come up with a simple algorithm for a different everyday task. Some examples include tying shoelaces, brushing teeth etc | Provide each group with an index card and ask them to come up with a simple algorithm for a different everyday task. Some examples include tying shoelaces, brushing teeth etc. | ||
Each group will write their algorithm on the index card. | Each group will write their algorithm on the index card. | ||
==Sharing and Discussion (2 minutes)== | |||
Ask each group to share their algorithm with the class. | Ask each group to share their algorithm with the class. | ||
| Line 70: | Line 70: | ||
==Conclusion (1 minute)== | |||
Summarize the key points of the lesson: an algorithm is a step-by-step set of instructions, and it must be clear and unambiguous. | Summarize the key points of the lesson: an algorithm is a step-by-step set of instructions, and it must be clear and unambiguous. | ||
==Assessment== | |||
Observe students participation in the group activity and their ability to articulate the steps of their algorithms. | Observe students participation in the group activity and their ability to articulate the steps of their algorithms. | ||