Nepathya College

Mid Term Exam

2072
Bachelor Level/Third Semester
Full Marks: 40
CSC-203
Pass Marks: 12
Operating systems
Time: 1:30
Group A [2*10]
1. For the processes listed in following table, draw a Gantt chart illustrating their
execution using:
(a)First-Come-First-Serve.
(b)Short-Job-First.
(c)Shortest-Remaining-Time-Next.
(d)Round-Robin (quantum = 2).
Processes Arrival Time
Burst Time
A 0.00
4
B 2.01
7
C 3.01
2
D 3.02
2
2. Suppose that a disk drive has 100 cylinders, numbered 0 to 99. The drive is
currently serving a request at cylinder 43, and previous request was at cylinder
25. The queue of pending request, in FIFO order is: 86, 70, 13, 74, 48, 9, 22,
50, 30
Starting from the current head position, what is the total distance (in cylinders)
that the disk arm moves to satisfy all pending requests for each of the following
disk scheduling algorithms?
a. FCFS
b. SCAN
OR
What is Resource Allocation Graph (RAG)? What are the conditions for
deadlock? Explain. Determine if the system is safe from deadlock or not using
Bankers Algorithm for given condition.
[1+4+5]
Consider process sequence as: P3, P4, P1, P5, P2

Nepathya College

Mid Term Exam

2072
Bachelor Level/Third Semester
Full Marks: 40
CSC-203
Pass Marks: 12
Operating systems
Time: 1:30
Group A [2*10]
1. For the processes listed in following table, draw a Gantt chart illustrating their
execution using:
(a)First-Come-First-Serve.
(b)Short-Job-First.
(c)Shortest-Remaining-Time-Next.
(d)Round-Robin (quantum = 2).
Processes Arrival Time
Burst Time
A 0.00
4
B 2.01
7
C 3.01
2
D 3.02
2
2. Suppose that a disk drive has 100 cylinders, numbered 0 to 99. The drive is
currently serving a request at cylinder 43, and previous request was at cylinder
25. The queue of pending request, in FIFO order is: 86, 70, 13, 74, 48, 9, 22,
50, 30
Starting from the current head position, what is the total distance (in cylinders)
that the disk arm moves to satisfy all pending requests for each of the following
disk scheduling algorithms?
a. FCFS
b. SCAN
OR
What is Resource Allocation Graph (RAG)? What are the conditions for
deadlock? Explain. Determine if the system is safe from deadlock or not using
Bankers Algorithm for given condition.
[1+4+5]

Consider process sequence as: P3, P4, P1, P5, P2

3.
4.
5.
6.
7.
8.
9.

Group B Attempt Any Five [5*4]

Define OS as an extended machine and resource manager.
What do you understand by deadlock detection and recovery? Discuss.
Write short notes: (Any 2)
a. Best Fit vs. Worst Fit
c. Swapping
b. Semaphores
Under what circumstances do page fault occur? Describe the action taken by
the operating system when a page fault occurs.
Differentiate between process and thread. What are I/O bound processes and
CPU bound processes.
What is multilevel feedback Queues scheduling? How does it solve the problem of
starvation?
List the essential properties for the Batch-Oriented and Interactive operating
system.

3.
4.
5.
6.
7.
8.

Group B Attempt Any Five [5*4]

Define OS as an extended machine and resource manager.
What do you understand by deadlock detection and recovery? Discuss.
Write short notes: (Any 2)
c. Best Fit vs. Worst Fit
c. Swapping
d. Semaphores
Under what circumstances do page fault occur? Describe the action taken by
the operating system when a page fault occurs.
Differentiate between process and thread. What are I/O bound processes and
CPU bound processes.
What is multilevel feedback Queues scheduling? How does it solve the problem of
starvation?

9.

List the essential properties for the Batch-Oriented and Interactive operating
system.