OPERATING SYSTEMS - UNIT III

What is the primary difference between job scheduling and process scheduling?

• Process scheduling handles queued tasks, while job scheduling executes processes.

• Job scheduling is for managing memory allocation.

• Job scheduling manages queued tasks, while process scheduling manages currently executing processes.

• Job scheduling is only relevant for batch processing.

Explain the role of a process scheduler in an operating system.

• The process scheduler is responsible for managing memory allocation.

• The process scheduler handles user input and output operations.

• The role of a process scheduler is to manage the execution of processes by allocating CPU time and resources, ensuring efficient multitasking and system responsiveness.

• The process scheduler is in charge of network communication between devices.

What are the main types of process scheduling policies?

• Last-Come, Last-Served

• First-Come, First-Served, Shortest Job Next, Round Robin, Priority Scheduling, Multilevel Queue Scheduling

• Equal Time Scheduling

• Random Selection Scheduling

Describe one common process scheduling algorithm and its advantages.

• First-Come, First-Served scheduling algorithm is efficient for all process types.

• Round Robin scheduling algorithm is advantageous because it ensures fair allocation of CPU time among processes, reduces waiting time for shorter processes, and is simple to implement.

• Shortest Job Next scheduling algorithm prioritizes longer processes.

• Priority scheduling algorithm can lead to starvation of shorter processes.

What is an interrupt and how does it affect process scheduling?

• An interrupt is a signal that only affects hardware components, not process scheduling.

• An interrupt is a method to increase the CPU's processing speed by ignoring lower-priority tasks.

• An interrupt is a signal that temporarily halts a process to allow the CPU to address a higher-priority task, affecting process scheduling by enabling immediate response to urgent events.

• An interrupt is a permanent stop of a process that cannot be resumed.

List the four necessary conditions for a deadlock to occur.

• Mutual exclusion, hold and wait, no preemption, circular wait

• Resource allocation, process termination, priority scheduling, deadlock detection

• Hold and wait, resource preemption, process starvation, mutual exclusion

• Mutual exclusion, resource sharing, process termination, circular dependency

What are the seven cases of deadlock?

• The seven cases of deadlock are: Mutual Exclusion, Hold and Wait, No Preemption, Circular Wait, Resource Allocation Graph, Wait-Die and Wound-Wait Schemes, Deadlock Detection and Recovery.

• Thread Synchronization

• Resource Locking

• Process Termination

How can deadlocks be modeled in an operating system?

• Deadlocks are only a concern in distributed systems.

• Deadlocks can be eliminated by increasing CPU speed.

• Deadlocks can be modeled using resource allocation graphs and the Coffman conditions.

• Deadlocks can be resolved using priority scheduling.

What strategies can be employed to handle deadlocks?

• Implementing a single-threaded model for all processes

• Strategies to handle deadlocks include prevention, avoidance, detection, and recovery.

• Increasing system resources to prevent deadlocks

• Ignoring the issue until it resolves itself

Define starvation in the context of concurrent processes.

• Starvation is the condition where a process is indefinitely delayed from accessing resources it needs to execute due to resource allocation policies.

• Starvation is when a process completes its execution without any delays.

• Starvation occurs when a process is terminated due to lack of resources.

• Starvation is the state where a process has access to all resources immediately.