9 E A 6

C6 6F94 43E 96C CA2 2CA 778 812F FC6 522 2953
F 9 C 7 1 5 9 8
6F 943 3E96 6CAA2C A7 781 2FC C652 229 538 85A
7 2 5 8
F9 943E E96C CA2 2CAA77 812 FC6 6522 295 388 5AC C6F
43 96 A C 77 812 FC 52 95 38 5A 6 94
94 E9 C 2C A7 81 F 65 29 3 85 C F9 3E
3 A C 8 A 6
43 E96 6CA 2C A77 7812 2FC 652 2295 538 85A C6 F94 43E9 96C
E9 CA 2C A7 81 F 65 29 38 85 C6 F9 3E 6C A2
E9 6CA 2C A7 781 2F C65 229 538 85 AC6 F9 43E 96C A2 CA
A

C)
4

B)
6 7 C 2
96 CA 2CAA77 812 2FC 652 295 5388 85A C6F F94 3E9 96CAA2C CA7 7781
CA 2C 7 81 FC 65 29 38 5A C6 94 3E 6C 2 A 78 2F
CA 2C A7 781 2FC 65 229 538 85A C6 F94 3E 96C A2 CA 778 12F C6
A 7 2 2 5 8 F 9 C 7 1 5

P5
P4
P3
P2
P1
A2 2CA 778 812 FC6 6522 2953 388 5AC C6F 943 3E96 6CAA2C A7 781 2FC C652 229

i)

ii)
CA 77 12 FC 52 95 88 5A 6F 943 E9 CA 2C A7 781 2FC 65 29 538
2C 7 81 FC 65 29 38 5A C6 94 E 6C 2 A 78 2F 6 22 53 85

Process
A7 781 2F 65 229 53 85 C F9 3E 96C A2 CA 77 12 C6 52 95 88 AC
78 2F C6 22 53 885 AC 6F9 43E 96 A CA 77 812 FC 52 295 388 5A 6F
12 C6 52 95 88 A 6F 43 9 CA 2C 7 81 FC 65 29 38 5A C6 94
FC 52 29 38 5A C6 94 E 6C 2 A 78 2F 6 22 53 85 C F9 3E
65 29 538 85A C6 F9 3E 96C A2 CA 778 12F C6 522 953 885 AC 6F 43 96
22 53 85 C F9 43 96 A CA 77 12 C 52 95 88 A 6F 94 E9 C
Max Marks: 60

95 88 A 6F 43 E9 CA 2C 7 81 FC 65 29 38 5A C6 9 3E 6C A2

from the Kernel?

38 5A C6 94 E 6C 2 A 78 2F 6 22 53 85 C F9 43 96 A CA
Course: B. Tech.

85 C F9 3E 96 A CA 77 12 C6 52 95 88 A 6F 43 E9 CA 2C 7
AC 6F 43 96 CA 2C 77 81 FC 52 29 38 5A C6 94 E 6C 2 A 78

2) File management
6F 943 E96 CA 2C A7 81 2FC 652 29 538 85A C6 F94 3E 96C A2 CA 778 12F
94 E9 C 2C A7 781 2F 65 29 53 85 C F9 3E 96 A2 CA 77 12 C6
3E 6C A2 A 78 2F C6 22 53 88 AC 6F 43 96 CA C 77 81 FC 52

1) Process management
96 A CA 77 12 C 52 95 88 5A 6F 94 E9 CA 2C A7 81 2FC 65 29

5
1
2
1
CA 2C 7 81 FC 65 29 38 5A C6 94 3E 6C 2 A 78 2F 6 22 53

10
2C A7 781 2FC 65 229 538 85A C6 F94 3E 96C A2 CA 778 12F C6 522 953 885
Instructions to the Students:

A7 781 2F 65 229 53 85 C F9 3E 96C A2 CA 77 12 C6 52 95 88 AC

78 2F C6 22 53 885 AC 6F9 43E 96 A CA 77 812 FC 52 295 388 5A 6F
12 C6 52 95 88 A 6F 43 9 CA 2C 7 81 FC 65 29 38 5A C6 94
FC 52 29 38 5A C6 94 E 6C 2 A 78 2F 6 22 53 85 C F9 3E
65 29 538 85A C6 F9 3E 96C A2 CA 778 12F C6 522 953 885 AC 6F 43 96

