5

X5
5

04
4

5Y
DX
Paper / Subject Code: 41023 / Operating System

A0

2D
5A
52
42
Y5
May 21, 2024 02:30 pm - 05:30 pm 1T01234 - S.E.(Information Technology Engineering)(SEM-IV)(Choice

04
5Y

X
DX
A0
25

2D
Base Credit Grading System ) (R- 19) (C Scheme) / 41023 - Operating System QP CODE : 10055708

5A
52
42
Y5
X5

04
5Y
DX
A0
5
2D

5A
2
2
Time: 3Hours Total Marks: 80

2
Y5

5
X5

4
04

5Y
DX
A0
5
2D
5A

52
2

2
5
X5

4
04

Y
Y
5Y

DX
N.B. 1) Question no.1 is compulsory

25
5
D

5A
A

52
52
2) Solve any Three questions from remaining five.

2
2
5

X5
04
04

5Y
Y

DX
DX
3) Assume suitable data and draw diagram wherever required.

2D
A
A

2
52

2
42

5
Y5

04
04

Y
DX
DX
A0

25
5

5A
A
2
Q1. Attempt any four Marks

2
42

5
Y5

5
X5

5Y
5Y

A0
0
A0
25

2D
D

5A
a. What are the various objectives and functions of Operating 5

52
2
42

Y5
5

X5
X5

Systems?

4
Y
Y

DX
A0
0

25
25
25

D
2D

Differentiate between process and threads.

A
b. 5

2
2

5
5

X5
X5
X5

4
04
04

Y
5Y

A0
c. Explain Race condition with example. 5

25

2D
D
D

A
5A

2
2

5
5

5
5

04
04
4

Y
5Y
5Y

DX
X
DX
What is Demand Paging? What are its advantages?
0

d. 5

5
2D

5A
A
A

52
52
52

42
2

Y5
5

4
4

5Y
Y

DX
X
DX

e. What are features of Mobile and Real Time Operating Systems? 5

A0
A0
A0

5
5

52
2
52

42
2
42

Y5
Y5
5

X5
4
5Y

DX
DX

A0
A0
A0

25
25
2D
52

42
2

5
5
Y5

X5
X5
Q2. a. Give the explanation of necessary conditions for deadlock. Explain 10
04
4

5Y
Y
X

0
A0

25
25

2D
how a resource allocation graph determines a deadlock. 2D
D

5A
5A

52
2
Y5

5
X5

04
04
4

5Y
Y

DX
DX
0

5
25
2D

5A
A

b. Consider the reference string7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1 10

5A

2
52

42
2

Y5

5
5

and four free frames which are empty initially. How many page
04
04

5Y
Y

DX
DX
X

A0
5
25
2D

5A
5A

faults would occur for replacement by

52
2

2
42

Y5
X5
5

04
4

5Y
5Y

1. LRU 2. FIFO 3. Optimal page replacement algorithms.

DX
DX

A0
0

25
D

5A
5A

52
52

42
42
2

X5
4

5Y
Y
Y

X
DX

A0
0
0

25
5

D
D

Q3. a. Explain RAID Level in Details 10

5A
5A

52
52

2
42
42

Y5
X5

04
5Y
Y

DX
DX

A0
A0

b. What is Internal fragmentation? Explain static partitioned 10

25
5

A
2
52

42
2
42

5
5

X5
5

allocation with partition sizes 400,180, 100, 300, and 45.

04

5Y
Y

DX
X

A0
0

Assuming First fit and Best fit method indicate thememory status
25

2D
D

5A
5A

52
2
42

Y5
5

after memory request for sizes 95, 180, 285, 380, 30.
04
4
Y
Y

X
X

A0
0

25
5
5

D
2D

5A
5A

52
52

2
5

X5
4
04

5Y
5Y
5Y

DX
DX

Q4. a. Explain file allocation methods in detail with proper diagram. 10

D
A
5A

52
2
52

2
42

5
5

04
Y
Y

DX
X
X

b. What is a thread? How multithreading is beneficial? Compare and 10

A0

25
5

D
2D

5A
52

contrast different multithreading models.

42
2
Y5

5
4
04

5Y
DX
X

A0
0
25
2D

5A
5A

52
2

Y5
X5

04
04

5Y
5Y

DX

Q5. a. Explain paging in detail. Describe how logical address is converted 10

25
2D

5A
A

52

into physical address.

2
Y5

X5
4
04

5Y
DX

A0
25

2D
5A

52

b. What is semaphore and its types? How the classic synchronization 10

42

5
5

04
Y
Y

X
X

problem -Dining philosopher is solved using semaphores?

A0

25
25

2D
D

5A
42

Y5

X5
X5

04

5Y
A0

25

2D
2D

5A

52
X5

04
04

5Y

DX
2D

5A
5A

52

42

55708 Page 1 of 2
4

Y
Y

DX

A0
A0

25
25

42

Y5
Y5

X5
5
DX

A0

25
25

2D
Y5

X5
X5

04
25

2D

X525Y5A042DX525Y5A042DX525Y5A042DX525Y5A042D
2D

5A
 A0 5Y DX DX A0
25 42
D 5A 5 52 42
Y X 04 5 Y DX
2D 5A 5 25 2D 5A 52
X5 04 Y5 X 52 0 42 5Y
25 2D
X5 A 04 5Y DX 5A
04
Y5 2D 5A 52
A0 25 5 2D
4 Y X 52 0 42 Y X5
25 2D 5A D 5A
5 Y X 0 25 Q6.
Y5 X5 04 52 4 Y5
2D 5A 2D

55708
A0 25 5 A0
42 Y5 X5 04 Y 5A X 5 42
A0 25 2D 25
DX X 0 4
DX
a.

b.
5A 52 42
DX
Y5
A0 5 25 2 DX
Y5
A0 52
04 5Y Y 5Y
2D 5A 52 42 5 5 25 4 2 5A
5Y DX A0 DX
X5 04
2D 5A 52 42 Y 5A 52 04
25
Y X 0 5 Y D X 0 5 Y
2D
4 4 X5
below:

2D 5A 52 2D 5A 52 2 D 5 A 25
5Y X 5Y X 0
P4
P3
P2
P1

X5 04 5 04 4 Y5
25 2D 5A 25Y 2 D 5A 52
5Y 2 D A0
Y5 X5 04 X5 04 X5
2 5 2 5 42
Process name

A0 25 DX A0 25 DX A0 25
42 Y 5 5 4 2 Y 5 5 4 Y 5
DX
DX A0 25 DX A0 25 2 DX A0 52
52 4 2 Y 5 5 42 Y 5 5 42 5Y
A 2 2 5A
6
7

5Y DX 0 5Y DX A0 DX
10
24

4 4 5Y 04
2 2 5
Burst

5A 52 D 5A 52 D A 52 2D
X 0 5 X 0 5
Time(ms)

04 5Y Y Y X5
5
Robin(quantum=4)scheduling

