Explanation

SJN favors shorter jobs, so long jobs may wait indefinitely, causing starvation.

FCFS and Round Robin are more fair, reducing the risk of starvation.

Explanation

For a deadlock to occur in an operating system, four necessary conditions

(known as the Coffman conditions).

1. Mutual Exclusion
2. Hold and Waite 
3. No Preemption
4. Circular Wait

Last updated 15-feb-2026

Explanation

Deadlock requires mutual exclusion, hold and wait, and circular wait, but preemption is not necessary.

Preemption can actually help prevent or resolve deadlocks by forcibly reallocating resources.

Explanation

Banker's Algorithm is used to detect and avoid deadlocks by simulating resource allocation.

It ensures the system remains in a safe state before granting resources.

Explanation

A mutex (mutual exclusion object) ensures that only one process accesses a shared resource at a time.

It prevents race conditions in concurrent programming.

Explanation

Round Robin assigns each process a fixed time slice (quantum) for execution.

It ensures fair CPU sharing among all ready processes in a cyclic order.

Explanation

Real-time OS is designed for time-critical tasks where delays cannot be tolerated.

It ensures predictable and immediate responses to external events.

Explanation

Embedded operating systems have a minimal or no user interface, designed for specific hardware tasks.

They are optimized for real-time performance and resource efficiency.

Explanation

The kernel manages system resources like CPU, memory, and devices.

It acts as a bridge between hardware and software, ensuring smooth operation.

Explanation

Class A IP addresses allow up to 16 million hosts per network due to their large host portion.

They are designed for very large networks like multinational organizations.