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

From ICTED-WIKI
Jump to navigation Jump to search
No edit summary
No edit summary
 
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 Round Robin.
* 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 Round Robin algorithm.


== 2. Instructional materials: ==
== 2. Instructional materials: ==
Line 37: Line 37:
* I will write today's topic "Round Robin Algorithm" on the board.
* I will write today's topic "Round Robin 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 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 Round Robin algorithm using diagrams and algorithms. And before starting numerical problem I will explain about time quantum in detail first.
* 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 Round Robin algorithm on paper. To understand SJF algorithm in depth I will solve various examples with different quantum time and assign one problem to students for classwork.
* 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 Round Robin 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 Round Robin works?
* What is benefit of using SJF?
* What is benefit of using Round Robin?
* What kinds of job gets benefited by SJF?
* What kinds of job gets benefited by Round Robin?
* Is Round Robin preemptive or non-preemptive algorithm?
* What did you understand about time quantum?


== 5. Evaluation: ==
== 5. Evaluation: ==
Solve additional problems related to SJF scheduling algorithm from online resources.
Solve additional problems related to Round Robin scheduling algorithm from online resources having various time quantum.

Latest revision as of 21:50, 20 April 2024

Subject: Operating System

Period: Third

Topic: Process Management

Teaching Item: Round Robin Algorithm

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 Round Robin.
  • Analyze and solve simple problems using the Round Robin 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 "Round Robin 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 Round Robin algorithm using diagrams and algorithms. And before starting numerical problem I will explain about time quantum in detail first.
  • I will engage students in a group activity where they will solve simple problems using Round Robin algorithm on paper. To understand SJF algorithm in depth I will solve various examples with different quantum time and assign one problem to students for classwork.
  • 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 Round Robin algorithm in operating systems.

4. Assessment:

During the session, ask questions like,

  • Tell me how Round Robin works?
  • What is benefit of using Round Robin?
  • What kinds of job gets benefited by Round Robin?
  • Is Round Robin preemptive or non-preemptive algorithm?
  • What did you understand about time quantum?

5. Evaluation:

Solve additional problems related to Round Robin scheduling algorithm from online resources having various time quantum.