Question 1

What is the difference between a process and a thread?

Accepted Answer

A process is an independent program in execution that has its own memory space, including code segment, data segment, heap, and stack. Each process runs in its own address space and communicates with other processes through inter-process communication (IPC) mechanisms like pipes, sockets, or shared memory.

A thread, on the other hand, is a lightweight unit of execution within a process. Multiple threads within the same process share the same memory space (code, data, and heap segments) but each

Question 2

Explain the different states of a process and the transitions between them.

Accepted Answer

A process transitions through five main states during its lifecycle:

1. New: The process is being created. The OS allocates resources and initializes the PCB (Process Control Block).
2. Ready: The process is loaded into main memory and waiting to be assigned to a processor. It has all resources except CPU time.
3. Running: The process is currently being executed by the CPU. Only one process per CPU core can be in this state.
4. Waiting (Blocked): The process is waiting for some event like I/O c

Question 3

What is a deadlock? What are the necessary conditions for a deadlock to occur?

Accepted Answer

A deadlock is a situation where two or more processes are blocked forever, each waiting for a resource held by another process in the set. No process can proceed because each is waiting for an event that can only be triggered by another blocked process.

Four necessary conditions (Coffman conditions) must hold simultaneously for a deadlock to occur:

1. Mutual Exclusion: At least one resource must be held in a non-shareable mode. Only one process can use the resource at any given time.
2. Hold a

Question 4

Explain the difference between preemptive and non-preemptive scheduling.

Accepted Answer

In preemptive scheduling, the operating system can interrupt a currently running process and move it back to the ready queue to allocate the CPU to another process. This interruption can happen when a higher-priority process arrives, when the current time quantum expires (round-robin), or when a process with shorter remaining time arrives (SRTF). Preemptive scheduling ensures better response times and is used in time-sharing and real-time systems.

In non-preemptive (cooperative) scheduling, onc

Question 5

What is virtual memory and how does it work?

Accepted Answer

Virtual memory is a memory management technique that gives each process the illusion of having a large, contiguous address space, regardless of the actual physical memory available. It allows processes to use more memory than physically installed by using disk space as an extension of RAM.

The working mechanism involves several components: The Memory Management Unit (MMU) translates virtual addresses to physical addresses using page tables. The virtual address space is divided into fixed-size p

Question 6

Explain the Producer-Consumer problem and its solution using semaphores.

Accepted Answer

The Producer-Consumer problem (also called the bounded-buffer problem) involves two types of processes sharing a fixed-size buffer. Producers generate data items and place them into the buffer, while consumers remove items from the buffer and process them. The challenge is to ensure producers do not add data when the buffer is full, consumers do not remove data when the buffer is empty, and both do not access the buffer simultaneously.

Solution using semaphores requires three semaphores: mutex

Question 7

What are the different page replacement algorithms? Compare their performance.

Accepted Answer

Page replacement algorithms determine which page to evict from memory when a page fault occurs and no free frame is available.

1. FIFO (First-In-First-Out): Replaces the oldest page in memory. Simple to implement using a queue but suffers from Belady anomaly (more frames can cause more page faults). Poor performance as old pages may still be frequently used.

2. Optimal (OPT): Replaces the page that will not be used for the longest time in the future. Gives the lowest page fault rate but is imp

Question 8

What is thrashing? How can it be detected and prevented?

Accepted Answer

Thrashing occurs when a system spends more time swapping pages in and out of memory than executing actual processes. It happens when the degree of multiprogramming is too high and the total memory demand of all processes exceeds the available physical memory. Each process has too few frames, causing frequent page faults that lead to constant disk I/O.

The cycle works as follows: High multiprogramming leads to insufficient frames per process, causing high page fault rates. The CPU utilization dr

Question 9

Explain the concept of semaphores. What is the difference between binary and counting semaphores?

Accepted Answer

A semaphore is a synchronization primitive used to control access to shared resources in a concurrent system. It is an integer variable that is accessed only through two atomic operations: wait (P/down) and signal (V/up). The wait operation decrements the value, and if it becomes negative, the process is blocked. The signal operation increments the value, and if there are blocked processes, one is woken up.

Binary Semaphore (Mutex): Can only have values 0 or 1. Used for mutual exclusion where e

Question 10

What is the difference between paging and segmentation?

Accepted Answer

Paging divides both virtual memory and physical memory into fixed-size blocks called pages and frames respectively (typically 4KB). The mapping from virtual pages to physical frames is maintained in a page table. Paging eliminates external fragmentation since any page can map to any frame, but internal fragmentation exists (last page may not be fully utilized). The user is unaware of paging as it is managed entirely by the OS.