Burst Time

of the scheduling algorithm.

22 53 85 C F9 43 96 A CA 77 12 C 52 95 88 A 6F 94 E9 C
95 88 A 6F 43 E9 CA 2C 7 81 FC 65 29 38 5A C6 9 3E 6C A2
38 5A C6 94 E 6C 2 A 78 2F 6 22 53 85 C F9 43 96 A CA
85 C F9 3E 96 A CA 77 12 C6 52 95 88 A 6F 43 E9 CA 2C 7
1. All the questions are compulsory.

AC 6F 43 96 CA 2C 77 81 FC 52 29 38 5A C6 94 E 6C 2 A 78
6F 943 E96 CA 2C A7 81 2FC 652 29 538 85A C6 F94 3E 96C A2 CA 778 12F

each job will run the listed amount of time.

94 E9 C 2C A7 781 2F 65 29 53 85 C F9 3E 96 A2 CA 77 12 C6
3E 6C A2 A 78 2F C6 22 53 88 AC 6F 43 96 CA C 77 81 FC 52

2
4
3
1
3
96 A CA 77 12 C 52 95 88 5A 6F 94 E9 CA 2C A7 81 2FC 65 29
CA 2C 7 81 FC 65 29 38 5A C6 94 3E 6C 2 A 78 2F 6 22 53
Date: 18/08/2022

2C A7 781 2FC 65 229 538 85A C6 F94 3E 96C A2 CA 778 12F C6 522 953 885
A7 781 2F 65 229 53 85 C F9 3E 96C A2 CA 77 12 C6 52 95 88 AC

Priority
78 2F C6 22 53 885 AC 6F9 43E 96 A CA 77 812 FC 52 295 388 5A 6F
12 C6 52 95 88 A 6F 43 9 CA 2C 7 81 FC 65 29 38 5A C6 94
FC 52 29 38 5A C6 94 E 6C 2 A 78 2F 6 22 53 85 C F9 3E

The process has arrived in the order P1, P2, P3, P4, P5.
65 29 538 85A C6 F9 3E 96C A2 CA 778 12F C6 522 953 885 AC 6F 43 96
22 53 85 C F9 43 96 A CA 77 12 C 52 95 88 A 6F 94 E9 C
Branch: Computer Engineering

95 88 A 6F 43 E9 CA 2C 7 81 FC 65 29 38 5A C6 9 3E 6C A2

communication using shared memory and massage passing

38 5A C6 94 E 6C 2 A 78 2F 6 22 53 85 C F9 43 96 A CA
worki ng of JVM . Explain what are the benefits of a VM?

C) Describe major activities of an operating system in regard to:

Subject Code & Name: BTCOC402 & Operating Systems

85 C F9 3E 96 A CA 77 12 C6 52 95 88 A 6F 43 E9 CA 2C 7
AC 6F 43 96 CA 2C 77 81 FC 52 29 38 5A C6 94 E 6C 2 A 78

85AC6F943E96CA2CA77812FC65229538
6F 943 E96 CA 2C A7 81 2FC 652 29 538 85A C6 F94 3E 96C A2 CA 778 12F
94 E9 C 2C A7 781 2F 65 29 53 85 C F9 3E 96 A2 CA 77 12 C6

A) Consider the following data with burst time given in milliseconds:

3) Main Memory management
3. Use of non-programmable scientific calculators is allowed.

3E 6C A2 A 78 2F C6 22 53 88 AC 6F 43 96 CA C 77 81 FC 52

Q.2 Solve Any Two of the following. (This is just a sample instruction)
Q. 1 Solve Any Two of the following. (This is just a sample instruction)

96 A CA 77 12 C 52 95 88 5A 6F 94 E9 CA 2C A7 81 2FC 65 29
CA 2C 7 81 FC 65 29 38 5A C6 94 3E 6C 2 A 78 2F 6 22 53
4) Secondary storage management
2C A7 781 2FC 65 229 538 85A C6 F94 3E 96C A2 CA 778 12F C6 522 953 885

SJF, non-preemptive Priority and RR (quantum=2) scheduling.

4. Assume suitable data wherever necessary and mention it clearly.
Regular End Semester Examination – Summer 2022

A7 781 2F 65 229 53 85 C F9 3E 96C A2 CA 77 12 C6 52 95 88 AC

