Mumbai University Previous year question papers Operating System for Computational Devices June 2006

Mumbai University Previous year question papers

V Sem IT Examination June 2006

Operating System for Computational Devices

N.S. (1) Question No.1 is complusory.

(2) Solve any four questions from questions Nos. 2 to 7.

‘(3)Assume suitable data whenever necessary

 1.(a) Following Program is for 8086 processor. Give result for program after first pass and second pass of assembler with relative address of each instuction.

SAMf>LE START

4000

 

USING *, BX

 MOV BL, NUM1

ADD BL, NUM2

 MOV RESUL~BL

 DC 10H

 DC 20H

 OS ?

 END

 The available space list of ‘I K~word memory has the following entries at time t.IllillLonAddress pize i’lJ[ord)

0 WO

250 150

450 100

700 185

999 25

1.

NuM1

NUM2

RESULT

b) The following sequence of allocation requests is then receive Time t+ 1t+2 t+3 t+4 Size of block 135 25 170 100 to be allocated. Determine the available space list after all these request have been serviced  using (i) Best-fit and (ii) First fit allocation ‘scheme.

 

2. (a) Explain Macro and Database for 2-pass Macro.

 (b) Explain relocatable loader with reference to following examples. Calculate relocatable address for following programs. Consider all instructions as 1-byte instruction and program is stored from location

OOOOH

and it is loaded starting at location 2010. .

 

LOAD 1234

ADD 9000

BRANCH 4567R

STORE 7000R

Where R indicate relocatableaddress.

 

3.(a) Explain the term multiprogramming, multitasking, multiprocessor in context with operating system. -10

(b) Explain process and state diagram for PCB.

  

4.(a) Following are three process which perform specific task. Sequence for processes are each P,Q,R,.Give Sequence and address in which instruction within process will execute and why process are executed in that sequence.

Process P :-

4000

4001

4002

4003

4004

4005

4006

4007

Process Q :-

6000

6001

6002

6003

6004

6005

Addition

Subtraction

Multiply

Division

Take input from keyboard

SORT

Change Sign

Calculate mean

Data transfer within register

Take complement

Take printout

Addition

Subtraction’

Multiply

Process R :-

8000 Multiply

8001 Find greater number

8002 Store result on floppy disk

8003 Addition

8004 Division

 (b) Explain different types of scheduler ‘and preemptive non-preemptive sclleduling algorithm.

 

5.(a) Explain’deadlock and condition for avoidance and prevention of deadloc~.

 (b) “Size,of page is too small or too large”. Whatis the effectof this on system performance.

 

6.(a) Differentiate between DOS and UNIX.

(b) Explain file organisation and access methods.

 

7. Write detailed notes on :-

 (a) System calls and drivers

 (b) Page segmented memory

 (c). Interprocess Communication.

Leave a Comment