Operating System Practice Questions With Answers: MCQs, Short & Long Questions

OPERATING SYSTEM COMPLETE PRACTICE ARENA

Operating System Practice Questions With Answers: MCQs, Short & Long Questions

This unit-wise Operating System practice set is designed for semester exams, university theory papers, class tests, viva revision and last-minute practice.

The practice set covers the complete Operating System syllabus from basic OS concepts to processes, synchronization, CPU scheduling, deadlocks, memory management, virtual memory, I/O, RAID, disk scheduling, file systems and protection.

COMPLETE COURSE 6 Units
SYLLABUS COVERAGE 31 Chapters
PRACTICE TYPES 3 Formats
CORE QUESTIONS 93+

How to Use This Operating System Practice Set

Operating System Practice Questions With Answers: MCQs, Short & Long Questions
MCQs: First answer without opening the solution.

Short Questions: Try to write the answer in about 3–7 important points.

Long Questions: Practise the answer using definition, working, diagram, examples, advantages, limitations and comparison where required.
Every one of the 31 Operating System chapters is represented in this practice article. The goal is that a student should not finish revision while accidentally skipping a major chapter.

Unit-Wise Complete Operating System Coverage

UNIT 1 Operating System Fundamentals OS functions, OS types, multiprocess systems, OS architecture.
UNIT 2 Processes & Synchronization Process, critical section, semaphore, classical problems, IPC, PCB, address space.
UNIT 3 CPU Scheduling & Threads Schedulers, FCFS, SJF, SRTF, Priority, RR, threads, multiprocessor scheduling.
UNIT 4 Deadlocks Conditions, characterization, prevention, avoidance, detection, recovery.
UNIT 5 Memory & Virtual Memory Partitioning, paging, segmentation, demand paging, page replacement, thrashing, cache.
UNIT 6 I/O, Disk & File Systems I/O management, disk scheduling, RAID, file systems, file sharing, protection and security.

Operating System Practice Question Finder

Search by Topic or Question Type
UNIT 1

Operating System Fundamentals

Covers Chapters 1–4: OS basics, types of Operating Systems, multiuser/multiprocessor/multithreaded systems, and OS structure.

M Unit 1 MCQs With Answers
1 Which statement best defines an Operating System? CHAPTER 1
A. A compiler for high-level languages
B. System software that manages hardware and provides services to programs
C. A database application
D. A hardware memory device
View Answer
Answer: B

An Operating System manages computer resources and provides an interface and services for applications and users.

2 Which Operating System type is designed to meet strict timing deadlines? CHAPTER 2
A. Batch OS
B. Real-Time OS
C. Single-user OS
D. Simple monitor system
View Answer
Answer: B

A Real-Time Operating System is designed to provide responses within defined timing constraints.

3 In a multithreaded process, what do threads normally share? CHAPTER 3
A. Completely separate process address spaces
B. Code and process resources
C. Different operating systems
D. Different physical computers only
View Answer
Answer: B

Threads inside the same process normally share code, data and several process resources.

4 Which OS architecture keeps many services outside the kernel in user space? CHAPTER 4
A. Microkernel architecture
B. Simple batch structure only
C. Pure hardware architecture
D. Cache architecture
View Answer
Answer: A

Microkernel designs keep a small kernel and move many services to user-space processes.

S Unit 1 Short Questions
Q1. Write any five important functions of an Operating System.
Answer:
  1. Process management
  2. Memory management
  3. File-system management
  4. I/O device management
  5. Protection and security
The OS also performs resource allocation, error handling and system monitoring.
Q2. Differentiate Batch OS and Time-Sharing OS.
Answer:

A Batch OS collects jobs and executes them in groups with little direct interaction.

A Time-Sharing OS divides CPU time into small slices so multiple users or processes can receive quick responses.

Q3. What is the difference between multiprocessor and multithreaded systems?
Answer:

A multiprocessor system contains multiple processing units that can execute tasks in parallel.

Multithreading divides a process into multiple execution threads that normally share the same process resources.

Q4. What is the basic difference between Monolithic Kernel and Microkernel?
Answer:

A Monolithic Kernel places many OS services inside kernel space.

A Microkernel keeps only essential functions in the kernel and runs many additional services outside it.

L Unit 1 Long Questions
Q1. Define Operating System and explain its major functions and services.
Answer:

An Operating System is system software that manages hardware and provides services to applications and users.