Segmentation divides memory into variable-sized segments based on th

Question 11

Explain the Banker's Algorithm for deadlock avoidance.

Accepted Answer

The Banker's Algorithm is a deadlock avoidance algorithm that tests for safety by simulating the allocation of predetermined maximum possible amounts of all resources, then makes an 's-state' check to test for possible deadlock conditions for all other pending activities before deciding whether allocation should be allowed to continue.

The algorithm uses several data structures: Available (vector of available instances of each resource type), Max (matrix defining maximum demand of each process)

Question 12

What is a context switch? What happens during a context switch?

Accepted Answer

A context switch is the process of storing the state (context) of a currently running process so it can be resumed later, and loading the saved state of a different process to run on the CPU. It is a fundamental mechanism that enables multiprogramming and time-sharing.

During a context switch, the following steps occur:
1. Save the context of the running process: The CPU registers (program counter, stack pointer, general-purpose registers), process state, and memory management information are s

Question 13

Explain different CPU scheduling algorithms and their pros/cons.

Accepted Answer

1. First-Come-First-Served (FCFS): Processes executed in arrival order. Simple but causes convoy effect where short processes wait behind long ones. Non-preemptive. Average waiting time can be very high.

2. Shortest Job First (SJF): Selects process with shortest burst time. Optimal for minimizing average waiting time. Can be preemptive (SRTF) or non-preemptive. Main drawback is predicting burst time is difficult, and long processes may starve.

3. Round Robin (RR): Each process gets a fixed tim

Question 14

What is the difference between mutex and semaphore?

Accepted Answer

A mutex (mutual exclusion) is a locking mechanism used to synchronize access to a shared resource. Only one thread can acquire the mutex at a time. The thread that locks the mutex must be the one to unlock it (ownership). If a thread tries to lock an already locked mutex, it blocks until the mutex becomes available.

A semaphore is a signaling mechanism that can be used to control access to a finite number of resources. Unlike mutex, any thread can signal (post) a semaphore, not just the one tha

Question 15

Explain the Reader-Writer problem and its solutions.

Accepted Answer

The Reader-Writer problem involves a shared resource (like a database) accessed by two types of processes: readers who only read data and writers who modify data. Multiple readers can access simultaneously (since reading does not modify data), but a writer needs exclusive access (no other reader or writer should access during writing).

First Reader-Writer Problem (Reader Priority): Gives priority to readers. No reader is kept waiting unless a writer has already obtained permission. Solution use

Question 16

What is a system call? Explain with examples.

Accepted Answer

A system call is the programmatic way in which a process requests a service from the operating system kernel. It provides an interface between user-level applications and the kernel. When a system call is made, the process transitions from user mode to kernel mode, which has higher privileges and can access hardware directly.

The mechanism works as follows: User program invokes a wrapper function (like read() in C library). The function places the system call number in a register and triggers a

Question 17

Explain internal and external fragmentation. How are they handled?

Accepted Answer

Internal fragmentation occurs when memory is allocated in fixed-size blocks and a process does not use the entire allocated block. The unused space within the allocated block is wasted. For example, if memory is allocated in 4KB pages and a process needs 4.1KB, it gets 8KB (2 pages), wasting 3.9KB. Internal fragmentation is inherent to fixed-partition and paging systems.

External fragmentation occurs when there is enough total free memory to satisfy a request, but the free memory is not contigu

Question 18

What is the difference between user-level threads and kernel-level threads?

Accepted Answer

User-level threads (ULTs) are managed entirely by the user-space thread library (like POSIX pthreads green threads or Java green threads). The kernel is unaware of their existence and sees only the process. Thread creation, switching, and synchronization are all done in user space without kernel intervention.

Kernel-level threads (KLTs) are managed by the operating system kernel. The kernel maintains thread tables and performs all thread operations. Thread creation and context switching require

Question 19

Explain the working of the fork() system call. What is Copy-on-Write?

Accepted Answer

The fork() system call creates a new process (child) that is a duplicate of the calling process (parent). After fork(), both parent and child continue execution from the instruction following the fork() call. fork() returns the child PID to the parent and 0 to the child, allowing them to distinguish themselves.

Traditionally, fork() would create a complete copy of the parent's address space for the child. This was expensive as it copied all pages of memory even if the child immediately called e

Question 20

What is demand paging? Explain the steps involved in handling a page fault.

Accepted Answer

Demand paging is a memory management strategy where pages are loaded into physical memory only when they are actually needed (demanded) by the process, rather than loading the entire program at startup. This is based on the principle of locality: most programs access only a small portion of their address space at any given time.

