232
edits
Entrance Announcement
MICTE 2080
2080 Magh 07
No edit summary |
No edit summary |
||
Line 8: | Line 8: | ||
'''Topic:''' Process Management | '''Topic:''' Process Management | ||
'''Teaching Item:''' Deadlock Detection and | '''Teaching Item:''' Deadlock Detection and Recovery | ||
'''Class:''' BICT 4th Semester | '''Class:''' BICT 4th Semester | ||
Line 39: | Line 39: | ||
*Open the presentation slide and briefly introduce topic then discuss various methods and algorithms used for deadlock detection, illustrating with diagrams and examples. | *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. | *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. | *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. | ||
Line 46: | Line 48: | ||
* Can you explain the difference between deadlock detection and deadlock prevention? | * Can you explain the difference between deadlock detection and deadlock prevention? | ||
* How does the Banker's algorithm work in deadlock | * How does the Banker's algorithm and Wait-for-graph work in deadlock detection? | ||
== 5. Evaluation: == | == 5. Evaluation: == | ||
Explore more about various deadlock detection algorithms and write on your note in detail. | Explore more about various deadlock detection algorithms and write on your note in detail. |
edits