Major functions include:

  1. Process Management
  2. CPU Scheduling
  3. Memory Management
  4. File Management
  5. I/O Management
  6. Secondary Storage Management
  7. Protection and Security
  8. Error Detection
  9. Resource Allocation
  10. User Interface
Exam Diagram: User → Applications → Operating System → Hardware.
Q2. Explain Batch, Multiprogramming, Time-Sharing and Real-Time Operating Systems.
Answer:

Batch OS: Jobs are grouped and processed without continuous user interaction.

Multiprogramming: Multiple jobs remain in memory, allowing the CPU to switch when one job waits for I/O.

Time-Sharing: CPU time is divided among users or processes using small time slices.

Real-Time OS: Designed for predictable and time-bounded responses.

Q3. Explain Multiuser, Multiprocessor, Multiprocess and Multithreaded Operating Systems.
Answer:
  • Multiuser: Supports multiple users sharing system resources.
  • Multiprocessor: Uses more than one processor or processing unit.
  • Multiprocess: Multiple processes exist and may execute concurrently.
  • Multithreaded: A process contains multiple threads of execution.
Benefits may include higher responsiveness, parallelism, resource sharing and better CPU utilization.
Q4. Explain Monolithic, Layered and Microkernel Operating System structures.
Answer:

Monolithic: Many OS services operate inside one large kernel. It can provide fast communication between components but may be harder to maintain.

Layered: The OS is divided into layers. Each layer uses services of lower layers.

Microkernel: Keeps only essential mechanisms in kernel space and moves many services to user space.

A complete answer can also discuss modularity, maintenance, communication overhead and reliability.

UNIT 2

Processes, Synchronization & IPC

Covers Chapters 5–13: processes, concurrency, critical section, semaphores, classical synchronization problems, IPC, process states, PCB, address space and process identification.

M Unit 2 MCQs With Answers
5 A process is best described as: CHAPTER 5
A. A program in execution
B. A file that can never execute
C. Only a hardware component
D. A disk scheduling request
View Answer
Answer: A

A process is a program currently under execution.

6 Which requirement allows only one process at a time inside a protected critical section? CHAPTER 6
A. Mutual Exclusion
B. Paging
C. Spooling
D. Seek Time
View Answer
Answer: A

Mutual exclusion prevents simultaneous execution of the protected critical section.

7 Which pair represents the basic semaphore operations? CHAPTER 7
A. Open and Close
B. Wait and Signal
C. Read and Seek
D. Mount and Unmount
View Answer
Answer: B

Semaphores are controlled through atomic synchronization operations commonly called wait and signal.

8 The Producer-Consumer problem mainly demonstrates: CHAPTER 8
A. CPU cache replacement
B. Synchronization of shared buffer access
C. Disk formatting
D. RAID parity calculation only
View Answer
Answer: B

Producer and Consumer processes coordinate access to a shared bounded buffer.

9 Peterson's solution is classically used to demonstrate mutual exclusion between: CHAPTER 9
A. Two concurrent processes
B. Two hard disks only
C. Two page tables
D. Two printers only
View Answer
Answer: A

Peterson's classical algorithm is a software mutual-exclusion solution for two processes.

10 Dining Philosophers is mainly a classical problem of: CHAPTER 10
A. Synchronization and resource sharing
B. File compression
C. RAID striping
D. Disk partitioning
View Answer
Answer: A

The problem demonstrates synchronization, limited resources and possible deadlock/starvation concerns.

11 Which is a common IPC model? CHAPTER 11
A. Shared Memory
B. RAID 0
C. Demand Paging only
D. Disk Defragmentation
View Answer
Answer: A

Shared memory is a major IPC model; message passing is another.

12 A process waiting for CPU allocation is normally in which state? CHAPTER 12
A. Ready
B. Terminated
C. New only
D. Invalid
View Answer
Answer: A

A ready process can execute but is waiting for CPU scheduling.

13 Which identifier is commonly used by an operating system to identify a process? CHAPTER 13
A. PID
B. RAID
C. DMA
D. SSTF
View Answer
Answer: A

PID means Process Identifier.

S Unit 2 Short Questions
Q5. Explain Process Concept and Process Generation.
Answer: A process is a program in execution. The OS creates processes when programs start, users request applications, system services launch or an existing process creates another process. Parent and child process relationships may therefore exist.
Q6. State the requirements of a correct Critical Section solution.
Answer:
  1. Mutual Exclusion
  2. Progress
  3. Bounded Waiting