2D 5A 52 42 5A 52 42
X5 04 5Y D X5 04 5Y D X5 A 04 25
25 2 D 5 A 2 2D 5 A 2 2D Y5
04 5 04 5 A0
4

Page 2 of 2
Y5 X5 Y5 X5 Y5 X5
2 A 2 2 A 2
5
3
0

25 D D
10

A0
42 Y5 X5 04 5
-------------------------------
Y5 X5 04 5 Y5
Arrival

2D A 2 2 D
Time(ms)

DX A0 25 04 5Y A0
42 Y5 X5 5 X5
52
5Y DX A0 25 2 D A 25
42
DX
42 Y5 X5 04 Y5 5
5A 52
5Y DX A0 25 2DX A0
04 4 Y 42
Paper / Subject Code: 41023 / Operating System

2D 5A 52 2D 5A 52

X525Y5A042DX525Y5A042DX525Y5A042DX525Y5A042D
X5 04 5Y X 0 4 5Y DX
2 5 5 2 5
1
2
3
5

25 DX A0 25 DX A0 52
Y5 5 42 Y 5 5 4 5Y
5
of Mobile operating system and Real time operating system?

A0 2 5Y DX A0 25Y 2DX
42 4
Priority(smaller

5A 52 2D 5A 52
5
2. Calculate average waiting time for each of the above algorithm.

What is open-source operating system? What are the design issues

no=higher priority)

DX 0 Y X 5 0 4 5Y
5
1.Draw the Gantt chart for FCFS, SJF, Priority(preemptive) , Round

42
Consider the following set of processes with their burst times given

52
5Y DX A0 25 2 DX 5A
52 4 2 Y5 5 04
5A
04 5Y DX A 04 2 5Y
2
10
10

2D 5A 52 DX 5A
X5 04 5Y 04
25 2D 5A 52 2D
Y5 X5 04 5Y X5
A0 25 2D 5A
42 Y5 X5 04
DX A0 25 2D
Y X
 6
B8
9C

7E
96
Paper / Subject Code: 41023 / Operating System

2
93
E

7A

63
6
E1

B8
9C
1T01234 - S.E.(Information Technology Engineering)(SEM-IV)(Choice Based) (R-20-21) (C Scheme)

7E
96
F5

2
93
E

7A

63
/ 41023 - Operating System QP CODE : 10028409 DATE: 15/05/2023

6
E1
3B

B8
9C

7E
96
F5
7E
Time: 3 hours Max. Marks: 80

93
E

7A
6
E1
3B
61

B8
9C
=====================================================================

96
F5
56

7E

93
E
N.B.: 1) Question No.1 is compulsory.

6
E1
3B
22

61

B8
9C

96
2) Attempt any THREE questions out of the remaining FIVE questions.

28

F5
56

7E

93
E

6
3

E1
3B
22

61
3) Figures to the right indicate full marks.

B8
9C
E6

28

F5
56

7E

93
E
4) Assume suitable data if necessary.

A7

E1
3B
22

61

9C
E6
67

28

F5
56

7E

E
A7
69
Attempt any FOUR of the following 20

E1
Q1

3B
22

61
E6
B8

67

9
28

F5
56

7E
What is the content of page table? Explain.

E
a

A7
69
93

E1
3B
22

61
E6
B8
C

67
b Compare process scheduling and process switching.

28

F5
56

7E
E9

A7
69
93

3B
22
What is Semaphore? What is its significance?

61
E1

E6
B8
C

67

28

56

7E
E9
F5

A7
Explain UNIX OS kernel.

69
93
d

22

61
E1
3B

E6
B8
9C

67

3
Explain Direct Memory Access (DMA) in detail.

28
e

56

7E
F5
7E

A7
69
93
E

22

61
E1
3B
1

E6
B8
9C

67
66

28

56
F5
7E

A7
69
93
E
25

Q.2

22
E1
3B
1

E6
B8
9C

67
82

66

28
a Consider the following snapshot of the processes: 10
F5
7E

A7
69
93
E
32

25

3
E1
3B
1

E6
B8
9C

67
E6

82

66

F5
7E

Process Burst time Arrival Priority

A7
69
93
E
A7

32

25

E1
3B
1

B8
time

9C

67
E6

82
67

66

F5
7E

69
93
E
A7

32

P1 8 0 1
69

25

E1
3B
1

B8
9C
E6
B8

82
67

66

P2 20 1 3
F5
7E

93
E
A7

32
69

25
93

P3 3 2 2

E1
3B
1

9C
E6
B8

82
9C

67

66

P4 6 3 5
F5
7E

E
A7

32
69

25
93
E

E1
3B
1

P5 12 4 4
E1

E6
B8

82
9C

67

66

F5
7E
F5

A7

32
69

25
93
E

3B
1
E1
B

E6
B8

i. Draw the Gantt chart for the execution of the processes, showing their start
82
9C

67

66
E3

7E
F5

A7

32
69

25
93
E

time and end time using FCFS, SJF (without considering the priority), priority
17

61
E1
3B

E6
B8

82
9C

67

scheduling (pre-emptive), RR (with time quantum=5),

66

56
F5
7E

A7

32
69
93
E
25

ii. Calculate turnaround time, and average waiting time and average turnaround
22
E1
3B
61

E6
B8
9C

67
82

28

time for the system.

F5
56

7E

A7
69
93
E
32

Explain with suitable example, how virtual address is converted to physical

E1

10
3B
22

61

E6
B8
C

67

b
E9
28

F5

address?
56

7E

A7
69
93
63

E1
B
22

61

B8
C

67
E3
7E

E9
28

F5
56

69
93
17

Q.3
7A

63

E1
3B
22

B8
C
66
7E

E9
28

F5

a Consider the following state of a system with four processes, P1, P2, P3, and P4, 10
96

7E

93
25
7A

63

E1
3B
61

and five types of resources, RS1, RS2, RS3, RS4, and RS5:
9C
82
7E

F5
96

56

7E

E
32
7A

E1
86

3B
22

61
E6
3B

28

F5
96

56

7E
A7

63
86

B
22
C9

61
67

E3
7E
3B

28

56
E9

69

17
7A

63

22
C9

B8

66
7E

28
96
E9

25
93

7A

63
6
E1

B8

82
9C

7E
96
F5

32
93
1E

7A
6
3B

Using the deadlock detection algorithm check deadlock is there or not? If

E6
B8
9C
5E

96
7E

A7

deadlock is there, then identify the processes that are deadlocked.

93
1E
BF

6
B8
9C

67
5E
E3

69
93
1E
BF
17

B8
9C
5E
66

E3

28409 Page 1 of 2
93
1E
BF
25

17

9C
5E
82

66

E3

1E
BF
25

17

5E
82

66

E3

82256617E3BF5E1E9C93B86967A7E632
BF
25

17
 82 7E E9 96 32
