Question 1

What is Multiprogramming?

Accepted Answer

Multiprogramming is the technique of loading and running multiple programs simultaneously in memory to maximize CPU utilization.

Question 2

Define Context Switching.

Accepted Answer

Context switching is the process of saving the state of a currently running process and restoring the state of the next process to be executed.

Question 3

What is a Thread?

Accepted Answer

A thread is the smallest unit of CPU execution within a process, sharing the process's resources while having its own program counter, registers, and stack.

Question 4

Define Race Condition.

Accepted Answer

A race condition is a situation where the outcome of a computation depends on the relative order of execution of multiple concurrent processes accessing shared data.

Question 5

What is Monitor?

Accepted Answer

A monitor is a high-level synchronization construct that encapsulates shared data and the procedures to access it, ensuring mutual exclusion automatically.

Question 6

Define Segmentation.

Accepted Answer

Segmentation is a memory management scheme that supports the user's view of memory by dividing a program into logically related units called segments.

Question 7

What is Demand Paging?

Accepted Answer

Demand Paging is a virtual memory technique where pages are loaded into physical memory only when they are accessed (demanded), rather than loading the entire program upfront.

Question 8

Define Spooling.

Accepted Answer

Spooling (Simultaneous Peripheral Operations Online) is a technique where data is temporarily stored on disk for use by a slow peripheral device like a printer.

Question 9

What is a Device Driver?

Accepted Answer

A device driver is a software module that controls and manages a specific hardware device, providing a standard interface between the OS kernel and the hardware.

Question 10

Define Disk Scheduling.

Accepted Answer

Disk scheduling is the technique used by the OS to determine the order in which disk I/O requests are processed to minimize total seek time and improve disk throughput.

Question 11

Explain the differences between Process and Thread.

Accepted Answer

Processes and threads differ in resource allocation, overhead, communication mechanisms, and the level of isolation they provide.

Question 12

Describe the Round Robin Scheduling algorithm with an example.

Accepted Answer

Round Robin is a preemptive CPU scheduling algorithm where each process is given a fixed time quantum in cyclic order, ideal for time-sharing systems.

Question 13

Explain the Peterson's Solution for the Critical Section Problem.

Accepted Answer

Peterson's Solution is a software-based algorithm that correctly solves the Critical Section Problem for two processes using shared variables.

Question 14

Discuss the methods of handling deadlock (prevention, avoidance, detection).

Accepted Answer

Deadlock can be handled through three main strategies: Prevention (eliminate necessary conditions), Avoidance (safe-state checking), and Detection & Recovery.

Question 15

Explain the concept of Segmentation with its advantages and disadvantages.

Accepted Answer

Segmentation is a memory management scheme where a program is divided into variable-sized logical segments, each with its own base and limit in physical memory.

Question 16

Describe the different disk scheduling algorithms (FCFS, SSTF, SCAN).

Accepted Answer

FCFS, SSTF, and SCAN are disk scheduling algorithms that order I/O requests to minimize disk head movement and reduce access times.

Question 17

Explain the concept of File Access methods.

Accepted Answer

File access methods determine how data in a file can be read or written, with sequential, direct, and indexed being the main methods.

Question 18

(a) Explain the Process Control Block (PCB) in detail. (b) Describe the diffe…

Accepted Answer

The PCB stores all information needed to manage a process, while the process state transition diagram shows how processes move between states during their lifetime.

Question 19

Explain Deadlock in detail. Discuss the necessary conditions for Deadlock and…

Accepted Answer

Deadlock is a system state where processes are permanently blocked. It requires four necessary conditions and can be handled by prevention, avoidance, detection, and recovery.

Question 20

(a) Explain the concept of Memory Management. (b) Discuss Fixed and Variable …

Accepted Answer

Memory management allocates physical memory to processes efficiently. Fixed partitioning uses static regions while variable partitioning uses dynamic allocation based on process needs.

Question 21

Explain the concept of Paging in detail. Discuss the page table structure and…

Accepted Answer

Paging is a non-contiguous memory management scheme using page tables for address translation, with TLB providing fast hardware-assisted lookups.

Question 22

Explain the File System structure. Discuss the different file organization me…

Accepted Answer

The file system structure provides organized storage through layered design, while file organization methods and directory structures define how files are stored and accessed.

Operating System