These conditions help coordinate processes safely when accessing shared resources.
Q7. Differentiate Binary and Counting Semaphore.
Answer: A Binary Semaphore represents two logical states and can be used for mutual exclusion. A Counting Semaphore can represent multiple available instances of a resource.
Q8. What synchronization conditions must be controlled in Producer-Consumer?
Answer: The producer should not insert data into a full buffer, and the consumer should not remove data from an empty buffer. Access to the shared buffer must also be synchronized to prevent race conditions.
Q9. What is the purpose of Peterson's Solution?
Answer: Peterson's Solution is a classical software algorithm for mutual exclusion between two processes. It uses intent flags and a turn variable to coordinate entry to the critical section.
Q10. What do Dining Philosophers and Sleeping Barber problems teach?
Answer: Both demonstrate synchronization of concurrent activities. Dining Philosophers focuses on shared resources and possible deadlock/starvation. Sleeping Barber demonstrates process coordination, waiting and limited service capacity.
Q11. Differentiate Shared Memory and Message Passing IPC.
Answer: Shared Memory allows processes to communicate through a common memory region and normally requires synchronization. Message Passing exchanges explicit messages using send/receive style operations.
Q12. Write the main information stored in a PCB.
Answer: A PCB may contain: process ID, process state, program counter, CPU registers, scheduling information, memory information, accounting information and I/O status.
Q13. Explain the basic parts of a Process Address Space.
Answer: A process address space commonly includes: code/text, data, heap and stack. The exact layout depends on the operating system, executable format and runtime environment.
L Unit 2 Long Questions
Q5. Explain Process Concept, Concurrency and Process Generation in detail.
Answer:

A process is an executing instance of a program. It contains code, data, stack, current CPU state and operating-system management information.

Concurrency means multiple processes make progress during overlapping time periods.

Processes may be generated by:

  • System initialization
  • User requests
  • Batch jobs
  • System services
  • Parent processes creating child processes
Q6. Explain Critical Section Problem and its requirements.
Answer:

A critical section is code that accesses shared resources.

Concurrent execution without proper control may produce a race condition.

A correct synchronization solution should provide:

  1. Mutual Exclusion
  2. Progress
  3. Bounded Waiting
Common approaches include software algorithms, hardware atomic instructions, mutex locks and semaphores.
Q7. Explain Semaphores, Wait, Signal and synchronization use.
Answer:

A semaphore is a synchronization variable accessed through atomic operations.

Wait: Attempts to acquire a resource or permission.

Signal: Releases a resource or announces availability.

Binary semaphores can provide mutual exclusion, while counting semaphores represent multiple resource instances.

Atomic hardware instructions such as Test-and-Set can also support synchronization primitives.
Q8. Explain Producer-Consumer Problem with semaphore-based synchronization.
Answer:

The Producer generates items and inserts them into a shared buffer.

The Consumer removes and processes items.

Synchronization must ensure:

  • Producer waits when the buffer is full.
  • Consumer waits when the buffer is empty.
  • Only safe access to shared buffer data occurs.
Typical solutions use semaphores representing empty slots, filled slots and mutual exclusion.
Q9. Explain Peterson's Solution and mention the idea behind Dekker's Solution.
Answer: Peterson's classical two-process solution uses:
  • An intent flag for each process
  • A shared turn variable
  • Busy waiting before entering the critical section
The algorithm is designed to satisfy mutual exclusion, progress and bounded waiting under its classical assumptions. Dekker's algorithm is another early software solution for two-process mutual exclusion.
Q10. Explain Dining Philosophers and Sleeping Barber synchronization problems.
Answer:

In Dining Philosophers, philosophers alternate between thinking and eating while sharing limited forks.

Poor resource acquisition rules can cause deadlock or starvation.

In Sleeping Barber, one barber serves customers, with a limited number of waiting chairs.

Synchronization is needed to coordinate sleeping, arriving, waiting and service operations.
Q11. Explain Inter-Process Communication models and methods.
Answer: IPC allows processes to exchange information and coordinate activities. Two major models are:
  1. Shared Memory: processes access a common memory area.
  2. Message Passing: processes exchange messages through OS-supported communication.
IPC mechanisms can include pipes, message queues, shared memory, sockets and signals, depending on the OS.
Q12. Explain Process States, State Transitions and PCB.
Answer: Main states commonly include:
  • New
  • Ready
  • Running
  • Waiting / Blocked
  • Terminated
