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

From ICTED-WIKI
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
 
(One intermediate revision by the same user not shown)
Line 2: Line 2:


<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:''' Introduction
'''Topic:''' Process Management


'''Teaching Item:'''  
'''Teaching Item:''' Deadlock Detection and Recovery


'''Class:''' BICT 4th Semester  
'''Class:''' BICT 4th Semester  


'''Unit:''' One
'''Unit:''' Two


'''Time:''' 50 min
'''Time:''' 50 min
Line 21: Line 21:
== 1. Specific Objective: ==
== 1. Specific Objective: ==


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


*  
* Understand the methods and algorithms used for deadlock detection.
*  
* Identify and explain the various deadlock recovery techniques.


== 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: ==


*Enter the classroom, and motivate students before starting the lesson for their concentration on the lesson, and then write todays topic on the board.
*Enter the classroom, and motivate students before starting the lesson for their concentration on the lesson, and then write todays topic "Deadlock Detection and Deadlock Recovery" on the board.
*Begin the class by asking some questions to students related to todays topic.
*Begin the class by asking some questions to students related to previous topic to know either they remember what they were taught with clear understanding or not. Like, Can anyone define what a deadlock is?, Why is deadlock detection important in operating systems?, How do you think operating systems handle deadlocks?
*Open the presentation slide and briefly introduce topic.
*Open the presentation slide and briefly introduce topic then discuss various methods and algorithms used for deadlock detection, illustrating with diagrams and examples.
*
*After that explain the different deadlock recovery techniques, emphasizing their advantages and disadvantages.
*Summarize the lesson in brief.
*In the case of deadlock explain about two different category i.e., Deadlock Detection with one Resource of Each Type (Wait-for Graph), Deadlock Detection with Multiple Resource of Each Type(Bankers Algorithm).
*For deadlock recovery explain about four primary methods of deadlock recovery: process termination, resource pre-emption, priority inversion, and rollback.
*Summarize the lesson in brief, highlighting the key points and ensuring that students have a clear understanding of deadlock detection and recovery in operating systems.


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


*  
* Can you explain the difference between deadlock detection and deadlock prevention?
*  
* How does the Banker's algorithm and Wait-for-graph work in deadlock detection?


== 5. Homework: ==
== 5. Evaluation: ==
Explore more about various deadlock detection algorithms and write on your note in detail.

Latest revision as of 02:37, 21 April 2024


Subject: Operating System

Period: Third

Topic: Process Management

Teaching Item: Deadlock Detection and Recovery

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 to:

  • Understand the methods and algorithms used for deadlock detection.
  • Identify and explain the various deadlock recovery techniques.

2. Instructional materials:

3. Teaching Learning Activities:

  • Enter the classroom, and motivate students before starting the lesson for their concentration on the lesson, and then write todays topic "Deadlock Detection and Deadlock Recovery" on the board.
  • Begin the class by asking some questions to students related to previous topic to know either they remember what they were taught with clear understanding or not. Like, Can anyone define what a deadlock is?, Why is deadlock detection important in operating systems?, How do you think operating systems handle deadlocks?
  • Open the presentation slide and briefly introduce topic then discuss various methods and algorithms used for deadlock detection, illustrating with diagrams and examples.
  • After that explain the different deadlock recovery techniques, emphasizing their advantages and disadvantages.
  • In the case of deadlock explain about two different category i.e., Deadlock Detection with one Resource of Each Type (Wait-for Graph), Deadlock Detection with Multiple Resource of Each Type(Bankers Algorithm).
  • For deadlock recovery explain about four primary methods of deadlock recovery: process termination, resource pre-emption, priority inversion, and rollback.
  • Summarize the lesson in brief, highlighting the key points and ensuring that students have a clear understanding of deadlock detection and recovery in operating systems.

4. Assessment:

During the session, ask questions like,

  • Can you explain the difference between deadlock detection and deadlock prevention?
  • How does the Banker's algorithm and Wait-for-graph work in deadlock detection?

5. Evaluation:

Explore more about various deadlock detection algorithms and write on your note in detail.