User:Srijana Paudel/Teaching Lesson Plan 16

Subject: Operating System

Period: Third

Topic: Process Management

Teaching Item: Scheduling Algorithms: First Come First Serve(FCFS)

Class: BICT 4th Semester

Unit: Two

Time: 50 min

No. of Students: 20

1. Specific Objective:[edit | edit source]

At the end of this lesson, students will be able to:

Explain the working principle of FCFS.
Analyze and solve simple problems using the FCFS algorithm having 0 arrival time and variable arrival time given.

I will enter the classroom and will motivate students before starting the lesson to ensure their concentration.
I will write today's topic "First Come First Serve (FCFS) Scheduling Algorithm" on the board.
I will begin the class by asking some questions to students related to previous lesson so that they can apply knowledge of CPU Scheduling and Scheduling criteria while solving problem of today's topic.
I will open the presentation slide and will briefly introduce the topic with the help of visuals and examples.
I will explain the working principle of FCFS algorithm using diagrams and algorithms.
I will engage students in a group activity where they will solve simple problems using FCFS algorithm on paper. To understand FCFS algorithm in depth I will give two types of examples, one with a 0 arrival time for all processes and another having variable arrival time for each process.
I will summarize the lesson in brief, highlighting the key points discussed and ensuring understanding.
I will ask students to share their thoughts and clarify any doubts or questions they might have.
I will conclude the lesson by emphasizing the importance of FCFS algorithm in operating systems.

During the session, ask questions like,

Solve additional problems related to FCFS scheduling algorithm from online resources.