Skip to content
Previous Year Question Paper

AD/CD/CS/SD-405 (GS) – Operating Systems

December 2024CSESEMESTER-4
December 2024
Max Marks: 70
Duration: 3 Hours
Instructions:

Attempt any five questions.

All questions carry equal marks.

Q.1
Unit 3

Explain the need for the Process Control Block (PCB) fields.

Q.2
Unit 3

Given processes with burst time, priority and arrival time. Find scheduling sequence, turnaround time and waiting time for FCFS, RR(q=3), preemptive SJF.

Q.3
Unit 3

How multilevel feedback queue scheduling differs from multilevel queue scheduling.

Q.4
Unit 4

What is Resource Allocation Graph? Explain occurrence and avoidance of deadlock among 3 processes and 3 resources.

Q.5
Unit 3

Page requests: 1,2,3,5,4,1,2,5,3,2,4,3. With three frames, how many page faults using Optimal Page Replacement?

Q.6
Unit 3/2/4

Write short notes on (any two): a) Thrashing b) LRU algorithm c) PCB d) Contiguous and Linked Disk Allocation e) Optimal Page Replacement f) Interrupts g) Multilevel Feedback Queue Scheduling.

Q.7
Unit 2

Define the term 'Directory'. Explain any two schemes of logical directory structures.

Q.8
Unit 3

When do page-faults occur? Describe the action taken by the OS when page-fault occurs.