Explanation

Abstraction hides implementation details and focuses on high-level design concepts.

It helps manage complexity by showing only essential features to the user.

Explanation

Polymorphism allows different classes to respond uniquely to the same function or message.

It enhances flexibility and code reusability in object-oriented programming.

Explanation

Encapsulation hides an object’s internal data and exposes only necessary methods.

It controls access to data, ensuring integrity and security.

Explanation

FCFS schedules processes in the order they arrive, ensuring every process eventually executes.

It is simple and fair, making it least prone to starvation compared to SJN or priority-based methods.

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.