25 3B C9 7A 82
66 F5 3B 7E 25
17 E1 86 63 66
E3 E9 96 28 17
82 E3
25 BF C9
3B
7A
7E
22
56 B F5
66 5E 61
17 1E 86 63 E1
E3 9C 96 28 7E E 9C
25 BF 93 7A 22 3B
56 93

f
e
c
F5

a
a
a
7E

d
b
b
b
66 5E B8 b

Q.6
Q.5
Q.4
17 1E 63 61 E1 B8
69 E

28409
E3 9C 67 28 7E 69
BF 22 3B 9C 67
5E 93 A7 56 F5 93 A7
B8 E6 61 B8 E6
17
E3 1E 6 96 32 7E
E1
E 69 32
BF 9C 7A 82 3B 9C 67 82
5E 93 7E 25 F5 93 A7 25
B8 66 B8 E6 66
1E 6 63 17 E1 1

RAID levels
9C 96 28 E3 E 9C
69
67
32
82 7E
BF 7A 22 B 3B

demand paging.
93 93 25

Disk Scheduling
5E B8 7E 56 F5 A7 F5
61 B8 E6 66
1E 6 63 E1
E 69 1 E1

Deadlock avoidance
9C 96 28 7E 9C 32 7E E9
7A 22 3B 67 82 C

Process Control Block

93 93 A7 25 3B
56 F5 93
LRU with frame size=4,

B8 7E B8 66 F5
69 63 61 E1 E6
1 E1 B8
67 28 7E E9 69 32 7E E9 69
C 67

Real Time Operating System

A7 22 3B 82 3B C 67
56 F5 93 A7 25 F5 93 A7
E6 61 E1 B8 E6 66 B8
1 E1 E6
Write short notes on any FOUR
32 3

Necessary conditions for deadlock

82 7E E9 69 32 7E E 69 28
25 3B C 93
67
A7
82
25 3B 9C 67 22
66 F5 B8 66 F5 93 A7 56
E1 E6 B8
17
E3 E9 69 32 1 7E
E1
E 69
E6
3 61
7E
B C 67 82 3B 9C 67 28
F5 93 A7 25 93 A7 22 3B
F5 56

-----X-----
F5

Page 2 of 2
E1 B8 E6 66 B8
E 69 32 1 E1
E 69
E6
3 61 E1
9C 67 82 7E
3B 9C 67 28 7E E 9C
93 A7 25 93 A7 22 3B
B8 E6 66 F5 B8 56 F5
69 32 1 E1
E 69
E6
3 61 E1

82256617E3BF5E1E9C93B86967A7E632
67 82 7E
3B 9C 67 28 7E E 9C
A7 25 93 A7 22 3B
E6 66 F5 B8 56 F5 93
3 1 E1
E 69
E6
3 61 E1 B8
28 7E 7E E
Paper / Subject Code: 41023 / Operating System

22 3B 9C 67 28 9C
93 A7 22 3B
56 F5 56 F5 93
State features of Cloud OS. Enlist its advantages and disadvantages.

61 E1 B8 E6 61 E1 B8
7E E 9C
69 3 28 7E E 6 96
67
What is virtual memory technique? Discuss segmentation with example.

3B 22 3B 9C 7
93 A7
What is demand paging? Discuss the hardware support required to support

F5 B8 56 F5 93
E1 E6 61 E1 B8
E 69 3 7E E 6
What is Threading and Multithreading? Explain importance of Multithreading.

9C 67 28 9C 96
93 A7 22 3B 7A
56 93
2, 3, 6. Find the number of page faults with FIFO, Optimal Page Replacement and

F5
Consider the following reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1,

B8 E6 61 B8 7E
69 3 28 7E
E1
E 6 6
67 22 3B 9C 96
A7 56 93 7A
F5
20
10
10
10
10
10

E6 61 E1 B8 7E
3 28 7E E 6 96
63
2
22 3B 9C 7A
56 F5 93 7E
61 E1 B8
7E E 6 63
2
3 9 96
 4E

1
D

43
9

6F
9B

98
Paper / Subject Code: 41023 / Operating System

9A

43
DE
9E
4E

F1
E3

34
9B

98
9A

E6
98
1T01234 - S.E.(Information Technology Engineering)(SEM-IV)(Choice Base Credit Grading System )(R-

14
9E
4E
22

E3

D
2020-21)(C Scheme) / 41023 - Operating System

6F
B

98
9A
7A

98

E
E
QP CODE: 10042227 DATE: 14/12/2023.

4E
22

E3

D
8B

9
9B

8
A
7A

98
DE

E9
9

4E
22

E3
8B

B9
3D

8
9A
7A

8
DE

E9
E9
9
34
Time: 3 Hours Max. Marks: 80

22

E3
8B

B9
4
3D
4
N.B.: 1) Question No.1 is compulsory.

9A
7A
F1

98
DE

E9
34

22
6

3
2) Attempt any THREE questions out of remaining FIVE questions.

8B

A4
3D
DE

E
4

A
F1

8
DE
3) Figures to the right indicates full marks.

39
34

7
98

22
6

8B

4
3D
DE

E
4) Assume suitable data if necessary.

4
9E

9A
A
F1

8
E

29
34

B7
B

98

DD
6

E3
E9

A2
DE

4
9E

8
Q1 Answer any FOUR 20

F1

8
43

E
A4

29
B7
9B

98

D
6

43
a Explain memory fragmentation.

A2
DE
9

9E

E8
4E

F1
E3

3
b Compare process scheduling and process switching.

B7
9B

98

DD
9A

6
98

43
c Describe the implementation of file allocation techniques?

2
DE
9E

8
4E

7A
2

1
E3

43

DE
A2

6F
d Explain process state model.

9B

98
9A
98

43

8B
3D
DE
B7

Explain about IPC.

9E
e

4E
2

F1
E3

DE
A2

4
9B
E8

8
9A

6
98

3
9

3D
DE

4
B7

E
DD

4E
Q.2
2

1
E3

9
A2

34
9B
E8

8
9A

6
Explain RAID with different levels.
98

a 10
43

E9

DE

14
B7
DD

4E
2

E3
43

b What is a process? Explain Process control block in detail. 10

9
A2

6F
9B
E8

98
9A
F1

98
43

DE
B7

E
DD

4E
2
6

E3
43

9
A2
DE

Q.3

9B
E8

98
9A
F1

98
43

What are different types of process scheduling algorithms? Explain anyone 10

B7

9E
98

DD

4E
2
6

E3
43

A2
DE
9E

9B
E8

scheduling algorithm with example.

9A
F1

98
43

B7
9B

98

DD

4E
b What is a critical region? Explain necessary conditions for deadlock. 10
22
6

3
43
DE

8E
9E

E8
4E

9A
7A
F1

43

29
9B

98

DD
9A

E3
43

8B

Q.4
A2
DE
9E
4E

F1
E3

98
43

DE

a Give detail comparison of user level and kernel level threads. 10

7
9B

98
9A

22
6
98

43

8B

