63

D
1
98
49
Paper / Subject Code: 38974 / Operating System

49

C9
CA
51
C7

8C

63
96
1T01874 - S.E.(Computer Science & Engineering (Artificial Intelligence and Machine Learning))(Choice

9D
91
D7

19

CA
74

C4
Based)(R-2019-20)('C' Scheme) Semester - IV / 38974 - Operating System

3C
65
8B

7C

91
98
QP CODE: 10027598 DATE: 17/05/2023

A6
49
66

BD

C4
51
C7

1C
51

96

98
68

D7

49
6A
Duration: 3hrs [Max Marks: 80]

74

51
16

8C
8B
57

7C

96
A5

49
19
9D

66

74
BD
N.B.: (1) Question No 1 is Compulsory.

76

8C
65
51

7C
3C
(2) Attempt any three questions out of the remaining five.

D5

68

49

19
6A

BD
A6

16

C7
C9
(3) All questions carry equal marks.

65
57
1C

A5

68

49
D7
63
(4) Assume suitable data, if required and state it clearly.

9D

16
49

76

C7
CA

8B
3C

A5
8C

D5

49
D7
66
91

A6
1 Attempt any FOUR [20]

19

76

C7
C9

8B
51
C4

1C
65

D5

D7
63

6A

66
98
a Differentiate between monolithic and microkernel.
49

49

C9
CA

8B
51
51

57
C7

8C

63
b What is the critical section problem? Mention three conditions that must be

6A
96

9D

66
91
D7

19

CA
74

51
C4

57
satisfied by its solution.

3C
65

68
8B

7C

6A
9D
91
98

A6
c 49
Explain different types of thread in Operating System

16
66

BD

C4
51

57
3C
C7

1C

A5
51

96

9D
98
d Explain external fragmentation with example

A6
68

D7

49

76
6A

74

51

3C
16

1C
8C

D5
8B
57

7C
e Give different file access methods

96
A5

A6
49
19

C9
9D

66

74
BD
76

1C
8C
65
2 a What are system calls? Explain different types of system calls with example. [10]
51

63
7C
3C

D5

68

49

49
19
6A

CA
BD
A6

16

b Explain Deadlock and how to prevent it? [10]

C7
C9

8C
65
57

91
1C

A5

68

49
D7
63

19
9D

3 a Consider the following set of processes. [10]

C4
16
49

76

C7
CA

65
8B
3C

98
A5
8C

D5

49
D7
66
91

A6

51
19

76

C7
C9

8B
51
C4

96
1C
65

D5

D7
63

6A

66
98

74
49

49

C9
CA

8B
51
51

57

7C
C7

8C

63

6A
96

9D

66
91

BD
D7

19

CA
74

51
C4

57
3C
65

68
8B

7C

6A
9D
91
98

A6
49

16
66

BD

C4
51

57

1. Draw Gantt chart for FCFS, SJF(Preemptive) and Round Robin (Quantum=2).
3C
C7

1C

A5
51

96

9D
98

A6
68

2. Also calculate average waiting time and turnaround time for above scheduling
D7

49

76
6A

74

51

3C
16

1C
8C

D5
8B

algorithms.
57

7C

96
A5

A6
49
19

C9
66

74
BD

b Explain how producer consumer problem can be solved using semaphore. [10]
76

1C
8C
65
51

63
7C
D5

68

49

49
19
6A

4 a Explain the role of PCB. [10]

CA
BD
16

C7
C9

8C
65
57

91
A5

68

b Consider the following page reference string: 4,3,2,1,4,3,5,4,3,2,1,5. Assume [10]

49
D7
63

19
9D

C4
16
76

C7
CA

65
8B

frame size=3.How many page faults would occur for FIFO, Optimal and LRU
3C

98
A5
D5

49
D7
66
A6

51

algorithm?
76

C7
C9

8B
51

96
1C

D5

5 a How can Resource Allocation Graph be used to detect deadlock in the system? [10]
D7
63

6A

66

74
49

C9
CA

8B
51
57

7C

b Explain the concept of segmentation with an example. [10]

8C

63

6A
9D

66
91

BD
19

CA

51
C4

6 a Write a short note on file directory structure. [10]

57
3C
65

68
6A
9D
91
98

A6

16

b Suppose that a disk drive has 200 Cylinders, numbered 0 to 199. Queue = 98, 183, [10]
C4
51

57
3C
1C

A5
96

9D

41, 122, 14, 124, 65, 67. The drive is currently serving a request at cylinder 54 and
98

A6
49

76
74

51

3C

the previous request was at cylinder 20.Find total number of head movements
1C
8C

D5
7C

96

A6
49
19

C9

needed to satisfy the requests for the FCFS, SSTF and SCAN disk scheduling
74
BD

1C
8C
65

63
7C

algorithm?
49

49
19

CA
BD

C7

8C

************
65

91
68

49
D7

19

C4
16

C7

65
8B

98
A5

49
D7
66

27598
51
76

C7
8B
51

96
D7
6A

66

74

576A51668BD7C74965198C491CA63C9D
8B
51
57

7C