Important transitions include admission, dispatch, preemption, I/O waiting and I/O completion. PCB stores the information required for operating-system process management and context switching.
Q13. Explain Process Address Space and Process Identification.
Answer: A process address space represents the memory locations visible to the process. Typical logical regions include:
  • Text / Code
  • Initialized Data
  • Uninitialized Data
  • Heap
  • Stack
The OS also assigns process identifiers such as a PID to distinguish processes.
UNIT 3

CPU Scheduling, Threads & Multiprocessor Scheduling

Covers Chapters 14–17: scheduling criteria, schedulers, FCFS, SJF, SRTF, Priority, Round Robin, threads and multiprocessor scheduling.

M Unit 3 MCQs With Answers
14 Which scheduler selects a process from the ready queue for CPU execution? CHAPTER 14
A. Short-Term Scheduler
B. File Scheduler
C. Disk Formatter
D. Boot Loader
View Answer
Answer: A

The short-term or CPU scheduler selects ready processes for execution.

15 Which CPU scheduling algorithm uses a fixed time quantum? CHAPTER 15
A. FCFS
B. Round Robin
C. Non-preemptive SJF only
D. FIFO page replacement
View Answer
Answer: B

Round Robin gives each ready process a limited CPU time quantum.

16 What is a major benefit of multithreading? CHAPTER 16
A. Improved responsiveness and resource sharing
B. Elimination of every synchronization problem
C. No memory usage
D. No scheduling requirement
View Answer
Answer: A

Threads can improve responsiveness and share resources efficiently.

17 Keeping a process on the same processor when possible is related to: CHAPTER 17
A. Processor Affinity
B. External Fragmentation
C. RAID Parity
D. File Journaling
View Answer
Answer: A

Processor affinity tries to keep execution on the same CPU to benefit from cache locality and reduce migration overhead.

S Unit 3 Short Questions
Q14. Differentiate Long-Term, Short-Term and Medium-Term Schedulers.
Answer:

Long-Term Scheduler: controls which jobs are admitted to the system.

Short-Term Scheduler: selects a ready process for CPU execution.

Medium-Term Scheduler: may temporarily suspend and later resume processes.

Q15. Differentiate SJF and SRTF.
Answer: SJF normally refers to the non-preemptive algorithm that selects the shortest next CPU burst. SRTF is the preemptive form that selects the process with the shortest remaining execution time.
Q16. Differentiate User-Level and Kernel-Level Threads.
Answer: User-level threads are managed mainly by a user-space thread library. Kernel-level threads are known and scheduled directly by the operating system kernel. Their performance and blocking behaviour depend on the threading model.
Q17. What are Load Balancing and Processor Affinity?
Answer: Load balancing distributes runnable work among multiple processors. Processor affinity attempts to keep a process or thread on the same processor when beneficial.
L Unit 3 Long Questions
Q14. Explain CPU Scheduling, its performance criteria and types of schedulers.
Answer: CPU scheduling chooses a ready process for execution. Common criteria include:
  • CPU Utilization
  • Throughput
  • Turnaround Time
  • Waiting Time
  • Response Time
  • Fairness
Schedulers are commonly classified as:
  • Long-Term Scheduler
  • Short-Term Scheduler
  • Medium-Term Scheduler
Q15. Explain FCFS, SJF, SRTF, Priority and Round Robin Scheduling.
Answer:

FCFS: Executes in arrival order.

SJF: Chooses shortest CPU burst.

SRTF: Chooses shortest remaining time and may preempt.

Priority: Chooses according to scheduling priority. Starvation can occur.

Round Robin: Gives each process a time quantum and cycles through the ready queue.

In numerical questions, draw the Gantt chart first, then calculate Completion, Turnaround and Waiting Time.
Q16. Explain Threads, their benefits and thread-management models.
Answer: A thread is a basic unit of CPU execution within a process. Benefits include:
  • Responsiveness
  • Resource sharing
  • Lower creation overhead than separate processes
  • Scalability on multicore processors
Threading implementations may use user-level threads, kernel-level threads or mappings between them.
Q17. Explain Multiprocessor Scheduling, Load Balancing and Processor Affinity.
Answer: Multiprocessor scheduling manages CPU allocation when multiple processors are available. Important concepts include:
  • Asymmetric Multiprocessing
  • Symmetric Multiprocessing
  • Global or per-CPU run queues
  • Load Balancing
  • Processor Affinity
  • Cache locality
The objective is to use processors efficiently while limiting unnecessary task migration.
UNIT 4

