Entrance Announcement
MICTE 2080
2080 Magh 07
User:Srijana Paudel/Teaching Lesson Plan 18: Difference between revisions
Jump to navigation
Jump to search
Created page with "__notoc__ <div style="column-count: 2; column-gap: 20px;"> '''Subject :''' Operating System '''Period:''' Third '''Topic:''' Introduction '''Teaching Item:''' '''Class:''' BICT 4th Semester '''Unit:''' One '''Time:''' 50 min '''No. of Students:''' 20 </div> == 1. Specific Objective: == At the end of this lesson, students will be able: * * == 2. Instructional materials: == * Daily Usage Materials, * [https://drive.google...." |
No edit summary |
||
| Line 1: | Line 1: | ||
__notoc__ | __notoc__ | ||
<div style="column-count: 2; column-gap: 20px;"> | <div style="column-count: 2; column-gap: 20px;"> | ||
'''Subject :''' Operating System | '''Subject:''' Operating System | ||
'''Period:''' Third | '''Period:''' Third | ||
'''Topic:''' | '''Topic:''' Process Management | ||
'''Teaching Item:''' | '''Teaching Item:''' Scheduling Algorithms: Shortest Job First(SJF) | ||
'''Class:''' BICT 4th Semester | '''Class:''' BICT 4th Semester | ||
'''Unit:''' | '''Unit:''' Two | ||
'''Time:''' 50 min | '''Time:''' 50 min | ||
| Line 23: | 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. | ||
* | * Analyze and solve simple problems using the SJF algorithm having 0 arrival time and variable arrival time given. | ||
== 2. Instructional materials: == | == 2. Instructional materials: == | ||
* Daily Usage Materials, | * Daily Usage Materials, | ||
* [https://drive.google.com/file/d/1A-WuUtvHpmoGuKhCY5t34TXv1IRqT6SI/view?usp=drive_link PowerPoint Presentation Slide], Laptop, Projector etc. | * [https://drive.google.com/file/d/1A-WuUtvHpmoGuKhCY5t34TXv1IRqT6SI/view?usp=drive_link PowerPoint Presentation Slide], | ||
* Laptop, | |||
* Projector etc. | |||
== 3. Teaching Learning Activities: == | == 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 Job First(SJF) 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 SJF 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 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 SJF algorithm in operating systems. | |||
== 4. Assessment: == | == 4. Assessment: == | ||
| Line 44: | Line 48: | ||
During the session, ask questions like, | During the session, ask questions like, | ||
* | * Tell me how SJF works? | ||
* | * What is benefit of using SJF? | ||
* What kinds of job gets benefited by SJF? | |||
== 5. | == 5. Evaluation: == | ||
Solve additional problems related to SJF scheduling algorithm from online resources. | |||
Revision as of 21:27, 20 April 2024
Subject: Operating System
Period: Third
Topic: Process Management
Teaching Item: Scheduling Algorithms: Shortest Job First(SJF)
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 SJF.
- Analyze and solve simple problems using the SJF algorithm having 0 arrival time and variable arrival time given.
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 Job First(SJF) 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 SJF 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 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 SJF algorithm in operating systems.
4. Assessment:
During the session, ask questions like,
- Tell me how SJF works?
- What is benefit of using SJF?
- What kinds of job gets benefited by SJF?
5. Evaluation:
Solve additional problems related to SJF scheduling algorithm from online resources.