Printed Pages:03 Sub Code:KCS-401

Paper Id: 238341 Roll No.

B.TECH.
(SEM IV) THEORY EXAMINATION 2022-23
OPERATING SYSTEMS
Time: 3 Hours Total Marks: 100
Note: Attempt all Sections. If require any missing data; then choose suitably.

SECTION A
1. Attempt all questions in brief. 2 x 10 = 20
(a) Define two main functions of an operating system.
(b) Explain the principal advantages of multiprogramming.
(c) Define the term busy waiting.
(d) Define semaphore and its types.
(e) Explain starvation problem and its solution.
(f) Explain internal and external fragmentation.
(g) Explain thrashing and locality of reference.
(h) Distinguish between physical and logical address space of a process.
(i) Explain various operations associated with a file.
90

2
(j) Explain tree level directory structure.

13
_2
SECTION B

2.
P2

2. Attempt any three of the following: 10x3=30

24
(a) Explain the following terms in detail:
3E

5.
(i) Multiprocessor operating system

.5
(ii) Real time system
P2

(iii) Time sharing system

17
Q

(b) For the following processes, draw Gantt chart to illustrate the execution using,
|1
(i) Preemptive priority scheduling
(ii) Non-Preemptive priority scheduling.
6

Also, Calculate average waiting time and average turnaround time.

:2

(Assumption: A larger priority number has higher priority.)

26

Process Arrival Time Burst Time Priority

:
13

A 0 5 4
B 2 4 2
3

C 2 2 6
02

D 4 4 3
-2

(c) Consider the given snapshot of a system with five processes (P0,P1,P2,P3,P4) and three
08

resources (A,B,C).
Allocation MAX Available
0-

Process/Resource A B C A B C A B C
|1

P0 1 1 2 4 3 3 2 1 0
P1 2 1 2 3 2 2
P2 4 0 1 9 0 2
P3 0 2 0 7 5 3
P4 1 1 2 11 2 3

(i) Calculate the content of Need Matrix.

(ii) Apply safety algorithm and check the current system is in safe state or not.
(iii) If the request from process P1 arrives for (1,1,0), can the request be granted
immediately?

QP23EP2_290 | 10-08-2023 13:26:26 | 117.55.242.132

 (d) Define process and process control block. Also, describe process state transition
diagram in detail.
(e) Explain the concept of paging. Also, explain paging hardware support using TLB with
suitable diagram

SECTION C
3. Attempt any one part of the following: 10x1=10
(a) Explain the term RAID and its characteristics. Also, explain various RAID levels with
their advantages and disadvantages.
(b) Explain the concept of file system management. Also, explain various file allocation and
file access mechanisms in details.

4. Attempt any one part of the following: 10x1=10

(a) Explain producer consumer problem and its solution using semaphore.
(b) Explain dinning philosopher problem and its solution using semaphore.

5. Attempt any one part of the following: 10x1=10

(a) Explain the concept of demand paging. Consider the given references to the following
pages by a program:
0,9,0,1,8,1,8,7,8,7,1,2,8,2,7,8,2,3,8,3
90
How many pages faults will occur if the program has three-page frames available to it

2
13
and uses:
_2
(i) FIFO replacement

2.
(ii) LRU replacement
P2

24
(iii) Optimal replacement
(b) Explain the terms hit ratio and miss ratio. On a simple paged system, associative registers
3E

5.
hold the most active page entries and the full-page table is stored in main memory. If

.5
P2

references satisfied by associative registers take 100ns, and references through main

17
memory page table takes 180 ns, what must the hit ratio be to achieve an effective access
Q

time of 125 ns?

|1
6. Attempt any one part of the following: 10x1=10
6
:2

(a) Explain the following terms:

26

(i) Multilevel feedback Queue Scheduling

(ii) Fixed portioning vs. variable partitioning
:
13

(b) Suppose the following disk request sequence (track numbers) for a disk with 100 tracks
is given: 45, 20, 90, 10, 50, 60, 80, 25, 70. Assume that the initial position of the R/W
3

head is on track 49. Calculate the net head movement using:

02

(i) SSTF
(ii) SCAN
-2

(iii) CSCAN
08

(iv) LOOK
0-

7. Attempt any one part of the following: 10x1=10

|1

(a) Explain Deadlock and necessary conditions for deadlock. Also, Explain resource
allocation graph with suitable diagram.
(b) Explain the followings:
(i) Buffering
(ii) Polling
(iii) Direct Memory Access (DMA)

QP23EP2_290 | 10-08-2023 13:26:26 | 117.55.242.132