Operating System Question Bank - Answers (2M,
4M, 5M)
■ 2 Marks Questions (Short Answers)
1. Operating System (OS) → Manages hardware/software & provides services.
2. Batch System → Executes jobs in batches, no user interaction.
3. Multiprogramming vs Multitasking → Multi-prog: many in memory; Multi-task: rapid switching.
4. Time-Sharing → Multiple users share CPU, ex: UNIX.
5. Parallel Systems → Multiple CPUs, ex: Supercomputer.
6. Distributed Systems → Independent systems on a network, ex: Google servers.
7. RTOS → Guarantees deadlines, ex: RTLinux.
8. OS as Resource Manager → Manages CPU, memory, I/O.
9. Virtual Memory → Logical memory > physical memory, uses disk.
10. Thrashing → Excessive paging, CPU underutilized.
11. Demand Paging vs Segmentation → Paging: fixed pages; Segmentation: logical units.
12. Overlay → Load parts of program, ex: compiler phases.
13. Batch vs Multiprogramming → Batch: sequential; Multi-prog: concurrent.
14. Page Replacement Impact → Poor = more faults, better = faster.
15. Best Algorithm → Optimal (ideal), LRU practical.
16. Process → Program in execution.
17. Process States → New, Ready, Running, Waiting, Terminated.
18. Thread vs Process → Thread = lightweight, Process = heavy.
19. Preemptive Scheduling → CPU can be taken away.
20. CPU Scheduling Objectives → Max utilization, min waiting time.
21. Mutual Exclusion → Only one in critical section.
22. Semaphore → Integer variable for synchronization.
23. Critical Section Problem → Ensures exclusive access.
24. Context Switch → Save/restore process state.
25. IPC → Message passing, shared memory.
26. Preemptive vs Non-preemptive → One can interrupt, other cannot.
27. Demand Scheduling vs Real-time → Demand = availability; RT = deadlines.
28. Priority in Scheduling → High-priority tasks first.
29. Dining Philosopher → Deadlock problem.
30. Barbershop Problem → Semaphore used.
■ 4 Marks Questions (Medium Answers)
1. Objectives of OS → Efficiency, convenience, fairness, security.
2. Time-Sharing Architecture → Multi-user, round-robin, fast switching.
3. Parallel Systems → Multi-CPU, used in weather, AI.
4. Distributed Systems → Networked systems, ex: Cloud.
5. Batch vs Time-Sharing → No interaction vs interactive.
6. RTOS vs General Purpose → Deadline-based vs general use.
7. Virtual Memory → Extends RAM, isolation, paging.
8. Demand Paging → Load page only when needed.
9. FIFO vs LRU → FIFO oldest, LRU least recently used.
10. Thrashing → Excessive page faults, control via working set.
11. OS as Resource Manager → CPU, Memory, I/O, Files.
12. Overlay Example → Compiler phases.
13. Poor Page Replacement → More I/O, low performance.
14. Segmentation vs Paging → Logical vs fixed, external vs internal fragmentation.
15. Demand Segmentation → Load needed modules only.
16. Process States → New, Ready, Running, Waiting, Terminated.
17. IPC → Message passing, shared memory.
18. Thread Models → Many-to-One, One-to-One, Many-to-Many.
19. User vs Kernel Threads → Speed vs concurrency.
20. Scheduling Objectives → Utilization, throughput, fairness.
21. Preemptive vs Non-preemptive → Example: RR vs FCFS.
22. RR Example (BT 3,5,8; AT 0,2,4; q=2) → Avg WT=3, Avg TAT=8.33.
23. FCFS vs SJF vs Priority → Order, shortest burst, priority.
24. Priorities in RTOS → High-priority tasks get CPU.
25. Semaphore for CS → wait(mutex), signal(mutex).
26. Dining Philosopher → Semaphore per fork, max 4 philosophers.
27. Producer-Consumer → Buffer + semaphores.
28. Mutual Exclusion Solutions → Software vs Hardware.
29. Barbershop → Semaphore for waiting chairs + barber.
30. Deadlock Avoidance → Prevents unsafe allocations.
■ 5 Marks Questions (Long Answers)
1. Functions of OS → Process, Memory, File, Device, Security.
2. Types of OS → Batch, Time-Sharing, Distributed, RTOS, Mobile.
3. Virtual Memory → Logical > physical, paging/segmentation.
4. LRU Example (1,2,3,4,1,2,5,1,2,3,4,5) → Page faults = 9.
5. Demand Paging Performance → Depends on fault rate, EAT.
6. Paging vs Segmentation vs Demand Segmentation → Comparison table.
7. Thrashing Scenario → Too many processes; prevent via working set.
8. PCB → Process info (ID, state, PC, registers, memory, I/O).
9. Thread Models → Many-to-One, One-to-One, Many-to-Many.
10. SJF Example (BT 8,6,5,2) → Avg WT=5.5, Avg TAT=10.75.
11. RR Example (BT 3,5,8; AT 0,2,4; q=2) → Avg WT=3, Avg TAT=8.33.
12. Semaphores in Sync → Example: Producer-Consumer.
13. Dining Philosopher → Semaphore-based avoidance.
14. Preemptive vs Non-preemptive in RTOS → Preemptive better for deadlines.
15. Producer-Consumer Solution → Semaphores (empty, full, mutex).
