Total No. of Questions : 8] SEAT No.

8
23
PA-1443 [Total No. of Pages : 2

ic-
[5926]-59

tat
T.E. (Computer Engineering)

4s
SYSTEM PROGRAMMING & OPERATING SYSTEM

5:1
02 91
(2019 Pattern) (Semester - I) (310243)

3:4
0
31
Time : 2½ Hours] 6/0 13 [Max. Marks : 70
0
Instructions to the candidates:
1/2
.23 GP

1) Attempt Q1 or Q2, Q3 or Q4, Q5 or Q6 and Q7 Q8.

2) Figures to the right indicate full marks.
E
81

3) Neat sketches must be drawn wherever necessary.

8
C

23
4) Assume suitable data if necessary.

ic-
16

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

4s
advantages and disadvantages? [9]
.24

5:1
b) Give complete design of Direct Linking Loader? [9]
91
49

3:4
OR
30
31

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

b) What is the need of DLL? Differentiate between Dynamic and static

1/2

linking? [9]
GP
6/0

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

CE
81

8
i) Short Term

23
.23

ii) Long Term

ic-
16

tat
iii) Medium Term
8.2

4s

b) Explain seven state process model with diagram? Also explain difference
.24

5:1

between Five state process model & Seven state process model? [8]
91
49

OR
3:4
30

Q4) a) Draw Gantt chart and calculate Avg. turnaround time, Avg. Waiting time
31

for the following processes using SJF non preemptive and round robin
01
02

with time quantum 0.5 Unit. [9]

1/2
GP

Process Burst Time Arrival Time

6/0

P1 2 10
CE
81

P2 1 10
.23

P3 1 11
16

P4 1 12
8.2

b) What is meant by Threads, Explain Thread lifecycle with diagram in

detail? [8]
.24
49

P.T.O.
Q5) a) Write a short note on following with example? [9]

8
23
i) Semaphore

ic-
tat
ii) Monitor

4s
iii) Mutex

5:1
02 91
b) Explain Deadlock prevention, deadlock avoidance, deadlock detection,

3:4
deadlock recovery with example? [9]

0
31
6/0 13 OR
0
Q6) a) Explain producer Consumer problem & Dining Philosopher problem
1/2
.23 GP

with solution? [9]

E

b) What is deadlock? State and explain the conditions for deadlock, Explain
81

8
C

23
them with example? [9]

ic-
16

tat
8.2

4s
Q7) a) Consider page sequence 2, 3, 2, 1, 5, 2, 4, 5, 3, 2, 5, 2 and discuss
.24

5:1
working of following page replacement policies. Also count page faults.
91
(use no. of frames = 3) [8]
49

3:4
30

i) FIFO
31
01
02

ii) LRU
1/2
GP

b) What is meant by Fragmentation, Explain Buddy Systems Fragmentation

6/0

in detail? [9]
CE
81

8
OR

23
.23

Q8) a) Write a short note on following with diagram

ic-[8]
16

tat
i) VM with Paging
8.2

4s
.24

5:1

ii) VM with Segmentation

91
49

3:4

b) Given the memory partition of size 100K, 500K, 200K, 300K, 600K,
30

how would each of the First Fit, Best Fit, Worst Fit algorithm place the
31

processes of 212K, 417K, 426K. Which algorithm makes the most

01
02

efficient use of memory? [9]

1/2
GP
6/0
CE
81


.23
16
8.2
.24

[5926]-59
49