OPERATING SYSTEM
V SEMESTER (M+P) Assignment Questions
UNIT I: Introduction to Operating System
1. Explain the need for an operating system in modern computer systems and its role as a
resource manager.
2. Describe the layered architecture of an operating system and discuss its importance.
3. Compare and contrast various types of operating systems such as multiprogramming,
time-sharing, real-time, networked, distributed, clustered, and handheld OS.
4. What are system calls? Discuss the role of system/monitor calls in an operating
system.
5. Define firmware, BIOS, and the bootstrap loader. Explain how they work together to
start a computer system.
6. Differentiate between processes and threads. Discuss the benefits and usage of threads
in an OS.
7. Explain the differences between kernel-level and user-level threads. What are the
advantages and disadvantages of each?
UNIT II: Process Management
1. Define the process model in an operating system. Explain the process creation and
termination steps.
2. What are the different states a process can have, and how do transitions between these
states occur?
3. Discuss the concept of context switching and explain its significance in process
management.
4. Explain the difference between CPU-bound and I/O-bound processes with examples.
5. Compare preemptive and non-preemptive scheduling. Discuss the impact on system
performance.
6. Explain the criteria and performance metrics used in evaluating CPU scheduling
algorithms.
7. Describe various CPU scheduling algorithms, including FCFS, SJF, Round Robin,
Priority, Multilevel Queue, and Multilevel Feedback Queue scheduling.
UNIT III: Inter-Process Communication
1. What is inter-process communication (IPC)? Explain the importance of message
passing in IPC.
2. Define race conditions and critical sections. How does Peterson’s solution address the
critical section problem?
3. Describe the concept of semaphores. Discuss how they help in process
synchronization.
4. Explain the Reader’s & Writer Problem and how it is used to illustrate synchronization
challenges.
5. What is deadlock? Explain the necessary conditions for a deadlock to occur in a
system.
6. Discuss the Banker’s Algorithm for deadlock avoidance with an example.
7. Describe methods for handling deadlock, including prevention, avoidance, detection,
and recovery.
8. Consider a system with four processes (P0 to P3) and three types of resources (A, B,
C). The following table provides details of the Maximum resources required, the
Allocated resources, and the Available resources in the system:
Process Maximum (A, B, C) Allocated (A, B, C)
P0 (6, 4, 7) (4, 2, 3)
P1 (5, 5, 3) (2, 2, 1)
P2 (3, 3, 2) (1, 1, 1)
P3 (4, 6, 5) (0, 2, 3)
The Available resources in the system are: (2, 3, 2).
Tasks:
Calculate the Need matrix for each process.
Determine if the system is in a safe state. If so, find a safe sequence for the
processes.
UNIT IV: Memory Management
1. Explain the basic concepts of memory management and the distinction between
logical and physical address space.
2. Describe the process of swapping in memory management. How does it affect the
degree of multiprogramming?
3. Differentiate between static and dynamic loading and linking. How do they impact
memory management?
4. Discuss various memory allocation schemes such as first fit, next fit, best fit, worst fit,
and quick fit.
5. What is virtual memory? Explain the concept of paging and the role of a page table in
virtual memory.
6. Compare and contrast pure segmentation and segmentation with paging schemes.
Discuss the hardware support required.
7. Describe page replacement algorithms (FIFO, LRU, and Optimal) and explain
Bleady’s anomaly with an example.
UNIT V: File Management and I/O Subsystems
1. Discuss the basic concepts of file management, including file naming, attributes, and
types.
2. Explain various file organization and access methods: sequential, direct, and index-
sequential.
3. What is a directory structure? Compare the one-level, two-level, hierarchical, acyclic
graph, and general graph structures.
4. Explain the concept of file system mounting. How does it enable file sharing in a
networked environment?
5. Describe the input/output subsystems in an OS. Discuss the difference between block
and character devices.
6. What is disk scheduling? Explain different disk scheduling algorithms such as FCFS,
SSTF, SCAN, and C-SCAN.
7. Describe the structure and operation of a disk, including disk attachment, storage
capacity, and spooling.