78 2F C6 22 53 885 AC 6F9 43E 96 A CA 77 812 FC 52 295 388 5A 6F
12 C6 52 95 88 A 6F 43 9 CA 2C 7 81 FC 65 29 38 5A C6 94
A) Define a virtual machine with neat diagram. Describe t he concept and

Suppose the following jobs arrive for processing at the times indicated,
B) What is the purpose of command interpreter? Why is it usually separate

What is turnaround time and waiting time of each process for each

What are co-operating processes? Describe the mechanism of inter process

FC 52 29 38 5A C6 94 E 6C 2 A 78 2F 6 22 53 85 C F9 3E

Draw Gantt charts for the execution of these processes using FCFS,
65 29 538 85A C6 F9 3E 96C A2 CA 778 12F C6 522 953 885 AC 6F 43 96
22 53 85 C F9 43 96 A CA 77 12 C 52 95 88 A 6F 94 E9 C
95 88 A 6F 43 E9 CA 2C 7 81 FC 65 29 38 5A C6 9 3E 6C A2
on which the question is based is mentioned in ( ) in front of the question.
Semester: IV

38 5A C6 94 E 6C 2 A 78 2F 6 22 53 85 C F9 43 96 A C
85 C F9 3E 96 A CA 77 12 C6 52 95 88 A 6F 43 E9 CA 2C
AC 6F 43 96 CA 2C 77 81 FC 52 29 38 5A C6 94 E 6C 2 A
Duration: 3.45 Hr.

(3)
(2)
(3)
(2)
(2)
(2)

6F 943 E96 CA 2C A7 81 2FC 652 29 538 85A C6 F94 3E 96C A2 CA

94 E9 C 2C A7 781 2F 65 29 53 85 C F9 3E 96 A2 CA 7
2. The level of question/expected answer as per OBE or the Course Outcome (CO)

(Level)

3E 6C A2 A 78 2F C6 22 53 88 AC 6F 43 96 CA C 77
DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE

96 A CA 77 12 C 52 95 88 5A 6F 94 E9 CA 2C A7 8
CA 2C 7 81 FC 65 29 38 5A C6 94 3E 6C 2 A 78
2C A7 781 2FC 65 229 538 85A C6 F94 3E 96C A2 CA 778 1
A7 781 2F 65 229 53 85 C F9 3E 96C A2 CA 77 12
78 2F C6 22 53 885 AC 6F9 43E 96 A CA 77 812 F

6
6
6
6
6
6

12 C6 52 95 88 A 6F 43 9 CA 2C 7 81 FC
FC 52 29 38 5A C6 94 E 6C 2 A 78 2F
65 29 538 85A C6 F9 3E 96C A2 CA 778 12F C6
Marks

22 53 85 C F9 43 96 A CA 77 12 C
95 88 A 6F 43 E9 CA 2C 7 81 FC 65
38 5A C6 94 E 6C 2 A 78 2F 6
85 C F9 3E 96 A CA 77 12 C6 52
AC 6F 43 96 CA 2C 77 81 FC 52 2
6F 943 E96 CA 2C A7 81 2FC 652 29
9 E 2 A 7 2 6
 9 E A 6
C6 6F94 43E 96C CA2 2CA 778 812F FC6 522 2953
F 9 C 7 1 5 9 8
6F 943 3E96 6CAA2C A7 781 2FC C652 229 538 85A
7 2 5 8
F9 943E E96C CA2 2CAA77 812 FC6 6522 295 388 5AC C6F
43 96 A C 77 812 FC 52 95 38 5A 6 94
94 E9 C 2C A7 81 F 65 29 3 85 C F9 3E
3 A C 8 A 6
43 E96 6CA 2C A77 7812 2FC 652 2295 538 85A C6 F94 43E9 96C
E9 CA 2C A7 81 F 65 29 38 85 C6 F9 3E 6C A2
E9 6CA 2C A7 781 2F C65 229 538 85 AC6 F9 43E 96C A2 CA
6 7 C 2 A 4
96 CA 2CAA77 812 2FC 652 295 5388 85A C6F F94 3E9 96CAA2C CA7 7781
CA 2C 7 81 FC 65 29 38 5A C6 94 3E 6C 2 A 78 2F
CA 2C A7 781 2FC 65 229 538 85A C6 F94 3E 96C A2 CA 778 12F C6
A 7 2 2 5 8 F 9 C 7 1 5

