Year : III MODEL QUESTION PAPER Subject: Operating Systems

Global Institute Technology, Jaipur

(Approved by AICTE and Affiliated to RTU, Kota)

Sem : V

Unit I Q1 a) Define operating system? Explain the different services provided by the operating system. b) Explain the different types of operating systems. OR Q1 a) What is process? Explain the life cycle of a process with the help of diagram. b) What are threads? Explain multithreading models. Unit II Q2 What is Inter Process Communication (IPC)? Explain following in the context of IPC: (I) Race condition (II) Critical section b) Explain semaphore solution for dining philosopher problem. OR Q2 a) Five processes arriving at time zero, in the order with the length of CPU burst time in milliseconds are given below: Process Burst Time P1 10 P2 29 P3 P4 P5 3 7 12

Schedule these processes using FCFS, SJF, and Round Robin (quantum=10 milliseconds) scheduling algorithms. Which algorithm gives the minimum average waiting time? b) Write a short note on: (i) Message passing (ii) CPU schedulers Unit III Q3 a) What is deadlock? Explain necessary conditions for deadlock. b) Explain Bankers algorithm with an example.

OR Q3 a) Explain static and dynamic loading. b) Explain different memory allocation sechmes with an example. Unit IV Q4 a) What is paging? Explain hierarchical paging. b) Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2 How many page faults would occur for the following page replacement algorithms, assuming three frames? FIFO (ii) LRU (iii) Optimal OR Q4 a) Explain Beladys anomaly with suitable example. b) Explain segmentation with paging. Unit V Q5 a) Explain file access methods. b) The disk queue in the request for I/O to block on cylinders are 98, 183, 37, 122, 14, 124, 65, 67. If the disk head is initially at 53, then compute the total head movement for the following algorithms: 8 Marks (i) FCFS (ii) SSTF (iii) SCAN (iv) C-SCAN OR Q5 a) Explain directory structures. b) Explain disk attachement.