Operating Systems Exam Paper
Duration: 3 Hours
Maximum Marks: 70
Instructions:
1. All questions are compulsory.
2. Answer each main question on a new page.
3. Neat diagrams must be drawn wherever necessary.
4. Assume suitable data wherever required.
5. Figures to the right indicate full marks.
Q.1 (10 Marks)
Attempt any FIVE of the following: (2 Marks each)
a) Define a Real-Time Operating System (RTOS) and give two applications.
b) Differentiate between Preemptive and Non-Preemptive Scheduling.
c) Explain the term Fragmentation in memory management.
d) List and explain any four services provided by an Operating System.
e) Write the syntax of Unix commands: kill and sleep.
f) Explain Paging.
g) What is Deadlock? List four necessary conditions for deadlock occurrence.
Q.2 (12 Marks)
Attempt any THREE of the following: (4 Marks each)
a) Explain the process state diagram with neat labeling.
b) Differentiate between Paging and Segmentation with diagrams.
c) Explain the Round Robin scheduling algorithm with an example.
d) Explain Shared Memory and Message Passing as methods of Inter-process Communication
(IPC).
Q.3 (12 Marks)
Attempt any THREE of the following: (4 Marks each)
a) Explain the steps of the Banker's Algorithm to avoid deadlock.
b) Describe the Free Space Management Techniques. Explain any one technique in detail.
c) Explain the FCFS Scheduling Algorithm and calculate average waiting time for the following
processes:
| Process | Arrival Time | Burst Time |
|---------|--------------|------------|
| P1 |0 |8 |
| P2 |1 |4 |
| P3 |2 |9 |
| P4 |3 |5 |
d) What is Virtual Memory? How does it relate to paging?
Q.4 (12 Marks)
Attempt any THREE of the following: (4 Marks each)
a) Compare CLI-based OS and GUI-based OS.
b) Solve the page replacement problem using the LRU and FIFO algorithms for the following page
reference string with 3-page frames:
7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1.
c) Explain the advantages of multithreaded systems.
d) Differentiate between Internal and External Fragmentation.
Q.5 (12 Marks)
Attempt any TWO of the following: (6 Marks each)
a) Solve the scheduling problem using SJF (Preemptive) and SJF (Non-Preemptive). Calculate the
average waiting time for the following processes:
| Process | Arrival Time | Burst Time |
|---------|--------------|------------|
| P1 |0 |7 |
| P2 |1 |4 |
| P3 |2 | 10 |
| P4 |3 |6 |
b) Explain the types of file allocation methods (contiguous, linked, indexed) with examples.
c) Describe Inter-process Communication (IPC) using Shared Memory and Message Passing with
diagrams.
Q.6 (12 Marks)
Attempt any TWO of the following: (6 Marks each)
a) Calculate the number of page faults using the following algorithms: Optimal, LRU, and FIFO for
the following page reference string with 4-page frames:
5, 6, 7, 8, 9, 7, 8, 5, 9, 7, 8, 7, 9, 6, 5, 6.
b) Write down two uses of the following operating system tools:
i) Task Scheduler
ii) Performance Monitor
iii) Security Policy
c) Explain the Directory Structure (single-level, two-level, tree-structured) with diagrams.
End of Paper