What is an Operating System? Explain structure of Operating System. 10

3D

b
DE
9E
4E

7A
22

F1
E3

DE
34
9B

98
9A
7A

6
98

8B
3D
DE

14
9E

Q.5
E
22

E3
8B

DE
A4

6F

34
B

98

a Explain objectives and characteristics of modern operating system. Explain 10

7A

98
DE

E9

3D
DE

14
9

9E

Network OS.
22

E3
8B

A4

6F

34
B

98
7A

98

List page replacement algorithms? Explain anyone page replacement algorithms with 10
DE

E9

DE

14
9

b
9E
22

E3
B

example.
A4
3D

6F
9B
E8

98
7A

98

DE
9
34

9E
DD

4E
22

E3
8B

Q.6 Write short notes on any FOUR 20

14

9B

98
9A
7A

98
43

DE

Deadlock recovery
6F

a
9E
4E
22

E3
43

8B
3D

b Real Time OS
9B
9A
7A
F1

98
DE
34

c Semaphores
4E
22
E6

E3
8B
3D
14

9A

d Virtual Memory
7A
8D

98
DE
6F

34

22

Android
E3

e
8B
E9

3D
DE

14

7A

98

f File Allocation Methods

DE
B9

6F

34
98

22
8B

*********************
3D
DE

14
9E

7A
DE
6F

34
B

98

8B
E9

3D
DE

14
9E

DE
A4

6F

34
9B

98

3D
DE

14
39

9E
4E

6F
8E

34
B

98
9A

E9

DE

14
9E
E3

A4

6F
9B

98

42227 Page 1 of 1
98

DE
39

9E
4E
22

8E

9B

98
9A
7A

29

9E
4E
E3
8B

A2

9B
9A
98
B7

4E
22

E3
E8

DE8B7A2298E39A4E9B9E98DE6F14343D
9A
7A

98
 C
16 2B7 7977 75C 39DDDC CAB B40 D2C C91 119
2 D 1
62 B79 9775 5C3 39D DC AB4 40D 2C 911 199 9787
B7 77 C 9D DC AB 0D 2C 91 19 78 31
B7 977 5C 39D DC AB 40D 2C 91 119 978 731 62B
9 3 1 9 7 6
79 775 5C39 9DDDCAAB4 40D 2C9 9111 1997 787 316 2B7 7977
77 C3 D C B 0D 2C 11 99 87 31 2B 97 5C
97 5C 9D D AB 40 2 91 19 78 3 62 79 75 3
7 C C 1 B
77 5C3 39D DC AB 40DD2C 911 1199 9787 731 62B 797 775C C39 9DD
5C 9D DC AB 40 2C 91 19 78 31 62 79 75 3 DD CA
5C 39D DC AB 40 D2C 91 119 978 731 62 B79 775 C3 9DD CA B4
D B 9
C3 39D DC AB 40D 2C 911 1199 9787 7316 62B 797 775C C39 DD CA B40 0D2
9D DC AB 40D 2C 911 19 78 31 2B 79 75 39 DD CA B4 D2 C9

7.
6.
5.
4.
3.
2.
1.
39 D A 40 2 91 1 97 73 62 7 77 C3 D C B 0D C 11
D C B D C 1 99 87 1 B 97 5C 9 D A 40 2 9 1

Q1.
DATE: 23/5/2022

DDDCAAB4 40D 2C9 9111 199 787 316 62B7 797 75C 39DDDC CAB B40 D2C C91 1119 9978

Option B:
Option B:
Option B:
Option B:
Option B:
Option B:

Option C:
Option C:
Option C:
Option C:
Option C:
Option C:

Option A:
Option D:
Option A:
Option D:
Option A:
Option D:
Option A:
Option D:
Option A:
Option D:
Option A:
Option D:
Option A:
CA B4 0D 2C9 111 99 787 316 2B7 97 75C 39D DC AB 40 D2C 91 119 978 731
B4 0D 2C9 111 99 787 316 2B7 97 75C 39D DC AB 40 D2C 91 119 978 731 62
0D 2C 11 99 787 316 2B 97 75C 39 D A 40 D2 91 11 97 73 62 B7
2C 911 199 78 31 2B 797 75 39 DD CA B4 D2 C9 11 997 873 162 B7 977
91 19 78 731 62B 79 75 C3 DD CA B4 0D C9 111 99 87 16 B7 97 5C

Bus
11 97 73 62 7 77 C3 9D C B 0D 2C 11 99 78 31 2B 97 75 39
99 87 16 B 97 5C 9D D AB 40 2 91 19 78 73 62 79 75 C3 D

system
78 31 2B 79 75 39 D CA 4 D2 C9 11 97 73 16 B7 77 C 9D DC
Course Code: ITC403

process.
73 62 79 77 C3 D C B 0D C 11 99 87 16 2B 97 5C 39 D A
16 B7 77 5C 9D DC AB 40 2C 91 19 78 31 2B 79 75 3 DD CA B4

Deadlock
Confusion
Time: 2 hour 30 minutes

2B 97 5C 39 D A 40 D2 9 11 97 73 62 7 77 C3 9D C B 0D

Hard drives

Ready State
79 75 39 DD CA B4 D C9 111 997 87 16 B7 977 5C 9D DC AB 40 2C
77 C3 D C B 0D 2C 11 99 87 31 2B 97 5C 39 D A 40 D2 9

Memory, Bus

Running state
5C 9D DC AB 40 2C 91 19 78 31 62 79 75 3 DD CA B4 D C9 11
39 D A 40 D2 91 11 97 73 62 B7 77 C3 9D C B 0D 2C 11 199

Suspended state

Overhead on OS
Terminated state
DD CA B4 D C9 11 99 87 16 B7 97 5C 9D DC AB 40 2C 91 19 78

Resource conflict
CA B4 0D 2C9 111 99 787 316 2B7 97 75C 39D DC AB 40 D2C 91 119 978 731

Drawback of FCFS
Processors, Memory
B4 0D 2C9 111 99 787 316 2B7 97 75C 39D DC AB 40 D2C 91 119 978 731 62
0D 2C 11 99 787 316 2B 97 75C 39 D A 40 D2 91 11 97 73 62 B7

Aging is called as------

2C 911 199 78 31 2B 797 75 39 DD CA B4 D2 C9 11 997 873 162 B7 977
91 19 78 731 62B 79 75 C3 DD CA B4 0D C9 111 99 87 16 B7 97 5C

First fit, best fit, worst fit

11 97 73 62 7 77 C3 9D C B 0D 2C 11 99 78 31 2B 97 75 39
99 87 16 B 97 5C 9D D AB 40 2 91 19 78 73 62 79 75 C3 D
78 31 2B 79 75 39 D CA 4 D2 C9 11 97 73 16 B7 77 C 9D DC
73 62 79 77 C3 D C B 0D C 11 99 87 16 2B 97 5C 39 D A
16 B7 77 5C 9D DC AB 40 2C 91 19 78 31 2B 79 75 3 DD CA B4
2B 97 5C 39 D A 40 D2 9 11 97 73 62 7 77 C3 9D C B 0D
Increasing the time of execution
79 75 39 DD CA B4 D C9 111 997 87 16 B7 977 5C 9D DC AB 40 2C
77 C3 D C B 0D 2C 11 99 87 31 2B 97 5C 39 D A 40 D2 9

