Total No. of Questions: 8] SEAT No.

8
23
P270 [6003]-348
[Total No. of Pages : 2

ic-
tat
T.E. (Computer Engineering)

9s
SYSTEM PROGRAMMING & OPERATING SYSTEM

8:1
(2019 Pattern) (Semester-I) (310243)

02 91
0:2
0
Time : 2½ Hours] [Max. Marks : 70

31
0/0 13
Instructions to the candidates:
1) Attempt Q.1 or Q.2, Q.3 Q.4, or Q.5 or Q.6, Q.7 or Q.8.
0
6/2
2) Figures to the right indicate full marks.
.23 GP

3) Neat diagram must be drawn wherever necessary.

4) Assume suitable data if necessary.
E
81

8
C

23
Q1) a) Explain “General loading scheme (using suitable diagram)” with

ic-
16

tat
advantages and disadvantages? [9]
8.2

9s
b) Give complete design of Direct Linking Loader? [9]
.24

8:1
91
49

0:2
OR
30
31

Q2) a) Give complete design of Absolute Loader with suitable example? [9]
01
02
6/2
GP

b) What is the need of DLL? Differentiate between Dynamic and static link-
0/0

ing? [9]
CE
81

8
23
.23

ic-
16

tat
Q3) a) Explain the following types of Schedulers. [9]
8.2

9s
.24

8:1

i) Short Term
91
49

0:2

ii) Long Term

30
31
01

iii) Medium Term

02
6/2
GP

b) Explain seven state process model with diagram? Also explain difference
0/0

between Five state process model & Seven state process model? [8]
CE
81
.23

OR
16
8.2
.24

P.T.O.
49
Q4) a) Draw Gantt chart and calculate Avg. turnaround time, Avg. waiting time

8
23
for the following process using SJF non preemptive and round robin

ic-
with time quantum 0.5 Unit [9]

tat
Process Burst Time Arrival Time

9s
P1 2 10

8:1
02 91
P2 1 10

0:2
P3 1 11

0
31
P4 0/0 13 1 12
b) What is mean by Threads, Explain Thread lifecycle with diagram in
0
6/2
.23 GP

detail? [8]
E
81

8
Q5) a) Write a short note on following with example? [9]
C

23
i) Semaphore ii) Monitor iii) Mutex

ic-
16

tat
b) Explain Deadlock prevention, deadlock avoidance, deadlock detection,
8.2

9s
deadlock recovery with example? [9]
.24

8:1
OR
91
49

0:2
30
31

Q6) a) Explain producer Consumer problem & Dining Philosopher problem with
01
02

solution? [9]
6/2

b) What is deadlock? State and explain the conditions for deadlock, Explain
GP
0/0

them with example? [9]

CE
81

8
23
Q7) a) Consider page sequence 2, 3, 2, 1, 5, 2, 4, 5, 3, 2, 5, 2 and discuss
.23

ic-
working of following page replacement policies Also count page faults.
16

tat
8.2

(use no. of Frames = 3) [8]

9s
.24

i) FIFO
8:1
91

ii) LRU
49

0:2
30

b) Discuss fixed Partitioning and Dynamic Partitioning in detail. [9]

31

OR
01
02

Q8) a) Write a short note on following with diagram [8]

6/2
GP

i) VM with Paging
0/0

ii) VM with Segmentation

CE
81

b) Explain Page Table structure and Inverted page Table? [9]

.23
16


8.2
.24
49

[6003]-348 2