P5
P4
P3
P2
P1
i)
A2 2CA 778 812 FC6 6522 2953 388 5AC C6F 943 3E96 6CAA2C A7 781 2FC C652 229

ii)
CA 77 12 FC 52 95 88 5A 6F 943 E9 CA 2C A7 781 2FC 65 29 538
2C 7 81 FC 65 29 38 5A C6 94 E 6C 2 A 78 2F 6 22 53 85

Process
A7 781 2F 65 229 53 85 C F9 3E 96C A2 CA 77 12 C6 52 95 88 AC
3
2
1

78 2F C6 22 53 885 AC 6F9 43E 96 A CA 77 812 FC 52 295 388 5A 6F

12 C6 52 95 88 A 6F 43 9 CA 2C 7 81 FC 65 29 38 5A C6 94
FC 52 29 38 5A C6 94 E 6C 2 A 78 2F 6 22 53 85 C F9 3E
65 29 538 85A C6 F9 3E 96C A2 CA 778 12F C6 522 953 885 AC 6F 43 96

0 0
2 1
3 0
2 0
0 1
22 53 85 C F9 43 96 A CA 77 12 C 52 95 88 A 6F 94 E9 C
95 88 A 6F 43 E9 CA 2C 7 81 FC 65 29 38 5A C6 9 3E 6C A2
1.0
0.4
0.0

38 5A C6 94 E 6C 2 A 78 2F 6 22 53 85 C F9 43 96 A CA
85 C F9 3E 96 A CA 77 12 C6 52 95 88 A 6F 43 E9 CA 2C 7

2
1
2
0
0
AC 6F 43 96 CA 2C 77 81 FC 52 29 38 5A C6 94 E 6C 2 A 78

Consumer processes.
R1 R2 R3
6F 943 E96 CA 2C A7 81 2FC 652 29 538 85A C6 F94 3E 96C A2 CA 778 12F

cycle but no deadlock.

Allocation
94 E9 C 2C A7 781 2F 65 29 53 85 C F9 3E 96 A2 CA 77 12 C6
3E 6C A2 A 78 2F C6 22 53 88 AC 6F 43 96 CA C 77 81 FC 52
96 A CA 77 12 C 52 95 88 5A 6F 94 E9 CA 2C A7 81 2FC 65 29
Job arrival time

CA 2C 7 81 FC 65 29 38 5A C6 94 3E 6C 2 A 78 2F 6 22 53
2C A7 781 2FC 65 229 538 85A C6 F94 3E 96C A2 CA 778 12F C6 522 953 885

4
2
9
3
7
above algorithms?

A7 781 2F 65 229 53 85 C F9 3E 96C A2 CA 77 12 C6 52 95 88 AC

1
4
8

78 2F C6 22 53 885 AC 6F9 43E 96 A CA 77 812 FC 52 295 388 5A 6F

12 C6 52 95 88 A 6F 43 9 CA 2C 7 81 FC 65 29 38 5A C6 94

2
5
FC 52 29 38 5A C6 94 E 6C 2 A 78 2F 6 22 53 85 C F9 3E
65 29 538 85A C6 F9 3E 96C A2 CA 778 12F C6 522 953 885 AC 6F 43 96

R1 R2 R3
22 53 85 C F9 43 96 A CA 77 12 C 52 95 88 A 6F 94 E9 C

3 3
2 2
0 2
2
3
95 88 A 6F 43 E9 CA 2C 7 81 FC 65 29 38 5A C6 9 3E 6C A2

Maximum

Is the system in a safe state at time T0?

38 5A C6 94 E 6C 2 A 78 2F 6 22 53 85 C F9 43 96 A CA
burst time

85 C F9 3E 96 A CA 77 12 C6 52 95 88 A 6F 43 E9 CA 2C 7
AC 6F 43 96 CA 2C 77 81 FC 52 29 38 5A C6 94 E 6C 2 A 78
6F 943 E96 CA 2C A7 81 2FC 652 29 538 85A C6 F94 3E 96C A2 CA 778 12F
94 E9 C 2C A7 781 2F 65 29 53 85 C F9 3E 96 A2 CA 77 12 C6
3E 6C A2 A 78 2F C6 22 53 88 AC 6F 43 96 CA C 77 81 FC 52