Increasing the priority of a process

Decreasing the priority of a process
5C 9D DC AB 40 2C 91 19 78 31 62 79 75 3 DD CA B4 D C9 11

PCB is used to identify process area

39 D A 40 D2 91 11 97 73 62 B7 77 C3 9D C B 0D 2C 11 199
compulsory and carry equal marks

DD CA B4 D C9 11 99 87 16 B7 97 5C 9D DC AB 40 2C 91 19 78

Which one of the following is not true?

CA B4 0D 2C9 111 99 787 316 2B7 97 75C 39D DC AB 40 D2C 91 119 978 731
B4 0D 2C9 111 99 787 316 2B7 97 75C 39D DC AB 40 D2C 91 119 978 731 62
0D 2C 11 99 787 316 2B 97 75C 39 D A 40 D2 91 11 97 73 62 B7

PCB is created to store process in user area.

2C 911 199 78 31 2B 797 75 39 DD CA B4 D2 C9 11 997 873 162 B7 977

-------is generally faster than ------ and ------.

Which of the statement is true in case of PCB
91 19 78 731 62B 79 75 C3 DD CA B4 0D C9 111 99 87 16 B7 97 5C
University of Mumbai

11 97 73 62 7 77 C3 9D C B 0D 2C 11 99 78 31 2B 97 75 39
Examination May 2022

the service is completed, it goes to the------------

99 87 16 B 97 5C 9D D AB 40 2 91 19 78 73 62 79 75 C3 D
78 31 2B 79 75 39 D CA 4 D2 C9 11 97 73 16 B7 77 C 9D DC
Examination: SE Semester IV
Curriculum Scheme: Rev 2019

73 62 79 77 C3 D C B 0D C 11 99 87 16 2B 97 5C 39 D A

7873162B79775C39DDCAB40D2C911199
16 B7 77 5C 9D DC AB 40 2C 91 19 78 31 2B 79 75 3 DD CA B4

PCB is used by user to access process code and data.

Program: Information Technology

2B 97 5C 39 D A 40 D2 9 11 97 73 62 7 77 C3 9D C B 0D
79 75 39 DD CA B4 D C9 111 997 87 16 B7 977 5C 9D DC AB 40 2C
77 C3 D C B 0D 2C 11 99 87 31 2B 97 5C 39 D A 40 D2 9

Resource request is done in particular order to avoid -----

5C 9D DC AB 40 2C 91 19 78 31 62 79 75 3 DD CA B4 D C9 11
39 D A 40 D2 91 11 97 73 62 B7 77 C3 9D C B 0D 2C 11 199
DD CA B4 D C9 11 99 87 16 B7 97 5C 9D DC AB 40 2C 91 19 78
CA B4 0D 2C9 111 99 787 316 2B7 97 75C 39D DC AB 40 D2C 91 119 978 731
Max. Marks: 80

B4 0D 2C9 111 99 787 316 2B7 97 75C 39D DC AB 40 D2C 91 119 978 731 62
0D 2C 11 99 787 316 2B 97 75C 39 D A 40 D2 91 11 97 73 62 B7

kernel remains in the memory during the entire computer session

2C 911 199 78 31 2B 797 75 39 DD CA B4 D2 C9 11 997 873 162 B7 977
91 19 78 731 62B 79 75 C3 DD CA B4 0D C9 111 99 87 16 B7 97 5C
11 97 73 62 7 77 C3 9D C B 0D 2C 11 99 78 31 2B 97 75 39
99 87 16 B 97 5C 9D D AB 40 2 91 19 78 73 62 79 75 C3
78 31 2B 79 75 39 D CA 4 D2 C9 11 97 73 16 B7 77 C 9D
73 62 79 77 C3 D C B 0D C 11 99 87 16 2B 97 5C 39
16 B7 77 5C 9D DC AB 40 2C 91 19 78 31 2B 79 75 3 DD
QP CODE: 93638

2B 97 5C 39 D A 40 D2 9 11 97 73 62 7 77 C3 9D
79 75 39 DD CA B4 D C9 111 997 87 16 B7 977 5C 9D DC

PCB is created per process which is used to store relevant information about
77 C3 D C B 0D 2C 11 99 87 31 2B 97 5C 39 D
kernel is the program that constitutes the central core of the operating system
Symmetric multiprocessing architecture of computer system uses shared ------

5C 9D DC AB 40 2C 91 19 78 31 62 79 75 3 DD CA kernel is the first part of operating system to load into memory during booting
Course Name: Operating System

39 D A 40 D2 91 11 97 73 62 B7 77 C3 9D C B
Suppose that a process is in “Blocked” state waiting for some I/O service. When

DD CA B4 D C9 11 99 87 16 B7 97 5C 9D DC AB kernel is made of various modules which can not be loaded in running operating
Choose the correct option for following questions. All the Questions are

CA B4 0D 2C9 111 99 787 316 2B7 97 75C 39D DC AB 4

=====================================================================

1|Page
B4 0D 2C9 111 99 787 316 2B7 97 75C 39D DC AB 40
0D 2C 11 99 787 316 2B 97 75C 39 D A 40
2C 911 199 78 31 2B 797 75 39 DD CA B4 D
91 19 78 731 62B 79 75 C3 DD CA B4 0D
11 97 73 62 7 77 C3 9D C B 0D 2
1T01234 - S.E.(Information Technology)(Choice Based)(R-2020-21)('C' Scheme) Semester - IV / 41023 - Operating System

99 87 16 B 97 5C 9D D AB 40 2
78 31 2B 79 75 39 D CA 4 D2 C9
73 62 79 77 C3 D C B 0D C
16 B7 77 5C 9D DC AB 40 2C 91
2 9 5 3 A 4 D
 C
16 2B7 7977 75C 39DDDC CAB B40 D2C C91 119
2 D 1
62 B79 9775 5C3 39D DC AB4 40D 2C 911 199 9787
B7 77 C 9D DC AB 0D 2C 91 19 78 31
B7 977 5C 39D DC AB 40D 2C 91 119 978 731 62B
9 3 1 9 7 6
79 775 5C39 9DDDCAAB4 40D 2C9 9111 1997 787 316 2B7 7977
77 C3 D C B 0D 2C 11 99 87 31 2B 97 5C
97 5C 9D D AB 40 2 91 19 78 3 62 79 75 3
7 C C 1 B
77 5C3 39D DC AB 40DD2C 911 1199 9787 731 62B 797 775C C39 9DD
5C 9D DC AB 40 2C 91 19 78 31 62 79 75 3 DD CA
5C 39D DC AB 40 D2C 91 119 978 731 62 B79 775 C3 9DD CA B4
D B 9
C3 39D DC AB 40D 2C 911 1199 9787 7316 62B 797 775C C39 DD CA B40 0D2
9D DC AB 40D 2C 911 19 78 31 2B 79 75 39 DD CA B4 D2 C9

