Lovely Professional University 2009 B.C.A Computer Application Mid Term,Principles of Operating System - Question Paper

CSE213: Principles of Operating System B(Code)


Time Allowed: 1hr 30min Max.Marks: 50

1. This Paper contains five ques. on one page.
2. ans all ques. in serial order.
3. The marks assigned to every ques. are shown at the end of every questionn in square
brackets.


Q1) a) What do you mean by System Call?
b) Differentiate ranging from Symmetric and Asymmetric Multiprocessing?
c) describe Graceful degradation?
d) Differentiate ranging from Dipatcher from Scheduler?
e) Difference ranging from hard real Time System and S/W real Time Systems?
[5*2=1]

Q2) Consider the subsequent set of processes, with the length of CPU bursts time provided
in millisecond:
Process Burst Time Priority Arrival Time
P1 10 three 2
P2 one one 3
P3 two three 5
P4 one four 5
P5 five two 6

Draw a chart & compute avg. Waiting Time for
(a) FCFS (b) SRTF(Pre-emptive)
(c) Priority(Non-Preamptive) (d) Round Robin(Preamptive)
(e) Round Robin(Non-Preamptive)
[1]

Q3) (a) discuss the different levels of Scheduling?
(b) discuss Multilevel feedback queue Scheduling?
[2*5=1]


Q4) (a) suppose that a system is in unsafe state. Show that is it possible for the process to
complete their execution without entering a deadlock state?
(b) List 3 examples of deadlock that are not related to a computer system environment?
[2*5=10]

Q5) discuss semaphores and how it can be implemented in critical part problem?
[]

Earning:   Approval pending.