Printed Pages-4

ECSsO1

Following Paper ID and Roll No. to be filled in yourAnswer Book

B. Tech.

(sEM. V) THEORYEXAMTNATTON 20i 1-12

OPERATING SYSTEM Time

: 3 llours

Note

:-

(i) (iD

Tbtal Marks

: 100

Attempt all questions.

All questions carry equal marks.

(iiD Notations/Symbols/Abbreviations used have usual meaning.

(iv) l.

Make suitable assumptions, wherever required.

Attempt any two parts of,the following

(a)

:

Explainthe followingterms clearly

(i)

:

Process

(ir) BusyWaiting (iiD

Multiprogramming

(iv)

Multithreading.

(b) Differentiate

(D (ii)

between the following

:

Shell and Kernel

Deadlock and Starvation

ECS501/KIH-26380

lTurnOver

(iiD

Monolithic kernel and Microkernel

(w) Concurrent execution and Parallel execution' ? How is a What do you understand by system call

(c) (r)

callhandled'by system call made ? How is a system

the system ? Choose suitable examples for exPlanation'

(it)

of What is the reason behind dual-mode operation processors

?

Attempt any two parts of the following

2.

(a)

:

? What are the What do you understand by critical section ? of a solution to the critical section problem

requrements

with the help Discuss mutual exclusion implementation

of

Test-and-Set machine instruction'

(b)

Problem' Give State the finite buffer Producer-Consumer solution ofthe problem using semaphores'

(c) 3.

Write

a short note on interprocess

communication'

Attempt any two parts of the following:

(a) (i)

Draw and explain the Process State Transition diagram.

(iD [n a system,

n processes share m resource units that

at a time' The can be reserved and released only one

ECS501/KIH-26380

maximum need of each process does not exceed m and sumofallmaximum need is lessthan m+n. Show

that a deadlock cannot occur.

(b) List various performarice

criteria for scheduling algorithms.

Five processes A, B, C, D, E require CPU burst of 5 and 5 units respectively.

3,5,2,

Their arrival times in the system

are 0,1, 3, 9 and 12 respectively. Draw Gantt Chart and compute the average turn around time and average waiting

time of these processes for the Shortest Job First (SJF) and Shortest Remaining Time First (SRTF) scheduling algorithms.

(c)

Write and explain Banker's atgorithm for avoidance of deadlock.

4.

Attempt any two parts of the following

(a) What is paging ? Describe '-

'

:

how logical address is translated

to physical address in a paged system. Further give reasons as to

why page sizes are always kept in powers of 2.

(b) Consider

a demand paged system. Page tables are stored

in main memory which has an access, time of

100

nanoseconds. The

TLB can hold 8 page table entries and

has an access time

of l0 nanoseconds. During the execution

of a process, it is found that 80% of the time, a required page table entry exists

ECS50l/KIH-26380

in TLB and only

2%o

of the

[Turn Over

references cause page faults. The average time to service page

(c)

fault

is 2 milliseconds. Cornpute the effective memory

Discuss the LRU page replacement policy. Prove that this

policy do not suffer from Belady's anomaly. How many page faults would occur with LRU policy forthe

l,2,3,3,4,7,5,3,4, 1,6,7,g,7,

g,

following

g,g,7,g, g, 5, 4,5,4,2

Assume that there are four frames which are initially empty.

5.

Attempt any two parts of the following

(a)

Explain the SSTF and SCAN disk scheduling policies. Obtain the total number of head movements needed to satisfu the following sequence of track requests for each

ofthe two policies

:

27, l2g,l 10, 186, 147, 41,

10,

64, 120

Assume that the disk head is initially positioned over track

100 and is moving in the direction

of

decreasing track

number.

(b)

Describe the various

file allocation

methods with their

relative advantages and disadvantages.

(c)

Write short note on File System Protection.

ECSsol/KIH-26380

19975

UPTU B.Tech Operatin System ECS- 501 Sem 5_2011-12.pdf ...

There was a problem previewing this document. Retrying... Download. Connect more apps... Try one of the apps below to open or edit this item. UPTU B.Tech ...

1MB Sizes 12 Downloads 262 Views

Recommend Documents

UPTU B.Tech Operating System ECS-501 Sem 5_2013-14.pdf ...
OPERATINGSYSTEM. Time : 3 Hours ... favour of the oldest process. Draw the Gantt ... Displaying UPTU B.Tech Operating System ECS-501 Sem 5_2013-14.pdf.

UPTU B.Tech Operating System ECS-501 Sem 5_2014-15.pdf ...
UPTU B.Tech Operating System ECS-501 Sem 5_2014-15.pdf. UPTU B.Tech Operating System ECS-501 Sem 5_2014-15.pdf. Open. Extract. Open with. Sign In.

UPTU B.Tech Operating System ECS-501 Sem 5_2014-15.pdf ...
(e) Enumerate the 'advantages of the layered. approach to system design? Also, Explain. virtual machine architecture in detail. (0 What are Sernaphores?

UPTU B.Tech Operating System ECS-501 Sem 5_2013-14.pdf ...
UPTU B.Tech Operating System ECS-501 Sem 5_2013-14.pdf. UPTU B.Tech Operating System ECS-501 Sem 5_2013-14.pdf. Open. Extract. Open with. Sign In.

UPTU B.Tech Database Management System-ECS-402 Sem 4_2009 ...
UPTU B.Tech Database Management System-ECS-402 Sem 4_2009-10.pdf. UPTU B.Tech Database Management System-ECS-402 Sem 4_2009-10.pdf. Open.

UPTU B.Tech Distributed Systems ECS-701 Sem 7_2011-12.pdf ...
Whoops! There was a problem loading more pages. Retrying... Whoops! There was a problem previewing this document. Retrying... Download. Connect more ...

UPTU B.Tech ECS-602 Software Engineering Sem 6_2010-11.pdf ...
UPTU B.Tech ECS-602 Software Engineering Sem 6_2010-11.pdf. UPTU B.Tech ECS-602 Software Engineering Sem 6_2010-11.pdf. Open. Extract. Open with.

UPTU B.Tech Pattern Recognition ECS-074 Sem 7_2013-14.pdf ...
UPTU B.Tech Pattern Recognition ECS-074 Sem 7_2013-14.pdf. UPTU B.Tech Pattern Recognition ECS-074 Sem 7_2013-14.pdf. Open. Extract. Open with.

UPTU B.Tech IT Infrastructure and Its Managenent -ECS-304 Sem ...
UPTU B.Tech IT Infrastructure and Its Managenent -ECS-304 Sem 3_2010-11.pdf. UPTU B.Tech IT Infrastructure and Its Managenent -ECS-304 Sem ...

UPTU B.Tech Parallel Algorithms ECS 073 Sem 7_2011-12.pdf ...
UPTU B.Tech Parallel Algorithms ECS 073 Sem 7_2011-12.pdf. UPTU B.Tech Parallel Algorithms ECS 073 Sem 7_2011-12.pdf. Open. Extract. Open with.

UPTU B.Tech Pattern Recognition ECS 074 Sem 7_2011-12.pdf ...
There was a problem previewing this document. Retrying... Download. Connect more apps... Try one of the apps below to open or edit this item. UPTU B.Tech ...

UPTU B.Tech Computer Graphics ECS-504 Sem 5_2013-14.pdf ...
terms Pixel, Aspect Ratio, Resolution. O) Develop and write mid point circle algorithm. Apply it to. predict the pixels in any octant for the circle whose centre.

UPTU B.Tech Computational Complexity ECS 072 Sem 7_2011-12 ...
UPTU B.Tech Computational Complexity ECS 072 Sem 7_2011-12.pdf. UPTU B.Tech Computational Complexity ECS 072 Sem 7_2011-12.pdf. Open. Extract.

UPTU B.Tech Data Compression ECS 077 Sem 7_2011-12.pdf ...
UPTU B.Tech Data Compression ECS 077 Sem 7_2011-12.pdf. UPTU B.Tech Data Compression ECS 077 Sem 7_2011-12.pdf. Open. Extract. Open with.

UPTU B.Tech Pattern Recognition ECS-074 Sem 7_2015-16.pdf ...
There was a problem loading more pages. Retrying... Whoops! There was a problem previewing this document. Retrying... Download. Connect more apps... Try one of the apps below to open or edit this item. UPTU B.Tech Pattern Recognition ECS-074 Sem 7_20

UPTU B.Tech Antenna and Wave Propagation EEC-501 Sem ...
(b) What is a rhombic antenna ? Describe its construction and. properties with special reference to directivity and. bandwidth. (c) Design Log-periodic Antenna of ...

UPTU B.Tech Computer Graphics ECS-504 Sem 5_2014-15.pdf ...
ll0s041 3 16675. Page 3 of 3. UPTU B.Tech Computer Graphics ECS-504 Sem 5_2014-15.pdf. UPTU B.Tech Computer Graphics ECS-504 Sem 5_2014-15.pdf.

UPTU B.Tech Object Oriented Systems- ECS-305 Sem 3_2010-11 ...
Page 3 of 4. UPTU B.Tech Object Oriented Systems- ECS-305 Sem 3_2010-11.pdf. UPTU B.Tech Object Oriented Systems- ECS-305 Sem 3_2010-11.pdf. Open.

UPTU B.Tech Compiler Design - ECS 603 Sem 6_2013-14.pdf ...
UPTU B.Tech Compiler Design - ECS 603 Sem 6_2013-14.pdf. UPTU B.Tech Compiler Design - ECS 603 Sem 6_2013-14.pdf. Open. Extract. Open with. Sign In.

UPTU B.Tech Distributed Database ECS 076 Sem 7_2011-12.pdf ...
4. Attempt any two parts of the following : (10x2=20I*. (a) Explain Issues ofRecovery in distributed database. Explain. types of failure in distributed system.

UPTU B.Tech Data Mining & Data Warehousing ECS 075 Sem ...
UPTU B.Tech Data Mining & Data Warehousing ECS 075 Sem 7_2011-12.pdf. UPTU B.Tech Data Mining & Data Warehousing ECS 075 Sem 7_2011-12.pdf.

UPTU B.Tech Computer Graphics-TCS-501 Sem 5_2009-10.pdf ...
Page 2 of 2. UPTU B.Tech Computer Graphics-TCS-501 Sem 5_2009-10.pdf. UPTU B.Tech Computer Graphics-TCS-501 Sem 5_2009-10.pdf. Open. Extract.