F
E
9.
8.

C
B
C
B

A
D
A
A
39 D A 40 2 91 1 97 73 62 7 77 C3 D C B 0D C 11

10.
D C B D C 1 99 87 1 B 97 5C 9 D A 40 2 9 1

Q. 4
Q. 3
Q. 2
DDDCAAB4 40D 2C9 9111 199 787 316 62B7 797 75C 39DDDC CAB B40 D2C C91 1119 9978

Option B:
Option B:
Option B:
Option B:

Option C:
Option C:
Option C:
Option C:

Option D:
Option A:
Option D:
Option A:
Option D:
Option A:
Option D:

CA B4 0D 2C9 111 99 787 316 2B7 97 75C 39D DC AB 40 D2C 91 119 978 731
B4 0D 2C9 111 99 787 316 2B7 97 75C 39D DC AB 40 D2C 91 119 978 731 62
0D 2C 11 99 787 316 2B 97 75C 39 D A 40 D2 91 11 97 73 62 B7
2C 911 199 78 31 2B 797 75 39 DD CA B4 D2 C9 11 997 873 162 B7 977
91 19 78 731 62B 79 75 C3 DD CA B4 0D C9 111 99 87 16 B7 97 5C

PCI
API
11 97 73 62 7 77 C3 9D C B 0D 2C 11 99 78 31 2B 97 75 39

CPU
99 87 16 B 97 5C 9D D AB 40 2 91 19 78 73 62 79 75 C3 D SCAN
LOOK

78 31 2B 79 75 39 D CA 4 D2 C9 11 97 73 16 B7 77 C 9D DC
73 62 79 77 C3 D C B 0D C 11 99 87 16 2B 97 5C 39 D A C-SCAN
C-LOOK
16 B7 77 5C 9D DC AB 40 2C 91 19 78 31 2B 79 75 3 DD CA B4
2B 97 5C 39 D A 40 D2 9 11 97 73 62 7 77 C3 9D C B 0D
79 75 39 DD CA B4 D C9 111 997 87 16 B7 977 5C 9D DC AB 40 2C
77 C3 D C B 0D 2C 11 99 87 31 2B 97 5C 39 D A 40 D2 9
5C 9D DC AB 40 2C 91 19 78 31 62 79 75 3 DD CA B4 D C9 11
39 D A 40 D2 91 11 97 73 62 B7 77 C3 9D C B 0D 2C 11 199
DD CA B4 D C9 11 99 87 16 B7 97 5C 9D DC AB 40 2C 91 19 78
CA B4 0D 2C9 111 99 787 316 2B7 97 75C 39D DC AB 40 D2C 91 119 978 731
B4 0D 2C9 111 99 787 316 2B7 97 75C 39D DC AB 40 D2C 91 119 978 731 62
0D 2C 11 99 787 316 2B 97 75C 39 D A 40 D2 91 11 97 73 62 B7
2C 911 199 78 31 2B 797 75 39 DD CA B4 D2 C9 11 997 873 162 B7 977
91 19 78 731 62B 79 75 C3 DD CA B4 0D C9 111 99 87 16 B7 97 5C
Best fit, first fit, worst fit

Worst fit, first fit, best fit

Worst fit, best fit, first fit

11 97 73 62 7 77 C3 9D C B 0D 2C 11 99 78 31 2B 97 75 39
Memory management unit

99 87 16 B 97 5C 9D D AB 40 2 91 19 78 73 62 79 75 C3 D

memory with three frames.

78 31 2B 79 75 39 D CA 4 D2 C9 11 97 73 16 B7 77 C 9D DC
73 62 79 77 C3 D C B 0D C 11 99 87 16 2B 97 5C 39 D A
16 B7 77 5C 9D DC AB 40 2C 91 19 78 31 2B 79 75 3 DD CA B4

the following statement is true?

2B 97 5C 39 D A 40 D2 9 11 97 73 62 7 77 C3 9D C B 0D
79 75 39 DD CA B4 D C9 111 997 87 16 B7 977 5C 9D DC AB 40 2C
77 C3 D C B 0D 2C 11 99 87 31 2B 97 5C 39 D A 40 D2 9
5C 9D DC AB 40 2C 91 19 78 31 62 79 75 3 DD CA B4 D C9 11
39 D A 40 D2 91 11 97 73 62 B7 77 C3 9D C B 0D 2C 11 199
DD CA B4 D C9 11 99 87 16 B7 97 5C 9D DC AB 40 2C 91 19 78
CA B4 0D 2C9 111 99 787 316 2B7 97 75C 39D DC AB 40 D2C 91 119 978 731
B4 0D 2C9 111 99 787 316 2B7 97 75C 39D DC AB 40 D2C 91 119 978 731 62

Differentiate between process and threads.

0D 2C 11 99 787 316 2B 97 75C 39 D A 40 D2 91 11 97 73 62 B7

The waiting time for the process P5 is 0 ms

2C 911 199 78 31 2B 797 75 39 DD CA B4 D2 C9 11 997 873 162 B7 977

The waiting time for the process P5 is 23 ms

The waiting time for the process P5 is 44 ms
91 19 78 731 62B 79 75 C3 DD CA B4 0D C9 111 99 87 16 B7 97 5C
11 97 73 62 7 77 C3 9D C B 0D 2C 11 99 78 31 2B 97 75 39 The waiting time for the process P5 is 10 ms
99 87 16 B 97 5C 9D D AB 40 2 91 19 78 73 62 79 75 C3 D

resource allocation graph determines a deadlock.

What is virtual memory? Mention its advantages.

78 31 2B 79 75 39 D CA 4 D2 C9 11 97 73 16 B7 77 C 9D DC

Explain about Resource Allocation Graph (RAG).

73 62 79 77 C3 D C B 0D C 11 99 87 16 2B 97 5C 39 D A

7873162B79775C39DDCAB40D2C911199
16 B7 77 5C 9D DC AB 40 2C 91 19 78 31 2B 79 75 3 DD CA B4
2B 97 5C 39 D A 40 D2 9 11 97 73 62 7 77 C3 9D C B 0D
end, the direction is reversed and servicing continues.

Solve any Four Questions out of Six, 5 marks each

79 75 39 DD CA B4 D C9 111 997 87 16 B7 977 5C 9D DC AB 40 2C
77 C3 D C B 0D 2C 11 99 87 31 2B 97 5C 39 D A 40 D2 9
5C 9D DC AB 40 2C 91 19 78 31 62 79 75 3 DD CA B4 D C9 11

Solve any Two Questions out of Three, 10 marks each

