User:Srijana Paudel/Teaching Lesson Plan 18: Difference between revisions

From ICTED-WIKI
Jump to navigation Jump to search
No edit summary
No edit summary
 
Line 7: Line 7:
'''Topic:''' Process Management  
'''Topic:''' Process Management  


'''Teaching Item:''' Scheduling Algorithms: Shortest Job First(SJF)  
'''Teaching Item:''' Shortest Remaining Time First(SRTF)  


'''Class:''' BICT 4th Semester  
'''Class:''' BICT 4th Semester  
Line 22: Line 22:
At the end of this lesson, students will be able:
At the end of this lesson, students will be able:


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


== 2. Instructional materials: ==
== 2. Instructional materials: ==
Line 35: Line 35:


* I will enter the classroom and will motivate students before starting the lesson to ensure their concentration.
* I will enter the classroom and will motivate students before starting the lesson to ensure their concentration.
* I will write today's topic "Shortest Job First(SJF) Scheduling Algorithm" on the board.
* 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 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 open the presentation slide and will briefly introduce the topic with the help of visuals and examples.
* I will explain the working principle of SJF algorithm using diagrams and algorithms.
* 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 SJF algorithm on paper. To understand SJF 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 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 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 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 SJF algorithm in operating systems.
* I will conclude the lesson by emphasizing the importance of SRTF algorithm in operating systems.


== 4. Assessment: ==
== 4. Assessment: ==
Line 48: Line 48:
During the session, ask questions like,
During the session, ask questions like,


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


== 5. Evaluation: ==
== 5. Evaluation: ==
Solve additional problems related to SJF scheduling algorithm from online resources.
Solve additional problems related to SRTF scheduling algorithm from online resources.

Latest revision as of 21:30, 20 April 2024

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:

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.