Student Regd No.

Course Code: DCAP103

Course Title: Principles of Operating Systems
Time Allowed: 3 hrs Max. Marks: 80

1) This paper contains 10 questions divided in two parts on 2 pages.

2) Part A is Compulsory.

3) In Part B (Questions 2 to 10), attempt any six questions out of 9. Attempt all
parts of questions chosen.

4) The marks assigned to each question are shown at the end of each
question in square brackets.

5) Answer all questions in serial order.

----------------------------------------------------------------------------------------------------------------

Part A
Q1: Answer all the following questions. [10 x 2 = 20]
a) What is an Operating System?
b) What is the advantage of Multiprogramming?
c) Define the terms ‘Program’ and ‘Process’?
d) What is meant by Context Switch?
e) What do you mean by Critical Section?
f) What is a Deadlock?
g) What do you mean by Swapping?
h) What is a Directory?
i) What is a Virtual Memory?
j) What is a File?
Part B
Q2: What are the various types of Operating System? Explain each of them [10]
Q3: Explain the various types of Scheduling. [10]
Q4: Explain the various ways to handling of Deadlocks [10]
Q5: Describe Demand Paging. [10]
Q6: Explain the basic File Operations [10]
Q7: Explain the different Levels of RAID structure [10]
Q8: Describe briefly about the Access Matrix [10]
Q9:
(a) If the processes arrive in the order: P3, P2, P1 and their burst times are 6ms,
7ms and 8ms. Then according to first come first serve scheduling, what would
be the average waiting time? [5]
(b) If the processes arrive in the order: P1, P2, P3 and their burst time is 3ms, 4ms
and 5ms. Then, what would be the average waiting time in shortest job first
scheduling? [5]
Q10:
(a) Find out the no of page faults for the following reference string using FIFO
page replacement algorithm, page frame is 3 [5]
82328528625638368243
(b) Show the demo for the following reference string using LRU page
replacement algorithm, page frame is 4 [5]
2 4 6 1 3 5 7 9 8

-- End of Question Paper --