SAMPLE QUESTION PAPER AI - 2
Subject Name: Operating System
Total Marks: 60
Instructions:
1. This question paper comprises of two sections. Write answers of both sections in
separate answer books.
2. From Section A, Q.1 is compulsory, attempt any THREE from Q.2 to Q.5.
3. From Section B, Q.1 is compulsory, attempt any THREE from Q.2 to Q.5.
4. Make suitable assumptions wherever necessary.
5. Start a new question on a new page.
Section-A (30 Marks)
Q.1 Answer the following questions (All are compulsory, each of two marks)
1. Define Operating System and its main objectives.
2. Explain the concept of Process Control Block (PCB).
3. What is the difference between Preemptive and Non-preemptive scheduling?
Q.2 Answer the following questions:
A) Explain different generations of Operating Systems with examples. (4 Marks)
B) Differentiate between Monolithic and Microkernel Operating Systems. (2 Marks)
Q.3 Answer the following questions:
A) Define process scheduling. Explain different process states with a neat diagram. (4 Marks)
B) Consider a system using FCFS scheduling with the following process details. Find
Average Turnaround Time & Average Waiting Time. (2 Marks)
Process Arrival Time Burst Time
P1 0 5
P2 1 3
P3 2 8
P4 3 6
Q.4 Answer the following questions:
A) Describe the Critical Section problem and explain Peterson’s solution. (4 Marks)
B) Explain the concept of Semaphores and its applications in process synchronization. (2
Marks)
Q.5 Answer the following questions:
A) Define Deadlock. Explain necessary and sufficient conditions for deadlock to occur. (4
Marks)
B) Describe Banker’s Algorithm for deadlock avoidance with an example. (2 Marks)
Section-B (30 Marks)
Q.1 Answer the following questions (All are compulsory, each of two marks)
1. What is Paging? How does it help in memory management?
2. Differentiate between Fixed and Variable Partitioning in memory allocation.
3. Define Demand Paging and Page Fault.
Q.2 Answer the following questions:
A) Explain Logical and Physical Address Mapping in memory management. (4 Marks)
B) Define and explain the concept of Working Set in Virtual Memory. (2 Marks)
Q.3 Answer the following questions:
A) Discuss different Page Replacement Algorithms and compare them. (4 Marks)
B) What is the significance of TLB (Translation Lookaside Buffer) in paging? (2 Marks)
Q.4 Answer the following questions:
A) Explain different File Allocation Methods: Contiguous, Linked, and Indexed. (4 Marks)
B) Differentiate between FCFS and SCAN Disk Scheduling Algorithms. (2 Marks)
Q.5 Answer the following questions:
A) Define Disk Scheduling. Explain C-SCAN with an example. (4 Marks)
B) What is Boot Block and Bad Block in disk management? (2 Marks)
End of the Question Paper