Solve any Two Questions out of Three, 10 marks each
39 D A 40 D2 91 11 97 73 62 B7 77 C3 9D C B 0D 2C 11 199

Explain about file attributes, file operations, and file types.

DD CA B4 D C9 11 99 87 16 B7 97 5C 9D DC AB 40 2C 91 19 78
CA B4 0D 2C9 111 99 787 316 2B7 97 75C 39D DC AB 40 D2C 91 119 978 731
B4 0D 2C9 111 99 787 316 2B7 97 75C 39D DC AB 40 D2C 91 119 978 731 62
0D 2C 11 99 787 316 2B 97 75C 39 D A 40 D2 91 11 97 73 62 B7
2C 911 199 78 31 2B 797 75 39 DD CA B4 D2 C9 11 997 873 162 B7 977
91 19 78 731 62B 79 75 C3 DD CA B4 0D C9 111 99 87 16 B7 97 5C
memory status after memory request for sizes 95, 180, 285, 380, 30.
11 97 73 62 7 77 C3 9D C B 0D 2C 11 99 78 31 2B 97 75 39

What are the various objectives and functions of Operating Systems?

99 87 16 B 97 5C 9D D AB 40 2 91 19 78 73 62 79 75 C3
78 31 2B 79 75 39 D CA 4 D2 C9 11 97 73 16 B7 77 C 9D

following Disk scheduling algorithms. (a)FCFS (b)SSTF (c) C- SCAN

73 62 79 77 C3 D C B 0D C 11 99 87 16 2B 97 5C 39

What are various features of Mobile and Real Time Operating Systems?
Consider the page reference string 1,2,3,5,2,4,5,6,2,1,2,3,7,6,3,2,1,2,3,6.
16 B7 77 5C 9D DC AB 40 2C 91 19 78 31 2B 79 75 3 DD Give the explanation of necessary conditions for deadlock. Explain how a

Suppose the head of a moving disk with 200 tracks, numbered 0 to 199, is
Calculate the Page fault using 1. Optimal 2. LRU 3. FIFO algorithms for a

175, 130. What is the total head movement to satisfy these requests for the
2B 97 5C 39 D A 40 D2 9 11 97 73 62 7 77 C3 9D
79 75 39 DD CA B4 D C9 111 997 87 16 B7 977 5C 9D DC
In the ______ algorithm, the disk arm starts at one end of the disk and moves

77 C3 D C B 0D 2C 11 99 87 31 2B 97 5C 39 D
Run time mapping from virtual to physical address is done by ____________

sizes 400,180, 100,300,45. Assuming First fit and Best fit method indicate the

Currently serving a request at track 143 and has just finished a request at track
5C 9D DC AB 40 2C 91 19 78 31 62 79 75 3 DD CA
the above process being scheduled with the SJF scheduling algorithm, which of

39 D A 40 D2 91 11 97 73 62 B7 77 C3 9D C B
milliseconds. Process Burst time P1- 24, P2- 3, P3- 7, P4- 13, P5- 21. Assuming

DD CA B4 D C9 11 99 87 16 B7 97 5C 9D DC AB
toward the other end, servicing requests till the other end of the disk. At the other

Consider the following set of processes, the length of the CPU burst time given in

125. If the queue of requests is kept in FIFO order: 86, 147, 91, 177, 94, 150, 102,
What is Internal fragmentation? Explain static partitioned allocation with partition

CA B4 0D 2C9 111 99 787 316 2B7 97 75C 39D DC AB 4

2|Page
B4 0D 2C9 111 99 787 316 2B7 97 75C 39D DC AB 40
0D 2C 11 99 787 316 2B 97 75C 39 D A 40
2C 911 199 78 31 2B 797 75 39 DD CA B4 D
91 19 78 731 62B 79 75 C3 DD CA B4 0D
11 97 73 62 7 77 C3 9D C B 0D 2
99 87 16 B 97 5C 9D D AB 40 2
78 31 2B 79 75 39 D CA 4 D2 C9
73 62 79 77 C3 D C B 0D C
16 B7 77 5C 9D DC AB 40 2C 91
2 9 5 3 A 4 D
 C
16 2B7 7977 75C 39DDDC CAB B40 D2C C91 119
2 D 1
62 B79 9775 5C3 39D DC AB4 40D 2C 911 199 9787
B7 77 C 9D DC AB 0D 2C 91 19 78 31
B7 977 5C 39D DC AB 40D 2C 91 119 978 731 62B
9 3 1 9 7 6
79 775 5C39 9DDDCAAB4 40D 2C9 9111 1997 787 316 2B7 7977
77 C3 D C B 0D 2C 11 99 87 31 2B 97 5C
97 5C 9D D AB 40 2 91 19 78 3 62 79 75 3
7 C C 1 B
77 5C3 39D DC AB 40DD2C 911 1199 9787 731 62B 797 775C C39 9DD
5C 9D DC AB 40 2C 91 19 78 31 62 79 75 3 DD CA
5C 39D DC AB 40 D2C 91 119 978 731 62 B79 775 C3 9DD CA B4
D B 9
C3 39D DC AB 40D 2C 911 1199 9787 7316 62B 797 775C C39 DD CA B40 0D2
9D DC AB 40D 2C 911 19 78 31 2B 79 75 39 DD CA B4 D2 C9

C
B
39 D A 40 2 91 1 97 73 62 7 77 C3 D C B 0D C 11
D C B D C 1 99 87 1 B 97 5C 9 D A 40 2 9 1
DDDCAAB4 40D 2C9 9111 199 787 316 62B7 797 75C 39DDDC CAB B40 D2C C91 1119 9978
CA B4 0D 2C9 111 99 787 316 2B7 97 75C 39D DC AB 40 D2C 91 119 978 731
B4 0D 2C9 111 99 787 316 2B7 97 75C 39D DC AB 40 D2C 91 119 978 731 62
0D 2C 11 99 787 316 2B 97 75C 39 D A 40 D2 91 11 97 73 62 B7
2C 911 199 78 31 2B 797 75 39 DD CA B4 D2 C9 11 997 873 162 B7 977
91 19 78 731 62B 79 75 C3 DD CA B4 0D C9 111 99 87 16 B7 97 5C
11 97 73 62 7 77 C3 9D C B 0D 2C 11 99 78 31 2B 97 75 39
99 87 16 B 97 5C 9D D AB 40 2 91 19 78 73 62 79 75 C3 D
78 31 2B 79 75 39 D CA 4 D2 C9 11 97 73 16 B7 77 C 9D DC
73 62 79 77 C3 D C B 0D C 11 99 87 16 2B 97 5C 39 D A
16 B7 77 5C 9D DC AB 40 2C 91 19 78 31 2B 79 75 3 DD CA B4
2B 97 5C 39 D A 40 D2 9 11 97 73 62 7 77 C3 9D C B 0D
79 75 39 DD CA B4 D C9 111 997 87 16 B7 977 5C 9D DC AB 40 2C
77 C3 D C B 0D 2C 11 99 87 31 2B 97 5C 39 D A 40 D2 9
Around Time.