Deadlock Management

Covers Chapters 18–19: deadlock system model, conditions, resource-allocation graph, prevention, avoidance, detection and recovery.

M Unit 4 MCQs With Answers
18 Which is NOT one of the four necessary deadlock conditions? CHAPTER 18
A. Mutual Exclusion
B. Hold and Wait
C. Circular Wait
D. Round Robin
View Answer
Answer: D

Round Robin is a CPU scheduling algorithm, not a deadlock condition.

19 Banker's Algorithm is associated with: CHAPTER 19
A. Deadlock Avoidance
B. Disk Scheduling
C. RAID Mirroring
D. File Allocation
View Answer
Answer: A

Banker's Algorithm grants resources only when the resulting state remains safe.

S Unit 4 Short Questions
Q18. Write the four necessary conditions for Deadlock.
Answer:
  1. Mutual Exclusion
  2. Hold and Wait
  3. No Preemption
  4. Circular Wait
All four must hold simultaneously for classical deadlock to be possible.
Q19. Differentiate Deadlock Prevention and Deadlock Avoidance.
Answer: Deadlock Prevention guarantees that at least one necessary condition cannot occur. Deadlock Avoidance examines resource allocation dynamically and grants requests only when a safe state can be maintained.
L Unit 4 Long Questions
Q18. Explain Deadlock, System Model, Necessary Conditions and Resource Allocation Graph.
Answer: Deadlock is a state in which a set of processes is blocked because each process waits for a resource held by another. The necessary conditions are:
  1. Mutual Exclusion
  2. Hold and Wait
  3. No Preemption
  4. Circular Wait
A Resource Allocation Graph represents processes, resources, request edges and assignment edges. Cycles can help analyze potential deadlock, depending on the number of instances of each resource type.
Q19. Explain Deadlock Prevention, Avoidance, Detection and Recovery.
Answer:

Prevention: Break one necessary deadlock condition.

Avoidance: Grant resources only when system remains safe. Banker's Algorithm is a classic example.

Detection: Allow deadlock and periodically check for it.

Recovery: Abort processes, preempt resources, or restore from a safe point where supported.

UNIT 5

Memory Management & Virtual Memory

Covers Chapters 20–26: basic memory management, partitioning, paging, segmentation, virtual memory, page replacement, locality, cache and thrashing.

M Unit 5 MCQs With Answers
20 Multiprogramming improves CPU utilization mainly because: CHAPTER 20
A. CPU can switch to another job when one waits for I/O
B. All jobs must use one memory location
C. The CPU stops during I/O
D. No process is kept in memory
View Answer
Answer: A

Keeping multiple jobs available allows the CPU to execute another job while one is waiting.

21 Variable partitioning is especially associated with which fragmentation problem? CHAPTER 21
A. External Fragmentation
B. Cache Coherence
C. RAID Parity
D. CPU Starvation only
View Answer
Answer: A

Variable-size allocations can leave scattered free holes, producing external fragmentation.

22 In paging, a page table maps: CHAPTER 22
A. Pages to Frames
B. Files to Printers
C. Users to Passwords
D. CPU cores to disks only
View Answer
Answer: A

The page table translates logical page numbers into physical frame numbers.

23 A classical segment-table entry commonly contains: CHAPTER 23
A. Base and Limit
B. Only Time Quantum
C. Only File Name
D. Disk RPM and RAID level
View Answer
Answer: A

Base identifies the starting physical location and limit represents the segment size or valid range.

24 In Demand Paging, a page is normally loaded: CHAPTER 24
A. When it is required
B. Only after system shutdown
C. Before the program exists
D. Only when a printer requests it
View Answer
Answer: A

Demand paging brings a page into memory when it is referenced and not currently resident.

25 Which page replacement algorithm can show Belady's Anomaly? CHAPTER 25
A. FIFO
B. Optimal
C. LRU as a stack algorithm
D. None of these algorithms can ever show it
View Answer
Answer: A

FIFO can exhibit Belady's Anomaly, where adding frames can unexpectedly increase page faults for some reference strings.

26 Reusing recently accessed data demonstrates which locality? CHAPTER 26
A. Temporal Locality
B. Spatial Locality only
C. Disk Locality
D. RAID Locality
View Answer
Answer: A

Temporal locality means recently accessed data is likely to be accessed again soon.