resource type R1, is the system in a safe state?

rithm makes the most efficient use of memory?

96 A CA 77 12 C 52 95 88 5A 6F 94 E9 CA 2C A7 81 2FC 65 29
CA 2C 7 81 FC 65 29 38 5A C6 94 3E 6C 2 A 78 2F 6 22 53
2C A7 781 2FC 65 229 538 85A C6 F94 3E 96C A2 CA 778 12F C6 522 953 885
A7 781 2F 65 229 53 85 C F9 3E 96C A2 CA 77 12 C6 52 95 88 AC
78 2F C6 22 53 885 AC 6F9 43E 96 A CA 77 812 FC 52 295 388 5A 6F
12 C6 52 95 88 A 6F 43 9 CA 2C 7 81 FC 65 29 38 5A C6 94
FC 52 29 38 5A C6 94 E 6C 2 A 78 2F 6 22 53 85 C F9 3E
65 29 538 85A C6 F9 3E 96C A2 CA 778 12F C6 522 953 885 AC 6F 43 96
22 53 85 C F9 43 96 A CA 77 12 C 52 95 88 A 6F 94 E9 C
95 88 A 6F 43 E9 CA 2C 7 81 FC 65 29 38 5A C6 9 3E 6C A2
38 5A C6 94 E 6C 2 A 78 2F 6 22 53 85 C F9 43 96 A CA
and 7 instances of R3. At time T0, the situation is as follows;

85 C F9 3E 96 A CA 77 12 C6 52 95 88 A 6F 43 E9 CA 2C 7
AC 6F 43 96 CA 2C 77 81 FC 52 29 38 5A C6 94 E 6C 2 A 78

85AC6F943E96CA2CA77812FC65229538
6F 943 E96 CA 2C A7 81 2FC 652 29 538 85A C6 F94 3E 96C A2 CA 778 12F
94 E9 C 2C A7 781 2F 65 29 53 85 C F9 3E 96 A2 CA 77 12 C6
3E 6C A2 A 78 2F C6 22 53 88 AC 6F 43 96 CA C 77 81 FC 52

Q.4 Solve Any Two of the following. (This is just a sample instruction)
Q. 3 Solve Any Two of the following. (This is just a sample instruction)

96 A CA 77 12 C 52 95 88 5A 6F 94 E9 CA 2C A7 81 2FC 65 29
CA 2C 7 81 FC 65 29 38 5A C6 94 3E 6C 2 A 78 2F 6 22 53
the non- preemptive FCFS and SJF scheduling algorithms.

2C A7 781 2FC 65 229 538 85A C6 F94 3E 96C A2 CA 778 12F C6 522 953 885
A7 781 2F 65 229 53 85 C F9 3E 96C A2 CA 77 12 C6 52 95 88 AC
78 2F C6 22 53 885 AC 6F9 43E 96 A CA 77 812 FC 52 295 388 5A 6F
12 C6 52 95 88 A 6F 43 9 CA 2C 7 81 FC 65 29 38 5A C6 94

A) Given memory partitions of 150 K, 250 K, 500 K, 300 K and 600 K (in or-

cate processes of 212K, 417K, 112K and 426 K (in order)? Which algo-
der) how would each of the first-fit, best-fit and worst-fit algorithms allo-
Suppose now at time T1, process P2 requests one additional instance of
What is turnaround time and waiting time of each job for the

cation graph with a deadlock, also explain resource allocation graph with a
system has 5 processes, P1, P2, P3, P4 and P5. There are 3 types of
Give a Gantt chart illustrating the execution of these jobs using

tion for the same using semaphores. Write the structure of Producer and
resources R1, R2 and R3. there are 10 instances of R1, 5 instances of R2
A) Examine banker’s algorithm after applying to the example given below. A

C) Describe the bounded-buffer Producer-Consumer problem and give a solu-

