Total No. of Questions : 8] SEAT No.

8
23
P-7539 [Total No. of Pages : 2

ic-
tat
[6180]-47

0s
T.E.(Computer Engineering)

7:1
02 91
SYSTEM PROGRAMMING AND OPERATING SYSTEM

9:3
0
30
(2019 Pattern) (Semester - I) (310243)
4/1 13
Time : 2½ Hours] [Max. Marks : 70
0
2/2
.23 GP

Instructions to the candidates :

1) Attempt Q. No. 1 or Q. No. 2, Q. No. 3 or Q. No. 4 , Q. No. 5 or Q. No. 6 and
E

Q.No 7 or Q.No 8.
80

8
C

23
2) Neat diagrams must be drawn wherever necessary.

ic-
3) Figures to the right indicate full marks.
16

4) Assume suitable data, if necessary.

tat
8.2

0s
Q1) a) Explain in brief Compile and Go loading scheme. What are advantages
.24

7:1
and disadvantages of it. [10]
91
49

9:3
30
30

b) Describe the concept of DLL? How dynamic linking can be done with or
01
02

without import. [8]

2/2

OR
GP
4/1
CE
80

Q2) a) Write short notes on : [10]

8
23
.23

i) Subroutine Linkage
ic-
16

tat
ii) Overlays
8.2

0s

b) With the help of diagram explain General Loading Scheme. [8]

.24

7:1
91
49

9:3

Q3) a) List different types of Operating Systems? Describe any two of them.[9]
30
30
01
02

b) Differentiate Preemptive and non preemptive scheduling. [8]

2/2
GP

OR
4/1
CE

Q4) a) What is time quantum and its significance in Round robin scheduling.[9]
80
.23
16

b) Explain multithreaded mode and Process Control block in detail. [8]

8.2
.24
49
 8
Q5) a) What is semaphore? Justify how semaphore is used to solve critical section

23
problem. [10]

ic-
tat
0s
b) Explain necessary conditions for occurrence of deadlock. [8]

7:1
OR

02 91
9:3
0
Q6) a) Explain hardware approach for Mutual Exclusion with its advantages and

30
4/1 13
disadvantages. [10]
0
2/2
.23 GP

b) Write a solution to Reader Writer problem using Semaphore with Readers

E
80

8
have priority. [8]
C

23
ic-
16

tat
8.2

Q7) a) Given a memory partitions of l00K, 500K, 200K, 300K and 600K (in

0s
order), how would each of the first fit, best fit and worst fit algo. Place
.24

7:1
91
processes of size 212K, 417K, 112K, 426K (in order)? Which also makes
49

9:3
the most efficient use of memory. [9]
30
30
01
02
2/2

b) What is internal fragmentation? Explain same with suitable diagram/

GP

example. [8]
4/1
CE
80

8
OR

23
.23

ic-
Q8) a) Write and explain Deadlock Avoidance Bankers Algorithm. [9]
16

tat
8.2

0s
.24

7:1

b) Compare Paging and Segmentation with the help of example. [8]

91
49

9:3
30
30

  
01
02
2/2
GP
4/1
CE
80
.23
16
8.2
.24

[6180]-47 2
49