Download AKTU B-Tech 5th Sem 2015-2016 Operating System Ecs 501 Question Paper

Download AKTU (Dr. A.P.J. Abdul Kalam Technical University (AKTU), formerly Uttar Pradesh Technical University (UPTU) B-Tech 5th Semester (Fifth Semester) 2015-2016 Operating System Ecs 501 Question Paper

Printed Pages: 5 - 545 ECS-501
(Following Paper ID andRoll No. to be ?lled in youi'
Answer Book)
B.TECH
(SEM. V) THEORY EXAMINATION, 2015-16
OPERATING SYSTEM
[Time:3 hours] . - [Total Marks:100]
Note: Attempt questions from all Sections as per?
directions.
Q-1 (a)
(b)
(C) '
(d)
(e)
Part-A
; Attempt all parts of this section. Answer in brief.
' (2 x 10:20) '
De?ne process. ' I '
What is?busy waiting?
Differentiate shell and kernel. ?
What Idb you understand by system call?
What IS the reason behind dual mode operation of
. processors?
(1)

'2.
I (f) Differentiate page aha segment.
(g) What is the role of Thread?
(h) . What are the advhntageS of the layered approach
to the design of operating system? ' . f
(i) What is in operating system? De?ne the
components of an operating. system.-
(i) .Whalare Semaphores? -
S?ction-?B
\
' Attem?t any ?ve questions from this? section, .( 106950)
De?ne the different states of a process with diagfam,
' Explain the need ofprocess suspension. '
. De?ne Message passing and shared memory inter- -
process communication.
What is process control block? Discuss the difference
among short-term; medium-term and long-term
scheduling.
(2)
List varioUs performance criteria for scheduling
algorithms. Five prcesses A, B, C, D, and E require CPU
burst of 3; 5, 2, 5 and 5 units respectively. Their arrival ?
times in the system are 0, 1, 3, 9 and l2.respectively._ ?
Draw Gantt chart ahd compute the average tum-around '
time and average waiting time of theseprocesses fer
the Shonestjob First (SJF) and Shortest Remaining Time
'Firs't(SRTF)s-chedu1ing algorithms. . "
Consider e logical address spaee o'feight pages of 1024
words, each mappcd?onto a physical memory of 32
frames then:
(i) HOW many bitsvare in logical address?
(ii) How many bits are in physical address?
Also explain the difference between internal and external
fragmentation.
Write and explain Peterson solution to the critical _
section problem.
9 (3) P.T.O.

Describe the Banker?s algorithm for safe allocation.
Consider a system? With five processes and three
resource types and attime 'T? the following snapshot of
the system has been taken:
Allocated Maximum Available
Processld R1 R2 R3 R1 R2 R3 R1 R2 R3
P1 1 1 2 4 3 3 3 1 0
P2 2 1 2 3 2 2
P3 4 0 1 9 0 2
P4 0 2 O 7 S 3
P5 1 1 2 11 2 3
,(i) Determine the total amount of resources (3f each
type. ?
(ii) Compute the Need matrix.
(iii) Determine if the state is safe or not using Banker?s
algorithm.
(iv) Would the following request be granted in the
current state?
(a) P1 <3,3.1>
(b) P2 <2, 1, 0>
Explain the need of process synchronization.
(4)
i
u-..) -- iAwM?_-- ?
.?-_;_.a->..A-__v A 1 .
Part?C
Attempt any two questions from this sections.
10.
ll.
12.
15><2=30)
Explain Linked list and bit map approach for ?'ee space
memory management.
Explain the SSTF and SCAN disk scheduling policies.
Obtain the total number of head movements needed to
satisfy the followin g sequence of track requests for each
of the two policies.
27,129, 110, 186?. 147,41,1o,64, 120
Assume that the disk head is initially positioned over
_ track 100 and is moving in the direction of decreasing
track number.
What is a Directory? De?ne any two ways to implement
the directory.
? (5) ' ? 2500