B) Why is deadlock state more critical than starvation? Describe resource allo-
FC 52 29 38 5A C6 94 E 6C 2 A 78 2F 6 22 53 85 C F9 3E
65 29 538 85A C6 F9 3E 96C A2 CA 778 12F C6 522 953 885 AC 6F 43 96
22 53 85 C F9 43 96 A CA 77 12 C 52 95 88 A 6F 94 E9 C
95 88 A 6F 43 E9 CA 2C 7 81 FC 65 29 38 5A C6 9 3E 6C A2
38 5A C6 94 E 6C 2 A 78 2F 6 22 53 85 C F9 43 96 A C
85 C F9 3E 96 A CA 77 12 C6 52 95 88 A 6F 43 E9 CA 2C
AC 6F 43 96 CA 2C 77 81 FC 52 29 38 5A C6 94 E 6C 2 A

(3)
(2)
(2)
(3)

6F 943 E96 CA 2C A7 81 2FC 652 29 538 85A C6 F94 3E 96C A2 CA

94 E9 C 2C A7 781 2F 65 29 53 85 C F9 3E 96 A2 CA 7
3E 6C A2 A 78 2F C6 22 53 88 AC 6F 43 96 CA C 77
96 A CA 77 12 C 52 95 88 5A 6F 94 E9 CA 2C A7 8
CA 2C 7 81 FC 65 29 38 5A C6 94 3E 6C 2 A 78
2C A7 781 2FC 65 229 538 85A C6 F94 3E 96C A2 CA 778 1
A7 781 2F 65 229 53 85 C F9 3E 96C A2 CA 77 12
78 2F C6 22 53 885 AC 6F9 43E 96 A CA 77 812 F

6
6
6
6

12 C6 52 95 88 A 6F 43 9 CA 2C 7 81 FC
FC 52 29 38 5A C6 94 E 6C 2 A 78 2F
65 29 538 85A C6 F9 3E 96C A2 CA 778 12F C6
22 53 85 C F9 43 96 A CA 77 12 C
95 88 A 6F 43 E9 CA 2C 7 81 FC 65
38 5A C6 94 E 6C 2 A 78 2F 6
85 C F9 3E 96 A CA 77 12 C6 52
AC 6F 43 96 CA 2C 77 81 FC 52 2
6F 943 E96 CA 2C A7 81 2FC 652 29
9 E 2 A 7 2 6
 9 E A 6
C6 6F94 43E 96C CA2 2CA 778 812F FC6 522 2953
F 9 C 7 1 5 9 8
6F 943 3E96 6CAA2C A7 781 2FC C652 229 538 85A
7 2 5 8
F9 943E E96C CA2 2CAA77 812 FC6 6522 295 388 5AC C6F
43 96 A C 77 812 FC 52 95 38 5A 6 94
94 E9 C 2C A7 81 F 65 29 3 85 C F9 3E
3 A C 8 A 6
43 E96 6CA 2C A77 7812 2FC 652 2295 538 85A C6 F94 43E9 96C
E9 CA 2C A7 81 F 65 29 38 85 C6 F9 3E 6C A2
E9 6CA 2C A7 781 2F C65 229 538 85 AC6 F9 43E 96C A2 CA
6 7 C 2 A 4
96 CA 2CAA77 812 2FC 652 295 5388 85A C6F F94 3E9 96CAA2C CA7 7781
CA 2C 7 81 FC 65 29 38 5A C6 94 3E 6C 2 A 78 2F
CA 2C A7 781 2FC 65 229 538 85A C6 F94 3E 96C A2 CA 778 12F C6
A 7 2 2 5 8 F 9 C 7 1 5
A2 2CA 778 812 FC6 6522 2953 388 5AC C6F 943 3E96 6CAA2C A7 781 2FC C652 229
CA 77 12 FC 52 95 88 5A 6F 943 E9 CA 2C A7 781 2FC 65 29 538
2C 7 81 FC 65 29 38 5A C6 94 E 6C 2 A 78 2F 6 22 53 85
B) Consider

A7 781 2F 65 229 53 85 C F9 3E 96C A2 CA 77 12 C6 52 95 88 AC

78 2F C6 22 53 885 AC 6F9 43E 96 A CA 77 812 FC 52 295 388 5A 6F
12 C6 52 95 88 A 6F 43 9 CA 2C 7 81 FC 65 29 38 5A C6 94
FC 52 29 38 5A C6 94 E 6C 2 A 78 2F 6 22 53 85 C F9 3E
65 29 538 85A C6 F9 3E 96C A2 CA 778 12F C6 522 953 885 AC 6F 43 96
22 53 85 C F9 43 96 A CA 77 12 C 52 95 88 A 6F 94 E9 C
95 88 A 6F 43 E9 CA 2C 7 81 FC 65 29 38 5A C6 9 3E 6C A2
38 5A C6 94 E 6C 2 A 78 2F 6 22 53 85 C F9 43 96 A CA
the

