Embed Size (px)
Citation preview
USN
Time: 3 hrs.
la.b.
c.
2a.b.
c.
.,
Max. I!{arks:100
10EC65
(06 Marks)
Sixth Semester B.E. Degree Examination, Dec.2013 lJan.2ol4Operating Systems
Note: Answer FIYEfull questions, selectingut lesst TWO questions from each part.
(.)ooIa
()
o
fre
de
Ehooltroo
.=N
nboYol()tr-o
a)2
6=
oc)
aotr
-d
!d
-? dJ
or=
^Xtra-o..oj
6:aErvELOJE
>,!oo-cbo(J=90tr>o-
\J<-; c'i
C)
oZ
fo
PART _ ADefine an operating system. What are the different facets of user eonvenience? (06 Marks)Explain partition based and pool based resource allocation strategies. (06 Marks)Explain time sharing operating system with respect to, i) Scheduling and ii) Memorymanagement. (08 Marks)
What are the functions of an operating system? Explain. (06 Marks)Explain virtual machine operating system (VMOS). What are the advantages of using virtualmachines? (08 Marks)In a batch processing system, the results of 1000 students are to be printed. Reading a cardor printing a result needs 100 msec whereas read/write operation in a disck needs only 20msec. Processing a record needs only a 10 msec of CPu time. Compute the program elapsed
a. What is a process? What are the components of a process? Explain. (04 Marks)b. Explain with neat diagrams, i) User threads ii) Kernel level threads. (0s Marks)c. With a neat diagram. explain different states of a process and state transitions in the LINIX
time and CPu idle time with and without spooling.
b. Explain the index sequential file organization with an example.c. What is a link? With an example, illustrate the use of a link
operaling syslem. (08 Marks)
a. Explain the techniques used to perform memory allocation by usiag a free list. (10 Marks)b. Explain internal'and external fragmentation with examples. (06 Marks)c. Compare corrtiguous and non-contiguous memory allocation methods. (04 Marks)
PART _ B5 a. What are the functions performed by the virtual memory manager? Explain. ,, ,, (08 Marks)
b. For the following page reference string, calculate the number of pug. faults with irIFO andLRU page replacement policies when i) Number of page frames are thLree ii) Number ofpage frames are four.Page reference string : 5 4 3 2 | 4 3'5 4 3 2 I 5
Reference time string '. tt,t2,13,........., tr3 (12 Marks)
6 a. With a neat diagram, explain the facilities provided by the file system and IOCS layers.(08 Marks)(08 Marks)
directory.in an acyclic graph structure
For More Question Papers Visit - www.pediawikiblog.com
For More Question Papers Visit - www.pediawikiblog.com
www.pediawikiblog.com
7 a. Compare : i) Preemptive and non-preemptive schedulingschedulers.
10E,C65
ii) Long term and short term(08 Marks)
b. Describe the shortest request next (SRN) and highest response ratio next (HRN) schedulingpolicies and determine the average turn around time and weighted turn around time for the
.:::.
,rt ,,arr.,".
.o .LlY.,,'=,,
a
:.....:::::.:
"'-t**'''following set of processes shown in Table Q7 (b)
:, ..,:'
t "o'{
8 a. Expfai,$"{) Direct and indirect naming. ,=
tu',ffiJocking and non blocking sends. (06 Marks)
b. What is ffii{ box? With an example, explain the features of mffiMes and its advantages.q,Fu= (08 Marks)c. Explain pipes ar-ffressage queues in UNIX
',;: j...'== (06 Marks)
W-1-*,,,,,. -...,,,
:,i.!J_,riiid"i
.'$
il*rd!," l1l
"11'"' """
t .".
.::::::"
,:,, ,l dl:;;:.""':'.'...:'::'
Arrival time
For More Question Papers Visit - www.pediawikiblog.com
For More Question Papers Visit - www.pediawikiblog.com
www.pediawikiblog.com
