📘 OPERATING SYSTEM – MODULE-WISE QUESTIONS
(Combined from all PDFs: 2024, 2025, Supplementary, etc.)
🔹 MODULE 1 – OS INTRODUCTION & STRUCTURE
Define an Operating System. Explain the two viewpoints / role of OS.
Explain the abstract view of a computer system with neat diagram.
Explain computer system structure with components and example.
List and explain services provided by an Operating System.
Explain dual mode operation with neat block diagram and advantages.
Explain multiprocessor systems:
Advantages
Types (symmetric & asymmetric)
Compare:
Multiprogramming vs Multitasking
Multiprogramming vs Time-sharing
Explain system calls and their types/categories with examples.
Explain layered approach of OS design with advantages & disadvantages.
Explain microkernel architecture and its advantages.
Explain virtual machines and their advantages.
Explain system programs and their types.
🔹 MODULE 2 – PROCESS & CPU SCHEDULING
Define:
Process
Thread
Context switch
Degree of multiprogramming
Scheduler
Dispatch latency
Explain process states with state transition diagram.
Explain Process Control Block (PCB) with diagram.
Explain threads and why thread is called Light Weight Process (LWP).
Explain multithreading models with advantages & disadvantages.
Compare single-threaded vs multi-threaded processes.
Explain inter-process communication (IPC):
Shared memory
Message passing
Explain CPU scheduling criteria.
Explain scheduling algorithms:
FCFS
SJF / SRTF
Priority scheduling
Round Robin
Multilevel queue
Multilevel feedback queue
Solve numerical problems on:
Waiting time
Turnaround time
Gantt charts
Explain thread pools.
Explain processor affinity and load balancing.
🔹 MODULE 3 – DEADLOCK & MEMORY MANAGEMENT
Define deadlock with example.
Explain necessary and sufficient conditions for deadlock.
Explain deadlock handling methods:
Prevention
Avoidance
Detection
Recovery
Explain Resource Allocation Graph (RAG):
With deadlock
Cycle but no deadlock
Solve Banker’s Algorithm problems:
Need matrix
Safe state
Safe sequence
Resource request
Explain swapping with diagram and numerical problems.
Differentiate:
Internal vs External fragmentation
Paging vs Segmentation
Explain paging with TLB:
TLB hit
TLB miss
Effective Access Time (EAT)
Explain segmentation and segment fault checking.
Explain page table structures.
🔹 MODULE 4 – VIRTUAL MEMORY & FILE SYSTEM
Explain virtual memory and its benefits.
Explain page fault handling steps with diagram.
Explain page replacement algorithms:
FIFO
LRU
Optimal
Solve numerical problems on page replacement.
Explain thrashing, causes and control.
Explain:
Allocation of frames
Demand paging
Define file and explain:
File attributes
File operations
File types
Explain file access methods.
Explain file allocation methods.
Explain directory structures and operations.
🔹 MODULE 5 – DISK & LINUX OS
Explain disk structure and disk attachment.
Define:
Seek time
Rotational latency
CLV
CAV
Explain disk scheduling algorithms:
FCFS
SSTF
SCAN
CSCAN
LOOK
CLOOK
Solve numerical problems on disk scheduling.
Explain swap space management.
Explain boot block and bad blocks.
Explain Linux OS:
History
Design principles
Components
Kernel modules
Explain process management in Linux.
Explain memory management in Linux.
Explain IPC in Linux.
Explain Linux file system.
Explain I/O devices in Linux.