Scribd
Upload
206 views5 pages

Operating Systems Question Paper 2021

This document outlines the examination structure for the Operating Systems subject for B.E. V Semester (CSE) students, including a two-part format with multiple questions. Part A consists of five short answer questions worth 10 marks, while Part B contains four detailed questions worth 60 marks. Topics covered include process management, scheduling algorithms, deadlock conditions, and memory management techniques.

Uploaded by

hellovallika
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
206 views5 pages

Operating Systems Question Paper 2021

This document outlines the examination structure for the Operating Systems subject for B.E. V Semester (CSE) students, including a two-part format with multiple questions. Part A consists of five short answer questions worth 10 marks, while Part B contains four detailed questions worth 60 marks. Topics covered include process management, scheduling algorithms, deadlock conditions, and memory management techniques.

Uploaded by

hellovallika
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Code No.

15125/AICTE
FACULTY OF ENGINEERING
B.E. V – Semester (CSE) (AICTE) (Main) Examination, July 2021

Subject: Operating Systems


Time: 2 Hours [Link]: 70
Note: Missing data, if any, may be suitably assumed
PART – A
Answer any five questions. (5x2=10 Marks)
1 Draw a neat diagram of PCB?
2 Draw the process state transition diagram?
3 State the necessary conditions for the deadlock to occur?
4 What is resource allocation graph? Give example.
5 What is critical section problem?
6 Differentiate between internal and external fragmentation?
7 What is thrashing? Give the reasons of thrashing.

1
8 What is file mounting?

45
9 Define seek time and rotational latency?
10 Draw a neat diagram for the levels of RAID?

-2
PART – B
Answer any four questions. (4x15=60 Marks)
11 a) What is a system call? Explain types system calls?
U
b) Explain the different multithreading models?
12 Compute for each average turnaround time and average waiting time using FCFS, SJF,
O
Priority (non-preemptive), round robin (Time slice=2ms). Process scheduling method. Draw
the Gantt chart for each scheduling algorithm.
Process Burst time Priority Arrival time
1

P1 10 3 0
P2 3 2 2
45

P3 1 1 (H) 1
P4 5 4 (L) 1
P5 7 2 1
-2

13 a) Explain the paging technique with a suitable example?


b) Discuss about various file allocation methods.
14 Consider the following page-reference string
U

7,0,2,1,3,4,2,1,0,2,1,4,3,2,1,0,0,1,2,1
O

Calculate the number of page fault that would occur for the following algorithms assuming
frame size as 3.
1. FIFO 2. OPTIMAL 3. LRU 4. MRU [Link] 6. MFU
15 a) What is dining-philosophers problem? Describe the solution of dining philosopher’s problem
using monitors.
b) Write the bankers algorithm for deadlock avoidance.
16 a) Consider disk queue with I/O requests for the blocks on cylinders:
95, 181, 39,123,12,124,65,68 and the disk head is initially at 57. Compute the total number
of head movement according to SSTF, SCAN, LOOK disk scheduling algorithm.
b) What is virtual memory? Explain about demand paging?
17 Write short notes on any two of the following:
a) Monitors
b) Semaphores
c) Free space allocation techniques
*

You might also like