S Unit 5 Short Questions
Q20. How did memory use improve from a Bare Machine to Multiprogramming?
Answer: Early bare-machine systems had little operating-system support. Resident monitors kept a small control program in memory. Multiprogramming allowed several jobs to remain in memory so CPU utilization could improve when one job waited for I/O.
Q21. Differentiate Fixed and Variable Partitioning.
Answer: Fixed partitioning divides memory into predetermined regions. Variable partitioning creates partitions dynamically according to process requirements. Fixed partitioning can waste internal space, while variable partitioning can suffer external fragmentation.
Q22. Explain logical-to-physical address translation in Paging.
Answer: Logical address = Page Number + Offset. The page number indexes the page table to obtain the frame number. Physical address = Frame Number + Same Offset.
Q23. Differentiate Segmentation and Paged Segmentation.
Answer: Segmentation divides memory into logical variable-size segments. Paged segmentation further divides each segment into pages, combining logical segmentation with fixed-size paging.
Q24. What happens during a Page Fault?
Answer: The CPU traps to the OS. The OS verifies the reference, finds a frame, loads the required page from storage, updates the page table and restarts the interrupted instruction.
Q25. Differentiate FIFO, LRU and Optimal Page Replacement.
Answer: FIFO replaces the oldest loaded page. LRU replaces the page not used for the longest time in the past. Optimal replaces the page whose next use is farthest in the future.
Q26. Explain the relation between Locality and Thrashing.
Answer: Programs normally exhibit locality by repeatedly accessing a limited working set. If a process does not receive enough frames for its active working set, page faults may increase sharply and the system may start thrashing.
L Unit 5 Long Questions
Q20. Explain the evolution of Memory Management from Bare Machine to Multiprogramming.
Answer: Discuss:
  1. Bare machine execution
  2. Need for system control software
  3. Resident Monitor
  4. Memory protection
  5. Multiple jobs in memory
  6. CPU utilization through multiprogramming
  7. Need for allocation and relocation mechanisms
Q21. Explain Fixed and Variable Partitioning with allocation, protection and fragmentation.
Answer: Fixed partitioning divides memory into predetermined partitions. Variable partitioning creates partitions dynamically. Important allocation strategies include:
  • First Fit
  • Best Fit
  • Worst Fit
Protection may use base/limit style mechanisms. Fixed partitions can create internal fragmentation. Variable partitioning can create external fragmentation and may require compaction in some designs.
Q22. Explain Paging, Page Table and Address Translation with an example.
Answer: Paging divides:
  • Logical memory into Pages
  • Physical memory into Frames
The page table stores page-to-frame mappings. If page size is P:

Page Number = Logical Address ÷ P

Offset = Logical Address mod P

The page number is translated into a frame, while the offset remains unchanged. Paging removes external fragmentation but can produce internal fragmentation.
Q23. Explain Segmentation and Paged Segmentation with address translation.
Answer: Segmentation divides a program into logical segments. A logical address may contain: Segment Number + Offset. Segment table entries commonly provide a base and limit. In Paged Segmentation, every segment is further divided into pages. Translation therefore involves: Segment Table → Page Table → Frame.
Q24. Explain Virtual Memory, Demand Paging and Page Fault Handling.
Answer: Virtual Memory allows execution without keeping the entire process in physical RAM. Demand Paging loads pages only when required. Page-fault handling includes:
  1. Trap to OS
  2. Validate reference
  3. Find free frame or victim
  4. Read required page
  5. Update page table
  6. Restart instruction
Performance depends strongly on page-fault rate because storage access is far slower than memory access.
Q25. Explain FIFO, LRU and Optimal Page Replacement Algorithms.
Answer:

FIFO: Removes the page loaded earliest. It can show Belady's Anomaly.

LRU: Removes the page least recently referenced. It approximates future behaviour using recent history.

Optimal: Replaces the page needed farthest in the future. It provides a theoretical benchmark but exact future references are not normally known.

Q26. Explain Thrashing, Locality of Reference, Working Set and Cache Memory.
Answer: Thrashing occurs when excessive page faults dominate system execution. Locality explains why programs tend to access recently used or nearby memory locations. Important types:
  • Temporal Locality
  • Spatial Locality
  • Sequential Locality
The Working Set represents active pages used by a process over a recent interval. Page Fault Frequency can help monitor memory pressure. Cache memory exploits locality by keeping frequently needed information closer to the CPU.
UNIT 6

I/O Management, Disk, RAID & File Systems

Covers Chapters 27–31: I/O management, disk scheduling, RAID, file systems, file sharing, implementation, protection and security.

