Question Paper: Operating Systems : Question Paper Jun 2015 - Computer Science Engg. (Semester 5) | Visveswaraya Technological University (VTU)
0

Operating Systems - Jun 2015

Computer Science Engg. (Semester 5)

TOTAL MARKS: 100
TOTAL TIME: 3 HOURS
(1) Question 1 is compulsory.
(2) Attempt any four from the remaining questions.
(3) Assume data wherever required.
(4) Figures to the right indicate full marks.
1 (a) What are the activities for which the operating system is responsible for, in connection with
i) Process management
ii) File management.
(10 marks)
1 (b) Explain any two types of system calls.(5 marks) 1 (c) What are virtual machine? Explain the benefit of creating virtual machines.(5 marks) 2 (a) With a diagram, explain different states of process.(4 marks) 2 (b) Differentiate between direct and indirect interprocess communication.(4 marks) 2 (c) Explain any three multithreading models in brief.(3 marks) 2 (d) Consider the following set of process:

<colgroup span="3" style="text-align: center;" width="85"> </colgroup>
Process Arrival time Burst time
P1 0 5
P2 1 1
P3 2 4

Compute average turn around d time and average waiting time using FCFS, preemptive SJF and RR (quantum-4).(7 marks) 3 (a) Explain Peterson's solution to critical section problem.(6 marks) 3 (b) Describe the mutual-exclusion implementation with TestAndSet().(6 marks) 3 (c) Mention three classical problems of synchronization. Explain any one in detail.(8 marks) 4 (a) Consider the following snapshot of a system:
<colgroup span="10"> </colgroup>
  Allocation Max Available
A B C A B C A B C
P0 0 1 0 7 5 3 3 3 2
P1 2 0 0 3 2 2  
P2 3 0 2 9 0 2
P3 2 1 1 2 2 2
P4 0 0 2 4 3 3

Answer the following questions using Banker's algorithm.
i) What is the content of the matrix need?
ii) Is the system in a safe state?
iii) If a request from process P1 arrives for (1,0,2), can the request be granted immediately?
(12 marks)
4 (b) For the following resource- allocation graph, write the corresponding wait- for graph. (4 marks) 4 (c) Explain the different methods used to recover from deadlock.(4 marks) 5 (a) With supporting paging hardware, explain in detail concept of paging with an example for a 32-byte memory with 4-type pages with a process being 16-bytes. How many bits are reversed for page number and page offset in the logical address. Suppose the logical address is 5, calculate the corresponding physical address, after populating memory and page table.(10 marks) 5 (b) Discuss on the performance of demand paging.(5 marks) 5 (c) What is Belady's anomaly? Explain with an example.(5 marks) 6 (a) Mention any five
i) File attributes
ii) File operations.
(5 marks)
6 (b) With supporting diagrams distinguish between single-level and two-level directory structure.(5 marks) 6 (c) Compare contiguous and linked allocation methods for disk space.(5 marks) 6 (d) Explain bit vector free space management technique.(5 marks) 7 (a) With an illustrative example, distinguish between SSTF, FCFS,SCAN and LOOK DISK schedulings.(8 marks) 7 (b) What are boot block and bad blocks? Explain.(6 marks) 7 (c) Explain the goals and principles of protection.(6 marks)


Write short notes on

8 (a) Design principles of Linux System.(5 marks) 8 (b) Linux virtual memory system.(5 marks) 8 (c) Segmentation.(5 marks) 8 (d) LRU page replacement algorithm(5 marks)

ADD COMMENTlink
written 2.8 years ago by gravatar for Team Ques10 Team Ques10 ♦♦ 400
Please log in to add an answer.