User:Srijana Paudel/Teaching Lesson Plan 18

Subject: Operating System

Period: Third

Topic: Process Management

Teaching Item: Shortest Remaining Time First(SRTF)

Class: BICT 4th Semester

Unit: Two

Time: 50 min

No. of Students: 20

1. Specific Objective:

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

• Explain the working principle of SRTF.
• Analyze and solve simple problems using the SRTF algorithm.

2. Instructional materials:

• Daily Usage Materials,
• PowerPoint Presentation Slide,
• Laptop,
• Projector etc.

3. Teaching Learning Activities:

• I will enter the classroom and will motivate students before starting the lesson to ensure their concentration.
• I will write today's topic "Shortest Remaining Time First(SRTF)" 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 SRTF algorithm using diagrams and algorithms.
• I will engage students in a group activity where they will solve simple problems using SRTF algorithm on paper. To understand SJF algorithm in depth with various examples.
• 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 SRTF algorithm in operating systems.

4. Assessment:

During the session, ask questions like,

• Tell me how SRTF works?
• What is benefit of using SRTF?
• What kinds of job gets benefited by SRTF?
• Is SRTF preemptive or non-preemptive scheduling?
• What is preemptive scheduling?

5. Evaluation:

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