M Unit 6 MCQs With Answers
27 Which method transfers a block of data between an I/O device and memory with limited CPU involvement? CHAPTER 27
A. DMA
B. Busy waiting only
C. RAID 1
D. LRU
View Answer
Answer: A

Direct Memory Access allows a controller to transfer data between memory and a device with limited CPU handling per transferred item.

28 Which disk scheduling algorithm selects the pending request nearest to the current head position? CHAPTER 28
A. SSTF
B. FIFO Page Replacement
C. Round Robin CPU Scheduling
D. RAID 6
View Answer
Answer: A

SSTF means Shortest Seek Time First.

29 Which RAID level uses distributed single parity? CHAPTER 29
A. RAID 0
B. RAID 1
C. RAID 5
D. RAID 10 only
View Answer
Answer: C

RAID 5 combines block striping with parity distributed across the member disks.

30 Which file access method uses an index to locate records? CHAPTER 30
A. Indexed Access
B. Sequential Access only
C. RAID Access
D. Deadlock Access
View Answer
Answer: A

Indexed access maintains an index that helps locate the required data.

31 An Access Control List is primarily associated with: CHAPTER 31
A. Object-based access permissions
B. Page replacement
C. Disk seek scheduling
D. CPU burst prediction only
View Answer
Answer: A

An ACL identifies users or groups and the operations they may perform on an object.

S Unit 6 Short Questions
Q27. Differentiate Programmed I/O, Interrupt-Driven I/O and DMA.
Answer: Programmed I/O keeps the CPU actively checking device status. Interrupt-driven I/O allows the CPU to continue other work until the device interrupts. DMA transfers blocks directly between device and memory with limited CPU involvement.
Q28. Differentiate SCAN and LOOK Disk Scheduling.
Answer: SCAN moves toward a physical disk end before reversing. LOOK follows a similar direction strategy but reverses at the last pending request instead of going unnecessarily to the end.
Q29. Write the main idea of RAID 0, RAID 1, RAID 5, RAID 6 and RAID 10.
Answer:
  • RAID 0 = Striping
  • RAID 1 = Mirroring
  • RAID 5 = Distributed Single Parity
  • RAID 6 = Distributed Dual Parity
  • RAID 10 = Mirroring + Striping
Q30. Differentiate Sequential, Direct and Indexed File Access.
Answer: Sequential Access processes data in order. Direct Access jumps to a required location. Indexed Access uses an index to locate the required data efficiently.
Q31. Differentiate Authentication, Authorization, Protection and Security.
Answer: Authentication verifies identity. Authorization decides permitted actions. Protection controls access to system objects. Security provides broader defense against unauthorized access, attacks and misuse.
L Unit 6 Long Questions
Q27. Explain I/O Management, I/O Subsystem, DMA, Buffering, Caching and Spooling.
Answer: I/O Management coordinates communication between applications, the operating system and hardware devices. Important components include:
  • Device drivers
  • Device controllers
  • Interrupt handlers
  • I/O scheduling
Transfer methods include Programmed I/O, Interrupt-Driven I/O and DMA. Buffering temporarily holds data during transfer. Caching keeps frequently accessed information in faster storage. Spooling queues jobs for shared devices such as printers.
Q28. Explain FCFS, SSTF, SCAN, C-SCAN, LOOK and C-LOOK Disk Scheduling Algorithms.
Answer:
  • FCFS: Serves requests in arrival order.
  • SSTF: Chooses the request nearest the current head.
  • SCAN: Head moves toward one end and then reverses.
  • C-SCAN: Services requests in one direction and returns circularly.
  • LOOK: Reverses at the final pending request in a direction.
  • C-LOOK: Circular version of LOOK.
Numerical questions require calculation of total head movement according to the selected algorithm.
Q29. Explain RAID Levels, Working, Advantages and Differences.
Answer: RAID combines multiple disks to improve performance, redundancy or availability. Core concepts:
  • Striping
  • Mirroring
  • Parity
Important levels:
  • RAID 0 – Striping only
  • RAID 1 – Mirroring
  • RAID 5 – Distributed single parity
  • RAID 6 – Distributed dual parity
  • RAID 10 – Mirroring + striping
RAID can improve availability, but it does not replace an independent backup.
Q30. Explain File Concept, File Organization, Access Methods, Directories and Allocation Methods.
Answer: A File System organizes and manages persistent information on storage devices. A file is a named collection of related information. File access methods:
  1. Sequential Access
  2. Direct Access
  3. Indexed Access