Steps in handling a page fault:
1. The CPU generates a virtual address and the MMU checks the page table.
2. If the valid/invalid bit shows the page is not in memory (i

Question 21

What are the different disk scheduling algorithms?

Accepted Answer

Disk scheduling algorithms determine the order in which disk I/O requests are serviced to minimize seek time (time to move the disk head to the correct track).

1. FCFS (First-Come-First-Served): Requests served in arrival order. Simple but may cause excessive head movement (large total seek time). Fair but poor performance.

2. SSTF (Shortest Seek Time First): Services the request closest to the current head position. Reduces average seek time compared to FCFS but can cause starvation of reques

Question 22

What is the difference between starvation and deadlock?

Accepted Answer

Deadlock is a condition where two or more processes are blocked indefinitely, each waiting for a resource held by another process in the set. All processes in a deadlock are permanently blocked and cannot make any progress. Deadlock is a circular dependency that cannot be resolved without external intervention.

Starvation (also called indefinite blocking or livelock in some contexts) is a condition where a process is indefinitely delayed because other processes are continuously given preference

Question 23

Explain the concept of Inter-Process Communication (IPC). What are the different methods?

Accepted Answer

Inter-Process Communication (IPC) refers to mechanisms that allow processes to communicate and synchronize their actions. Since processes have separate address spaces, they cannot directly access each other's memory and need special OS-provided mechanisms for data exchange.

IPC Methods:

1. Pipes: Unidirectional byte stream between related processes (parent-child). Anonymous pipes exist only while processes run. Named pipes (FIFOs) persist in the file system and can be used by unrelated process

Question 24

What is the difference between monolithic kernel and microkernel?

Accepted Answer

A monolithic kernel runs all operating system services (process management, memory management, file systems, device drivers, networking stack) in kernel space as a single large binary. All components share the same address space and can call each other directly via function calls. Examples: Linux, Unix, FreeBSD.

A microkernel keeps only the most essential services in kernel space (basic IPC, minimal scheduling, low-level address space management) and runs other services (file systems, device dr

Question 25

What is the Dining Philosophers problem? How can it be solved?

Accepted Answer

The Dining Philosophers problem is a classic synchronization problem. Five philosophers sit around a circular table with a fork between each pair. Each philosopher alternates between thinking and eating. To eat, a philosopher needs both the left and right forks. The challenge is to design a protocol so no philosopher starves and no deadlock occurs.

Naive solution (deadlock-prone): Each philosopher picks up left fork, then right fork. If all pick up left fork simultaneously, none can get the rig

Question 26

Explain the concept of memory-mapped I/O vs port-mapped I/O.

Accepted Answer

Memory-Mapped I/O (MMIO): Device registers and buffers are mapped to addresses in the system's regular memory address space. The CPU accesses device registers using the same instructions used for memory access (load/store). A portion of the address space is reserved for I/O devices. For example, a video card's framebuffer might be mapped to addresses 0xB8000-0xBFFFF.

Port-Mapped I/O (PMIO): Uses a separate address space for I/O devices, distinct from the memory address space. Special CPU instru

Question 27

What is priority inversion? How can it be solved?

Accepted Answer

Priority inversion occurs when a higher-priority task is indirectly preempted by a lower-priority task. This happens when a low-priority task holds a resource needed by a high-priority task, and a medium-priority task preempts the low-priority task, causing the high-priority task to wait indefinitely. The effective priority of the high-priority task becomes less than the medium-priority task.

Classic example: Three tasks L (low), M (medium), H (high priority). L acquires lock, H arrives and blo

Question 28

Explain the concept of file system and different file allocation methods.

Accepted Answer

A file system organizes and manages how data is stored and retrieved on storage devices. It provides an abstraction layer between applications and raw disk blocks, handling naming, access control, space allocation, and metadata management.

File Allocation Methods:

1. Contiguous Allocation: Each file occupies a set of contiguous blocks on disk. Directory entry contains starting block and length. Advantages: Simple implementation, excellent read performance (single seek), supports both sequentia

Question 29

What is a race condition? How can it be prevented?

Accepted Answer

A race condition occurs when the behavior of a program depends on the relative timing or interleaving of multiple threads or processes accessing shared data. The outcome is non-deterministic and depends on which thread executes certain operations first. This leads to incorrect results or system crashes.

Example: Two threads incrementing a shared counter. Thread 1 reads counter (value=5), Thread 2 reads counter (value=5), Thread 1 writes counter+1 (value=6), Thread 2 writes counter+1 (value=6).

Question 30

What is the Translation Lookaside Buffer (TLB)? How does it improve performance?

Accepted Answer

The Translation Lookaside Buffer (TLB) is a hardware cache in the CPU's Memory Management Unit (MMU) that stores recent virtual-to-physical page number translations. It speeds up virtual memory address translation by avoiding repeated page table lookups in main memory.

Without TLB, every memory access requires at least two memory accesses: one to read the page table entry and one to access the actual data. With multi-level page tables (common in 64-bit systems), this could be 4-5 memory accesse

Operating Systems Interview Questions

What is the difference between a process and a thread?

Explain the different states of a process and the transitions between them.

What is a deadlock? What are the necessary conditions for a deadlock to occur?

Explain the difference between preemptive and non-preemptive scheduling.

What is virtual memory and how does it work?

Explain the Producer-Consumer problem and its solution using semaphores.

What are the different page replacement algorithms? Compare their performance.

What is thrashing? How can it be detected and prevented?

Explain the concept of semaphores. What is the difference between binary and counting semaphores?

What is the difference between paging and segmentation?

Explain the Banker's Algorithm for deadlock avoidance.

What is a context switch? What happens during a context switch?

Explain different CPU scheduling algorithms and their pros/cons.

What is the difference between mutex and semaphore?

Explain the Reader-Writer problem and its solutions.

What is a system call? Explain with examples.

Explain internal and external fragmentation. How are they handled?

What is the difference between user-level threads and kernel-level threads?

Explain the working of the fork() system call. What is Copy-on-Write?

What is demand paging? Explain the steps involved in handling a page fault.

What are the different disk scheduling algorithms?

What is the difference between starvation and deadlock?

Explain the concept of Inter-Process Communication (IPC). What are the different methods?

What is the difference between monolithic kernel and microkernel?

What is the Dining Philosophers problem? How can it be solved?

Explain the concept of memory-mapped I/O vs port-mapped I/O.

What is priority inversion? How can it be solved?

Explain the concept of file system and different file allocation methods.

What is a race condition? How can it be prevented?

What is the Translation Lookaside Buffer (TLB)? How does it improve performance?

Explain the concept of Belady's Anomaly. Which algorithms suffer from it?

What are the methods for deadlock handling?

Explain the difference between logical and physical address space.

What is a zombie process and an orphan process?

Explain the working of the Completely Fair Scheduler (CFS) in Linux.

What is the difference between symmetric and asymmetric multiprocessing?

What is spooling in operating systems?

Explain the concept of memory partitioning. Compare fixed and variable partitioning.

What is a real-time operating system (RTOS)? Explain hard and soft real-time systems.

Explain the concept of inode in Unix/Linux file systems.

Explore More Interview Questions

Operating Systems Interview Questions

What is the difference between a process and a thread?

Explain the different states of a process and the transitions between them.

What is a deadlock? What are the necessary conditions for a deadlock to occur?

Explain the difference between preemptive and non-preemptive scheduling.

What is virtual memory and how does it work?

Explain the Producer-Consumer problem and its solution using semaphores.

What are the different page replacement algorithms? Compare their performance.

What is thrashing? How can it be detected and prevented?

Explain the concept of semaphores. What is the difference between binary and counting semaphores?

What is the difference between paging and segmentation?

Explain the Banker's Algorithm for deadlock avoidance.

What is a context switch? What happens during a context switch?

Explain different CPU scheduling algorithms and their pros/cons.

What is the difference between mutex and semaphore?

Explain the Reader-Writer problem and its solutions.

What is a system call? Explain with examples.

Explain internal and external fragmentation. How are they handled?

What is the difference between user-level threads and kernel-level threads?

Explain the working of the fork() system call. What is Copy-on-Write?

What is demand paging? Explain the steps involved in handling a page fault.

What are the different disk scheduling algorithms?

What is the difference between starvation and deadlock?

Explain the concept of Inter-Process Communication (IPC). What are the different methods?

What is the difference between monolithic kernel and microkernel?

What is the Dining Philosophers problem? How can it be solved?

Explain the concept of memory-mapped I/O vs port-mapped I/O.

What is priority inversion? How can it be solved?

Explain the concept of file system and different file allocation methods.

What is a race condition? How can it be prevented?

What is the Translation Lookaside Buffer (TLB)? How does it improve performance?

Explain the concept of Belady's Anomaly. Which algorithms suffer from it?

What are the methods for deadlock handling?

Explain the difference between logical and physical address space.

What is a zombie process and an orphan process?

Explain the working of the Completely Fair Scheduler (CFS) in Linux.

What is the difference between symmetric and asymmetric multiprocessing?

What is spooling in operating systems?