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

Mumbai University Previous year question papers

V Sem IT Examination June 2008

Operating System for Computational Devices

N.B.: (1) Question NO.1 is compulsory.

(2) Attempt any four questions from the remaining six questions.

 

1. (a) What is the relationship amongest the High level language, Assembly language and Mq.chinelanguage? How systems software differ from application software?

(b) What conditions enforce to design multipass assembler? What are advantages and disadvantages of single pass assembler?

For the following hypothetical CPU containing instruction set of 4 instructions with their length as 81 (1 byte), 82 (2 bytes), 83 (3 bytes), 84 (1 byte).

 

2.) Design instruction codes. .

(p) Generate Relative address for the following assembly language code :-

Label opcode aperands

81

82

83

84

82

81

xxx 83

 c) Assuming 256 addressable words each of byte generate machine code for the above code.

 

3. (a) Describe the different between short term, mid term and long term scheduling wh~n te schedulers are involved.

(b) Assume you have the followingjobs to execute with one processor. What is turnaround time of each job for first come first serve and 8JF scheduling algorithms.

 

 

4.(a) Explain different page replacement algorithms. 10

‘(b) Design physical address for the following paging system. A virtual address space of 1k, primary memory of 256 bytes, page and frame size of 128 bytes, Generate the physical address if the’ virtual address generated is.

1) 0000000101

(2) 1010000111

Job Buret Time Priority Arrival Time

1 10 3 0

2 1 1 1

3 2 3 2

4 1 4 3

5 5 2 4

The current page Table is-

Page Available

0 Y

1 – N

2 N

3 N

4 N

5 Y

6 N

7 N

Page Frame

1

0

5. (a) What is producer consumer problem? Elaborate on different solutions. 10

(b) What are semaphores? How do they implement mutual exclusion? What are different tes of semaphores? How can they be implemented?

.

6.(a) What is deadlock? Explain the conditions which causes deadlock can deadlock be avoided.

 (b) Explain strategies to deal with deadlocks. Suppose you have two resources of type 10

 R1 and one resource of type R2. Draw DRAG for the following situation and state

 whether the condition to deadlock or not?

 Process P1 holds R1 and request R2.

 Process’P2 holds R2 and request R1.

 Process P3 holds nothing and requests R1 and R2.

 

7.(a) Explain major functions of operating system. Is it possible to have _computerwithout operating system?

(b) Explain different disk space allocation methods with their merits/demerits.

 

Leave a Comment