85 C F9 3E 96 A CA 77 12 C6 52 95 88 A 6F 43 E9 CA 2C 7
AC 6F 43 96 CA 2C 77 81 FC 52 29 38 5A C6 94 E 6C 2 A 78 with neat diagram.
6F 943 E96 CA 2C A7 81 2FC 652 29 538 85A C6 F94 3E 96C A2 CA 778 12F
94 E9 C 2C A7 781 2F 65 29 53 85 C F9 3E 96 A2 CA 77 12 C6
3E 6C A2 A 78 2F C6 22 53 88 AC 6F 43 96 CA C 77 81 FC 52
96 A CA 77 12 C 52 95 88 5A 6F 94 E9 CA 2C A7 81 2FC 65 29
CA 2C 7 81 FC 65 29 38 5A C6 94 3E 6C 2 A 78 2F 6 22 53
2C A7 781 2FC 65 229 538 85A C6 F94 3E 96C A2 CA 778 12F C6 522 953 885
A7 781 2F 65 229 53 85 C F9 3E 96C A2 CA 77 12 C6 52 95 88 AC

SCAN iv) LOOK v) C-SCAN.

78 2F C6 22 53 885 AC 6F9 43E 96 A CA 77 812 FC 52 295 388 5A 6F
12 C6 52 95 88 A 6F 43 9 CA 2C 7 81 FC 65 29 38 5A C6 94
FC 52 29 38 5A C6 94 E 6C 2 A 78 2F 6 22 53 85 C F9 3E
following

65 29 538 85A C6 F9 3E 96C A2 CA 778 12F C6 522 953 885 AC 6F 43 96

1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6

22 53 85 C F9 43 96 A CA 77 12 C 52 95 88 A 6F 94 E9 C
95 88 A 6F 43 E9 CA 2C 7 81 FC 65 29 38 5A C6 9 3E 6C A2
38 5A C6 94 E 6C 2 A 78 2F 6 22 53 85 C F9 43 96 A CA
85 C F9 3E 96 A CA 77 12 C6 52 95 88 A 6F 43 E9 CA 2C 7
AC 6F 43 96 CA 2C 77 81 FC 52 29 38 5A C6 94 E 6C 2 A 78
6F 943 E96 CA 2C A7 81 2FC 652 29 538 85A C6 F94 3E 96C A2 CA 778 12F

explain bit map with the help of an example

94 E9 C 2C A7 781 2F 65 29 53 85 C F9 3E 96 A2 CA 77 12 C6
file implementation with merits and demerits.

3E 6C A2 A 78 2F C6 22 53 88 AC 6F 43 96 CA C 77 81 FC 52
page

96 A CA 77 12 C 52 95 88 5A 6F 94 E9 CA 2C A7 81 2FC 65 29
CA 2C 7 81 FC 65 29 38 5A C6 94 3E 6C 2 A 78 2F 6 22 53
2C A7 781 2FC 65 229 538 85A C6 F94 3E 96C A2 CA 778 12F C6 522 953 885

*** End ***

A7 781 2F 65 229 53 85 C F9 3E 96C A2 CA 77 12 C6 52 95 88 AC
78 2F C6 22 53 885 AC 6F9 43E 96 A CA 77 812 FC 52 295 388 5A 6F
12 C6 52 95 88 A 6F 43 9 CA 2C 7 81 FC 65 29 38 5A C6 94
FC 52 29 38 5A C6 94 E 6C 2 A 78 2F 6 22 53 85 C F9 3E
65 29 538 85A C6 F9 3E 96C A2 CA 778 12F C6 522 953 885 AC 6F 43 96
22 53 85 C F9 43 96 A CA 77 12 C 52 95 88 A 6F 94 E9 C
95 88 A 6F 43 E9 CA 2C 7 81 FC 65 29 38 5A C6 9 3E 6C A2
38 5A C6 94 E 6C 2 A 78 2F 6 22 53 85 C F9 43 96 A CA
85 C F9 3E 96 A CA 77 12 C6 52 95 88 A 6F 43 E9 CA 2C 7
reference

