Table of Contents
On this page, you will find all the most important and most asked questions from unit 3 of the Operating subject.
Questions
- What are the criteria of CPU Scheduling algorithms?
- Explain the preemptive and non-premptive scheduling algorithm.
- Write the various CPU Scheduling algorithm.
- Discuss the FCFS(First Come First Serve) scheduling algorithm. Write its advantage and disadvantage.
- Discuss the SJF(Shortest Job First) scheduling algorithm. Write its advantage and disadvantage.
- Discuss the Priority scheduling algorithm. Write its advantage and disadvantage.
- Discuss the Round Robin scheduling algorithm. Write its advantage and disadvantage.
- Discuss the multilevel queue scheduling algorithm. Write its advantage and disadvantage.
- Discuss the multilevel feedback queue scheduling algorithm. Write its advantage and disadvantage.
- What is deadlock? Explain with the help of example.
- Write the necessary condition for deadlock.
- What do you understand by resource allocation graph. Explain with suitable diagram.
- How you can prevent the deadlock.
- What do you understand by deadlock avoidance?
- Explain the banker’s algorithm for avoiding deadlock.
- What do you understand by starvation?
- Write the difference between deadlock and starvation.
What did you think?
Similar Reads
-
Advantages and Disadvantage of User level and Kernel Level Threads
User-Level Threads Advantages of User-Level Threads Speed and Efficiency: Operations such as thread creation, switching, and destruction are faster because… -
Difference Between User-level and kernel-level thread
User-level and kernel-level threads represent two approaches to thread management in operating systems. Both have some differences Difference Between User-level… -
What is Deadlock in OS? Explain with the help of a diagram.
A deadlock is a condition where each of the processes is waiting for a resource which is allotted to other… -
Preemptive and Non-Preemptive Algorithm in Operating System
Preemptive Scheduling Algorithm Here, a scheduler can preempt a running low-priority process at any time when a high-priority process enters… -
CPU scheduling algorithms Criteria in Operating System
There are different criteria for the CPU scheduling algorithm. CPU scheduling algorithms Criteria are CPU utilization: The main purpose of… -
Sleeping Barber Problem of Synchronization in Operating System
It is a synchronization and inter-process communication problem. This problem is based on a barbershop. A barbershop has a single… -
Reader-Writer Problem in Operating System with Code
The readers and writers problem based on an object like a file which is shared in different processes. Some processes… -
Discuss the Classical problem of synchronization
Using semaphores for synchronization is the traditional way to present the solutions. There are four types of the classical problem… -
Semaphore in Operating System and its types
A semaphore is simply an integer variable that is shared between multiple threads. We can also say A semaphore is… -
Mutual exclusion in Operating System with its four conditions
When a process is executed in a critical section, then no other process can be executed in their critical section.…