VTU Previous Year Question Papers BE CS Fifth Semester Operating Systems December 2010

VTU Previous Year Question Papers BE CS Fifth Semester

Operating Systems December 2010

 

Note: Answer any FIVE full questions, selecting at least TWO questions from each part.

PART-A

1.a Define an operating system. Explain two view points of OS role.

b. What are OS operations? Explain.   ‘

c. Define a virtual machine (VM). With a neat diagram, explain the working of a VM. What are the benefits of a VM?

 

2 a. Define IPC (Inter process communication). What are the different methods used for logical implementation of a message passing system? Explain any one.

b. Discuss three common ways of establishing relationship between the user thread and kernel thread.

Process P1 P2 P3 P4 P5
Arrival time 00 02 03 06 30
Burst time 10 12 14 16 05

 

c. Draw a Gantt chart that illustrates the execution, of these processes using the preemptive shortest job first (S JF) algorithm. Hence find the average waiting time. Draw a Gantt chart that illustrate the execution of these processes using preemptive priority scheduling algorithm. Given priority of each process is Pi = 4, P2 = 3 ; ?3 = 5, P4 = 1 and P5 = 1. Also find the average waiting time.

 

3 a. What do you mean by a binary semaphore and a counting semaphore? Along with the necessary ‘C’-struct, explain the implementation of waitO and signal() semaphore operations.

b. With the necessary syntax, describe the term monitor. Explain the solution to the classical dining philosopher’s problem, using monitor.

 

4 a. Define the terms: safe state and safe sequence. Give an algorithm to find whether or not a system is in a safe state.

b. Consider the following snapshot of the system.

Available

  A B C D A B C D
Po 0 0 1 2 0 0 1 2
Pi 1 0 0 0 1 7 5 0
P2 1 3 5 4 2 3 5 6
P3 0 6 3 2. 0 6 5 2
P4 0 0 1 4 0 6 5 6

Using the Bankers algorithm, answer the following:

i)    What is the content of a matrix NEED?

ii)   Is the system in SAFE state? If yes, give the SAFE state.

iii)  If a request from a process Pi arrives for (0,4,2,0), can the request be granted immediately?

 

PART – B

5 a.What do you mean by a address binding? Explain with the necessary steps, the binding of instructions and data to memory addresses.

b. On a system using demand paged memory it takes 0.12 to satisfy a memory request, if the page is in memory. If the page is not in memory the request takes 5000 fis. What would the page fault rate need to be to achieve an effective access time 1000 p,s? Assume the system is only running a single process and the CPU is idle during the page swaps.

c. What do you mean by a copy-on-write? Where is it used? Explain in brief.

 

6 a. What do you mean by a free space list? With suitable examples, explain any two methods of implementation of a free space list.

b. What are the major methods used for allocating a disk space? Explain each, with suitable examples.

 

7 a. Discuss the steps in handling a page fault, with the help of a neat diagram.

b. Given the page reference string: 09018187871282782383 Three frames allocated for the program in the main memory. Determine the number of page faults using i) LRU policy ii) Optimal replacement policy.

 

8 a. Discuss the directory implementation using

i) Linear list ii) Hash table

b. What are the components that the kernel module support under Linux? Explain in detail.

Leave a Comment