AC 6F 43 96 CA 2C 77 81 FC 52 29 38 5A C6 94 E 6C 2 A 78

85AC6F943E96CA2CA77812FC65229538
6F 943 E96 CA 2C A7 81 2FC 652 29 538 85A C6 F94 3E 96C A2 CA 778 12F
94 E9 C 2C A7 781 2F 65 29 53 85 C F9 3E 96 A2 CA 77 12 C6
3E 6C A2 A 78 2F C6 22 53 88 AC 6F 43 96 CA C 77 81 FC 52
following page replacement algorithm i) LRU ii) FIFO iii) Optimal

Q. 5 Solve Any Two of the following. (This is just a sample instruction)

96 A CA 77 12 C 52 95 88 5A 6F 94 E9 CA 2C A7 81 2FC 65 29
CA 2C 7 81 FC 65 29 38 5A C6 94 3E 6C 2 A 78 2F 6 22 53
2C A7 781 2FC 65 229 538 85A C6 F94 3E 96C A2 CA 778 12F C6 522 953 885
A7 781 2F 65 229 53 85 C F9 3E 96C A2 CA 77 12 C6 52 95 88 AC
78 2F C6 22 53 885 AC 6F9 43E 96 A CA 77 812 FC 52 295 388 5A 6F
string

12 C6 52 95 88 A 6F 43 9 CA 2C 7 81 FC 65 29 38 5A C6 94
currently services a request at cylinder 1043, and the previous request was
B) Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. the drive

what is the total distance (in cylinders) that the disk arm moves to satisfy all
at cylinder 1225. the queue of pending request in FIFO order is 486, 1470,
Find out the number of page faults if there are 3 page frames, using the

A) Describe the different file allocation methods. Also explain the methods of
C) Describe the action taken by the operating system when a page fault occurs

C) Describe how free-space management is implemented in file system. Also

913, 1774, 948, 1509, 1022, 1750, 130. Starting from the current position,

pending requests, for each of the following algorithms i) FCFS ii) SSFT iii)

FC 52 29 38 5A C6 94 E 6C 2 A 78 2F 6 22 53 85 C F9 3E
65 29 538 85A C6 F9 3E 96C A2 CA 778 12F C6 522 953 885 AC 6F 43 96
22 53 85 C F9 43 96 A CA 77 12 C 52 95 88 A 6F 94 E9 C
95 88 A 6F 43 E9 CA 2C 7 81 FC 65 29 38 5A C6 9 3E 6C A2
38 5A C6 94 E 6C 2 A 78 2F 6 22 53 85 C F9 43 96 A C
85 C F9 3E 96 A CA 77 12 C6 52 95 88 A 6F 43 E9 CA 2C
AC 6F 43 96 CA 2C 77 81 FC 52 29 38 5A C6 94 E 6C 2 A
(2)

(2)
(3)
(2)
(3)

6F 943 E96 CA 2C A7 81 2FC 652 29 538 85A C6 F94 3E 96C A2 CA

94 E9 C 2C A7 781 2F 65 29 53 85 C F9 3E 96 A2 CA 7
3E 6C A2 A 78 2F C6 22 53 88 AC 6F 43 96 CA C 77
96 A CA 77 12 C 52 95 88 5A 6F 94 E9 CA 2C A7 8
CA 2C 7 81 FC 65 29 38 5A C6 94 3E 6C 2 A 78
2C A7 781 2FC 65 229 538 85A C6 F94 3E 96C A2 CA 778 1
A7 781 2F 65 229 53 85 C F9 3E 96C A2 CA 77 12
78 2F C6 22 53 885 AC 6F9 43E 96 A CA 77 812 F
6
6
6
6
6

12 C6 52 95 88 A 6F 43 9 CA 2C 7 81 FC
FC 52 29 38 5A C6 94 E 6C 2 A 78 2F
65 29 538 85A C6 F9 3E 96C A2 CA 778 12F C6
22 53 85 C F9 43 96 A CA 77 12 C
95 88 A 6F 43 E9 CA 2C 7 81 FC 65
38 5A C6 94 E 6C 2 A 78 2F 6
85 C F9 3E 96 A CA 77 12 C6 52
AC 6F 43 96 CA 2C 77 81 FC 52 2
6F 943 E96 CA 2C A7 81 2FC 652 29
9 E 2 A 7 2 6