Visvesvaraya Technological University (VTU) 2006 B.E Fifth Semester , .06 / 07 Operating Systems - Question Paper

Fifth Semester B.E. Degree Examination, January/February 2006
Computer Science/Information Science and Engineering
Operating Systems
Time:3hrs.) (Max.Marks:100
Note: 1. ans any 5 ques..
1. Write relevant figures/diagrams wherever necessary.
1. (a) What is an operating system (OS)? Differentiate ranging from the 2 views of OS
. (5marks)
(b) List the essential properties of the subsequent kinds of operating systems:
i) Batch
ii) Time sharing
iii) Distributed.
(9marks)
(c) Mention the activities connected with process management, memory management
of and file management, (6marks)
2. (a) Compare virtual machine and no virtual machine. (3marks)
(b) Write the structure of PCB and the state transition diagram. Mention the function
of every state. (6marks)
(c) define the function of long term, medium term and short term schedulers with a
block diagram. (6marks)
(d) Write a program in C language to create a child process and synchronize with the
main program. (5marks)
3. (a) Differentiate ranging from onetoone
and manytomany
model used for
multithreading implementation. (4marks)
(b) describe throughput and response time in a multiprogramming system. (2marks)
(c) discuss round robin scheduling policy. (6marks)
(d) Consider the subsequent set of processes. The processes have arrived in the order P1,
P2, P3, P4, P5 all at time Q.
i) Draw 4 Ganttt charts illustrating ;the execution of these processes using FCFS,
SJF, a no preemptive priority ( a smaller priority number implies a higher
priority ), and RR (quantum=1) scheduling
ii) What is the turnaround time of every process for every process for every of the
scheduling algorithms in part (I)? (8marks)
2. (a ) discuss critical part issue. explain on efficient algorithm which can
meet all the requirements to solve this issue. (7marks)
(b) Write a monitor solution to the dining philosopher’s issue. (5marks)
(c) What a is deadlock? elaborate the necessary conditions for a deadlock
situation? (3marks)
(d) define banker’s algorithm for deadlock avoidance.
5. (a) Determine the total swap time for a user process o0f size four MB with a disk
transfer rate of 10 MB per 2nd and latency time is 12 msec. (3marks)
(b) define both internal and external fragmentation issues encountered in a
contiguous memory allocation scheme. (6marks)
(c) discuss paged memory allocation scheme. (8marks)
(d) What is virtual memory concept? discuss the address translation mechanism.
(3marks)
6. (a) Define:
i) Thrashing
ii) Belady’s anomaly and
iii) Effective access time in demand paging. (3marks)
(b) consider the subsequent page reference
1,2,3,4,2,1,5,6,2,1,2,2,3,7,6
How many page fauits would occur for the subsequent replacement algorithms
Assuming 3 page frames in the main memory? All page frames are initially
empty so that 1st unique pages will all cost 1 fault every
1)FIFO
2)LRU
3)Optimal. (9marks)
(d)Differentiate ranging from 2 level directory structured and tree structured directory.
(4marks)
(d)Explain the structure of disk. (4marks)
7. (a)Explain the structure of disk. (6marks)
(b)Explain the six file operations. (6marks)
(c)Discuss on SCAN disk scheduling method. Also compare with CSCAN
scheduling. (8marks)
8. (a) define areas matrix model of protection. (7marks)
(b)Explain the various program threats. (6marks)
(c)Discuss on the process management function in Unux OS.

Earning:   Approval pending.