5C 9D DC AB 40 2C 91 19 78 31 62 79 75 3 DD CA B4 D C9 11
39 D A 40 D2 91 11 97 73 62 B7 77 C3 9D C B 0D 2C 11 199
DD CA B4 D C9 11 99 87 16 B7 97 5C 9D DC AB 40 2C 91 19 78
CA B4 0D 2C9 111 99 787 316 2B7 97 75C 39D DC AB 40 D2C 91 119 978 731
B4 0D 2C9 111 99 787 316 2B7 97 75C 39D DC AB 40 D2C 91 119 978 731 62
0D 2C 11 99 787 316 2B 97 75C 39 D A 40 D2 91 11 97 73 62 B7
2C 911 199 78 31 2B 797 75 39 DD CA B4 D2 C9 11 997 873 162 B7 977
91 19 78 731 62B 79 75 C3 DD CA B4 0D C9 111 99 87 16 B7 97 5C
11 97 73 62 7 77 C3 9D C B 0D 2C 11 99 78 31 2B 97 75 39
99 87 16 B 97 5C 9D D AB 40 2 91 19 78 73 62 79 75 C3 D
78 31 2B 79 75 39 D CA 4 D2 C9 11 97 73 16 B7 77 C 9D DC
73 62 79 77 C3 D C B 0D C 11 99 87 16 2B 97 5C 39 D A
16 B7 77 5C 9D DC AB 40 2C 91 19 78 31 2B 79 75 3 DD CA B4
2B 97 5C 39 D A 40 D2 9 11 97 73 62 7 77 C3 9D C B 0D
79 75 39 DD CA B4 D C9 111 997 87 16 B7 977 5C 9D DC AB 40 2C
77 C3 D C B 0D 2C 11 99 87 31 2B 97 5C 39 D A 40 D2 9
5C 9D DC AB 40 2C 91 19 78 31 62 79 75 3 DD CA B4 D C9 11
39 D A 40 D2 91 11 97 73 62 B7 77 C3 9D C B 0D 2C 11 199
DD CA B4 D C9 11 99 87 16 B7 97 5C 9D DC AB 40 2C 91 19 78
CA B4 0D 2C9 111 99 787 316 2B7 97 75C 39D DC AB 40 D2C 91 119 978 731
B4 0D 2C9 111 99 787 316 2B7 97 75C 39D DC AB 40 D2C 91 119 978 731 62
0D 2C 11 99 787 316 2B 97 75C 39 D A 40 D2 91 11 97 73 62 B7
2C 911 199 78 31 2B 797 75 39 DD CA B4 D2 C9 11 997 873 162 B7 977
91 19 78 731 62B 79 75 C3 DD CA B4 0D C9 111 99 87 16 B7 97 5C
11 97 73 62 7 77 C3 9D C B 0D 2C 11 99 78 31 2B 97 75 39
Dining philosopher is solved using semaphores?

99 87 16 B 97 5C 9D D AB 40 2 91 19 78 73 62 79 75 C3 D
78 31 2B 79 75 39 D CA 4 D2 C9 11 97 73 16 B7 77 C 9D DC
73 62 79 77 C3 D C B 0D C 11 99 87 16 2B 97 5C 39 D A

7873162B79775C39DDCAB40D2C911199
16 B7 77 5C 9D DC AB 40 2C 91 19 78 31 2B 79 75 3 DD CA B4
2B 97 5C 39 D A 40 D2 9 11 97 73 62 7 77 C3 9D C B 0D
79 75 39 DD CA B4 D C9 111 997 87 16 B7 977 5C 9D DC AB 40 2C
77 C3 D C B 0D 2C 11 99 87 31 2B 97 5C 39 D A 40 D2 9
5C 9D DC AB 40 2C 91 19 78 31 62 79 75 3 DD CA B4 D C9 11
39 D A 40 D2 91 11 97 73 62 B7 77 C3 9D C B 0D 2C 11 199
DD CA B4 D C9 11 99 87 16 B7 97 5C 9D DC AB 40 2C 91 19 78
CA B4 0D 2C9 111 99 787 316 2B7 97 75C 39D DC AB 40 D2C 91 119 978 731
B4 0D 2C9 111 99 787 316 2B7 97 75C 39D DC AB 40 D2C 91 119 978 731 62
0D 2C 11 99 787 316 2B 97 75C 39 D A 40 D2 91 11 97 73 62 B7
2C 911 199 78 31 2B 797 75 39 DD CA B4 D2 C9 11 997 873 162 B7 977
91 19 78 731 62B 79 75 C3 DD CA B4 0D C9 111 99 87 16 B7 97 5C
11 97 73 62 7 77 C3 9D C B 0D 2C 11 99 78 31 2B 97 75 39
99 87 16 B 97 5C 9D D AB 40 2 91 19 78 73 62 79 75 C3
78 31 2B 79 75 39 D CA 4 D2 C9 11 97 73 16 B7 77 C 9D
73 62 79 77 C3 D C B 0D C 11 99 87 16 2B 97 5C 39
16 B7 77 5C 9D DC AB 40 2C 91 19 78 31 2B 79 75 3 DD
Consider the First come First serve (FCFS), Non Preemptive Shortest Job

2B 97 5C 39 D A 40 D2 9 11 97 73 62 7 77 C3 9D
79 75 39 DD CA B4 D C9 111 997 87 16 B7 977 5C 9D DC
Consider the following five processes, with the length of the CPU burst time
given in milliseconds. Process Burst time is P1-10, P2-29, P3-3, P4-7,P5-12.

What is semaphore and its types? How the classic synchronization problem -

77 C3 D C B 0D 2C 11 99 87 31 2B 97 5C 39 D
5C 9D DC AB 40 2C 91 19 78 31 62 79 75 3 DD CA
39 D A 40 D2 91 11 97 73 62 B7 77 C3 9D C B
the scheduling using Gantt chart. Calculate the Average Waiting Time and Turn
First(SJF), Round Robin(RR) (quantum=10ms) scheduling algorithms. Illustrate

DD CA B4 D C9 11 99 87 16 B7 97 5C 9D DC AB
CA B4 0D 2C9 111 99 787 316 2B7 97 75C 39D DC AB 4

3|Page
B4 0D 2C9 111 99 787 316 2B7 97 75C 39D DC AB 40
0D 2C 11 99 787 316 2B 97 75C 39 D A 40
2C 911 199 78 31 2B 797 75 39 DD CA B4 D
91 19 78 731 62B 79 75 C3 DD CA B4 0D
11 97 73 62 7 77 C3 9D C B 0D 2
99 87 16 B 97 5C 9D D AB 40 2
78 31 2B 79 75 39 D CA 4 D2 C9
73 62 79 77 C3 D C B 0D C
16 B7 77 5C 9D DC AB 40 2C 91
2 9 5 3 A 4 D