Downloaded from www.jayaram.com.

np







Candidates are required to give their answers in their own words as far
as practicable.
All questions carry equal marks. The marks allotted for each sub-
question is specified along its side.
Attempt EIGHT questions.

Q. [1] Discuss the operating system as a resource manger. Explain
multiprogramming and time sharing system in brief. [5+5]
Q. [2] What is Race Condition? Explain with an example. Explain
the different conditions of mutual exclusion. [5+5]
Q. [3] What are the different process scheduling algorithms? Explain
priority scheduling and shortest job first with examples. [2+8]
Q. [4] Explain the working of DMA with diagram. [10]
Q. [5] Discuss the disk arm algorithm with an example. Write the
advantages of Hard disk over primary memory. [7+3]
Q. [6] Explain deadlock with its necessary conditions. Discuss any
one of the method to detect deadlock in the system. [4+6]
Q. [7] Discuss variable partition scheme of memory management
with an example. [10]
Q. [8] What is page fault? List all the steps taken by the operating
system to solve this problem. Explain how deadlock can be
avoided. [4+6]
Q. [9] Why it is needed to replace a page from memory? Consider the
following reference string:
7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1
Find out number of page faults (having three frames ) in above
string using FIFO. [10]
Q. [10] Explain different operations of directory. What are the different
file methods? Explain any one with example. [4+6]


PURWANCHAL UNIVERSITY
V SEMESTER FINAL EXAMINATION- 2005
LEVEL : B. E. (Computer)
SUBJECT: BEG373CO, Operating system.
Full Marks: 80
TIME: 03:00 hrs Pass marks: 32



Downloaded from www.jayaram.com.np
1
Downloaded from www.jayaram.com.np







Candidates are required to give their answers in their own words as far
as practicable.
All questions carry equal marks. The marks allotted for each sub-
question is specified along its side.
Attempt EIGHT questions.

Q. [1] Explain the evolution sequence of Operating System? What are
time sharing system? [8+2]
Q. [2] [a] What is race condition? What are four conditions to avoid
the race condition? [2+4]
[b] Differentiate between the two different ways of I/O
handling programmed and interrupt with suitable example.
[4]
Q. [3] Write Petersons Solution to achieve the manual exclusion.
Discuss its merits and demerits. [6+2+2]
Q. [4] One of the various classical IPC problem is Sleeping Barber
problem. What actually the problem is ? Give the detail
algorithm solution. [10]
Q. [5] Suppose that a disk drive has 4000 cylinders, numbered 0 to
3999. The drive is currently serving a request, in FIFO order is
916, 1509, 82, 1011, 1774, 130, 507, 250, 2681, 56. Which
algorithm for disk-arm scheduling among FCFS, SSF and
SCAN is better for this set of requests? J ustify with calculation.
[10]
Q. [6] Consider the following snapshot of a system, where P0 to P4
are processes running and A to D are resources available in the
system: [10]



Allocation
Process A B C D
P0 0 0 1 2
P1 1 0 0 0
P2 1 3 5 4
P3 0 6 3 2
P4 0 0 1 4

Answer the following questions using the bankers algorithm:
[a] What is the content of the matrix Need?
[b] Is the system in a safe state?
[c] If a request from process PI arrive for (0, 4,2,0) can the
request be granted immediately?
Max
Q. [7] [a] Explain how Buddy System Works? [5]
[b] How FIFO page replacement strategy works? What is its
weakness? How optimal page replacement strategy modified
FIFO? [2+1+2]
Q. [8] How paging differs from segmentation? Explain the working of
the paging technique and segmentation technique with the
figure. [2+8]
Q. [9] Compare and contrast four different file systems implementing
methods with their merits comparison. [10]
Q. [10] [a] What do you mean by virtual memory? Explain paging in
brief. [6]
[b] Differentiate between internal fragmentation and external
fragmentation. [4]

PURWANCHAL UNIVERSITY
V SEMESTER FINAL EXAMINATION- 2006
LEVEL : B. E. (Computer)
SUBJECT: BEG373CO, Operating system.
Full Marks: 80
TIME: 03:00 hrs Pass marks: 32
A B C D
0 0 1 2
1 7 5 0
2 3 5 6
0 6 5 2
0 6 5 6
Available
A B C D
1 5 2 0
Downloaded from www.jayaram.com.np
2
Downloaded from www.jayaram.com.np







Candidates are required to give their answers in their own words as far
as practicable.
All questions carry equal marks. The marks allotted for each sub-
question is specified along its side.
Answer EIGHT questions.

Q. [1] Define operating system, Discuss operating system as a
resource manager. Distinguish between multiprogramming and
multiprocessing systems. [2+4+4]
Q. [2] What is race condition? Why mutual exclusion is required ?
How mutual exclusion can be achieved? Describe any one
proposal. [2+2+6]
Q. [3] Define process and its different states. What are the various
operations on a semaphore? Solve the producer-consumer
problem using semaphore. [2+4+4]
Q. [4] What are the differences between preemptive and non-
preemptive scheduling? Consider the following set of
processes, with the length of the CPU burst time given in
milliseconds: [2+8]
Table:
The processes are assumed to have arrived in the order P1, P2 ,
P3, P4, P5, all at time 0. Identify which scheduling slgorithm
among a non-preemptive priority ( a smaller priority number
implies a higher priority) and a round robin with a time slice
3ms would give minimum average waiting time.
Q. [5] Explain deadlock with necessary conditions. Consider there are
5 processes in a system P1, P2, P3,P4 and P5 having 4
resources R1, R2, R3 and R4, where P1 holds R1 and wants
R2, P2 holds R3 and wants R1, P3 wants R4, P4 holds R2 and
wants R4, P5 holds R4 and wants R1. Check using resource
allocation graph method whether the given system is in
deadlock or not. If yes, what processes are deadlock. [10]
Q. [6] [a] Differentiate between internal fragmentation and external
fragmentation. [5]
PURWANCHAL UNIVERSITY
2009
B. E. (Computer)/Fifth Semester/Final
Time 03:00 hrs. Full Marks: 80/Pass Marks: 32

BEG373CO: Operating System
[b] What do you mean by virtual memory? Explain paging in
brief. [5]
Q. [7] What is Beladys anomaly? Use FIFO page replacement
algorithm in the following reference string having four frames
and calculate the no of page faults: [2+8]
1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6
Q. [8] Suppose that a disk drive has 100 cylinders, numbered 0 to 99.
The drive is currently serving a request at cylinder 43, and the
previous request was at cylinder 25. The queue of requests, in
FIFO order , is 86, 70, 13, 74, 48, 09, 22, 50, 30. Calculate the
number of disk arm movements using Shortest-Seek-First and
Elevator Scheduling algorithms. [10]
Q. [9] What is a file system? Explain the different file system
implementation with advantages and disadvantages. [2+8]
Q. [10] Write short notes on any TWO: [5+5]
[a] First fit, Next fit, Best Fit.
[b] Clocks.
[c] Threads.


Downloaded from www.jayaram.com.np
3