(4)

7. For the following set of processes with spe- A (Printed Pages 4)

cific values : 7½
Roll No. ____________
Process Arrival Time Next CPU Burst Priority
(ms) (ms)
P1 0 14 7 S-754
P2 1 6 1
B.Sc. (Part-II) Examination, 2015
P3 3 2 3
(New Syllabus)
P4 5 7 2
COMPUTER SCIENCE
Determine the Average Waiting Time and Av- Paper-I
erage Turnaround Time using the following (Operating System)
scheduling algorithms: Time Allowed : Three Hours ] [ Maximum Marks : 50
(i) Round Robin Scheduling
Note: Answer five questions in all. Question No.
(ii) Shortest Job First
(iii) Shortest Remaining Time Next 1 is compulsory. Attempt one question
Unit-IV
from each of the four units. 2×10=20
8. (a) Explain the mechanism of Deadlock
Avoidance. Elaborate the Banker’s Algo-
1. (a) Define Operating System. Write major

rithm for avoiding deadlock 6 goals of an Operating System.

(b) Write Deadlock prevention method. (b) List the limitations of base machine ap-
1.5 proach and serial processing.
9. (a) Explain the Resource Allocation Graph (c) Differentiat between Multiprogramming
(RAG) for detecting deadlock. 4 and Multitasking systems.
(b) Elaborate the methods of deadlock han-
(d) Discuss the utility of Daemon in relation
dling. 3.5
to operating system.

S-754 P.T.O.
 (2) (3)
(e) What is context switching? Explain basic tem that help computer system to work
steps involved with context switching . efficiently and effectively? 5

(f) “Monitor is a high level tool for process (b) Describe Process Control Block (PCB).
synchronization”. Justify the statement by 2.5
giving utilities of Monitor. Unit-II

(g) Elaborate the concept of SPOOLING. 4. (a) Explain the concept of virtual memory.
(h) Write necessary conditions for deadlock Enlist the advantages of using virtual
to occur. memory in computer system. 3.5

(i) Write a short note on system call utility (b) Discuss the Page replacement technique.
of Operating System. 4
(j) Enlist the performance criterion of a 5. (a) Discuss various file access methods by

schedular. giving examples. 4

Unit-I (b) Describe the concept of file along with
2. (a) Elaborate the historical evolution of op- its types. 3.5

erating system from bare machine ap- Unit-III

proach to modern day operating system 6. Compare and contrast the following CPU
by expressing the main features and scheduling algorithms by mentioning the

timeline. 6 strengths and limitations of each : 7.5

(b) With the help of diagram explain the (i) First Come First Serve (FCFS)
structure of operating system? 1.5 (ii) Round Robin Scheduling Algorithm(RRS)
3. (a) Explain the functions of operating sys- (iii) Shortest Remaining Time Next (SRTN)

S-754 S-754 P.T.O.