Directory structures include:
  • Single-Level
  • Two-Level
  • Tree-Structured
  • Acyclic Graph
  • General Graph
Allocation methods include:
  • Contiguous Allocation
  • Linked Allocation
  • Indexed Allocation
Q31. Explain File Sharing, File System Implementation, Protection and Security in OS.
Answer: File sharing allows users, processes or computers to access common files. File-system implementation may use:
  • Directory entries
  • FCB / inode
  • Open-file tables
  • Free-space maps
  • Data-block mappings
  • Caches
  • Virtual File System abstraction
Protection mechanisms include:
  • Read / Write / Execute permissions
  • Access Matrix
  • ACL
  • Capability Lists
Security includes:
  • Authentication
  • Authorization
  • Encryption
  • Integrity
  • Auditing
  • Least Privilege
  • Backup and recovery

Extra Mixed Operating System MCQs for Final Practice

A Which technique can reduce starvation in Priority Scheduling? MIXED
A. Aging
B. Thrashing
C. Mirroring
D. Spooling
View Answer
Answer: A

Aging gradually improves the priority of a process that has been waiting for a long time.

B A TLB is used to speed up: MIXED
A. Virtual-to-physical address translation
B. Printer spooling only
C. Disk mirroring
D. User authentication only
View Answer
Answer: A

A Translation Lookaside Buffer caches recent page-table translations.

C A system state is safe when: MIXED
A. A safe sequence exists
B. Every process is terminated
C. No process needs resources
D. Only one resource type exists
View Answer
Answer: A

A safe state has at least one sequence in which processes can complete without entering deadlock.

D In Unix-like file systems, which structure stores file metadata? MIXED
A. Inode
B. Time Quantum
C. Semaphore Count only
D. RAID Stripe only
View Answer
Answer: A

An inode contains metadata and information required to locate file data.

Final Operating System Practice Checklist

Before your semester exam, make sure you can answer at least one MCQ, one short question and one long question from every major chapter.

✓ OS Functions
✓ OS Types
✓ OS Structure
✓ Processes
✓ Critical Section
✓ Semaphore
✓ Classical Problems
✓ IPC
✓ PCB & States
✓ CPU Scheduling
✓ Threads
✓ Multiprocessor Scheduling
✓ Deadlock
✓ Memory Management
✓ Paging
✓ Segmentation
✓ Virtual Memory
✓ Page Replacement
✓ Thrashing
✓ I/O Management
✓ Disk Scheduling
✓ RAID
✓ File Systems
✓ File Protection
Best Revision Order:

Fundamentals → Process → Synchronization → CPU Scheduling → Deadlock → Memory → Virtual Memory → I/O → Disk → RAID → File System → Security

Frequently Asked Questions

What topics are included in these Operating System practice questions?
The practice set covers Operating System basics, processes, synchronization, IPC, CPU scheduling, threads, deadlocks, memory management, paging, segmentation, virtual memory, page replacement, thrashing, I/O, disk scheduling, RAID, file systems, protection and security.
Are these Operating System questions unit-wise?
Yes. The questions are divided into six logical units so students can practise one section of the OS syllabus at a time.
Does this practice set contain MCQs with answers?
Yes. Every unit contains multiple-choice questions with four options, the correct answer and a short explanation.
Are short questions included for semester exams?
Yes. Short questions are included for definitions, comparisons, working and important concept-based semester questions.
Are long Operating System questions included?
Yes. Every major chapter has a descriptive practice question with an answer structure suitable for long university questions.
How should I use these questions before my exam?
First attempt MCQs without viewing answers. Then practise short answers from memory. Finally write selected long answers on paper using proper headings, diagrams and examples.
Are all 31 Operating System chapters covered?
Yes. The six-unit practice structure includes questions from all 31 chapters in the current Operating System learning sequence.

Conclusion

Reading theory alone is not enough for a strong semester-exam preparation. Students should also practise identifying the correct concept, writing short answers quickly and developing complete long answers.

This Operating System practice set combines MCQs, short questions and long questions across the complete unit-wise syllabus.

Final Rule:

Understand the chapter → Attempt MCQ → Write short answer → Write long answer → Check mistakes → Revise weak topic.

Post a Comment

0 Comments
* Please Don't Spam Here. All the Comments are Reviewed by Admin.
Join Telegram Exam updates and free resources