Code No.

: 20ITC19
CHAITANYA BHARATHI INSTITUTE OF TECHNOLOGY (Autonomous)
B.E. (IT, AI&DS) V Sem (Main) Examination Dec 2022 / Jan 2023
Operating Systems
Time: 3 Hours Max Marks: 60
Note: Answer ALL questions from Part-A & Part –B (Internal Choice) at one place in the
same order
Part - A
(5Q X 3M = 15 Marks)
M CO BT
1 What is the state transition that occurs due to the scanf () system call in the (3) 1 3
program is given below? Explain.
int main(){
int a;
scanf(“%d \n ”, &a);
exit(0)
}
2 Write about the necessary conditions for a deadlock to occur. (3) 2 2
3 Explain about Trashing. (3) 3 2
4 Explain about file system mounting. (3) 4 2
5 List the goals of Protection. (3) 5 1
Part – B
(5Q X 9M = 45 Marks)
M CO BT
6 (a) Explain the following Operating system structure with neat sketches (5) 1 2
i. MS-DOS ii. Micro-kernel iii. iOS
(b) Explain Multi-Threading models with suitable examples. (4) 1 2
(OR)
7 (a) Describe Operating system services in detail. (5) 1 2
(b) Explain the following Inter-process communication techniques (4) 1 2
i. Message passing ii. Shared Memory

8 (a) Consider the set of 4 processes whose arrival time and burst time are (5) 2 3
given below-
Process No. Arrival Time CPU Burst

P1 0 3

P2 0 2

P3 2 1

P4 5 2
If the CPU scheduling policy is shortest Remaining Time First,
calculate the average waiting time and average turn- around time of the
processes.
(b) Describe Petersons solution for two process synchronization. (4) 2 2
Page 1 of 3
 Code No.: 20ITC19
(OR)
9 (a) Two processes, P1 and P2, need to access a critical section of code. (5) 2 3
Consider the following synchronization construct used by the
processes:
/* P1 */ /* P2 */
while (true) { while (true) {
wants1 = true; wants2 = true;
while (wants2 == true); while (wants1==true);
/* Critical /* Critical
Section */ Section */
wants1=false; wants2 = false;
} }
/* Remainder section */ /* Remainder section */
Here, wants1 and wants2 are shared variables, which are initialized to
false. Does the construct satisfy Mutual Exclusion, Progress and
Bounded Waiting? Justify your answer.
(b) Consider the following snapshot of a system (4) 2 3
Allocation Max
ABCD ABCD
P0 3014 5117
P1 2210 3211
P2 3121 3321
P3 0510 4612
P4 4212 6325
Using the banker’s algorithm, determine whether the system is in safe
state or not?
Available = (0,3,0,1)

10 (a) How logical address is converted to physical address by using the (5) 3 3
following page table structures?
a) Hierarchical
b) Hashed
c) Inverted
(b) Explain the demand paging concept with an example. (4) 3 2
(OR)
11 (a) What is Segmentation? Convert the following logical addresses to (5) 3 3
physical addresses using segmentation
Segment base length
0 219 600
1 2300 14
2 90 100
3 1327 580

(b) Explain the list of events that take place whenever a page fault occurs (4) 3 2
with the help of a diagram.
Page 2 of 3
 Code No.: 20ITC19

12 (a) A disk has 16 sectors of 1024 bytes on each track. Suppose the disk (5) 4 3
rotation is at 600 rpm, how long does it take to
a. read an entire track
b. what is the volume of data that can be stored on disk if it has 10
tracks
(b) Explain the issues in Disk Management. (4) 4 2
(OR)
13 (a) Explain File allocation techniques in detail and mention the format of (5) 4 2
File allocation table in each method.
(b) Suppose a disk has 201 cylinders, numbered from 0 to 200. At some (4) 4 3
time the disk arm is at cylinder 100, and there is a queue of disk access
requests for cylinders 30, 85, 90, 100, 105, 110, 135 and 145. If
Shortest-Seek Time First (SSTF) is being used for scheduling the disk
access, the request for cylinder 90 is serviced after servicing how many
number of requests?

14 (a) Explain the methods used to implement Access matrix. (5) 5 2

******

Page 3 of 3