Total No. of Questions : 10] SEAT No.

8
23
P2995 [Total No. of Pages : 2

ic-
[5669]-587

tat
3s
T.E. (Computer Engg.)

7:2
01 91
SYSTEMS PROGRAMMING AND OPERATING SYSTEM

9:4
0
(2015 Pattern)

90
Time : 2½ Hours] 8/1 13 [Max. Marks : 70
0
1/2
Instructions to the candidates:
.23 GP

1) Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8., Q.9 or Q.10.
E

2) Figures to the right indicate full marks.

81

8
C

23
ic-
Q1) a) What is the need of symbol table (ST) and literal table (LT) in two pass
16

tat
assembler? Explain fields of ST and LT with suitable example. [4]
8.2

3s
b) Draw a neat flowchart of single pass macro processor and explain it. [6]
.24

7:2
91
OR
49

9:4
Q2) a) Explain working of Binary Symbolic Subroutine (BSS) loader with
30
90

example. [6]
01
01

b) Differentiate between compiler and interpreter? [4]

1/2
GP
8/1

Q3) a) What is LEX tool? Explain working of LEX with suitable diagram and
CE
81

8
example. [4]

23
.23

ic-
b) Explain following terms : [6]
16

tat
i) Overlay Structures
8.2

3s

ii) Absolute Loader

.24

7:2
91

iii) Pass structure of two pass assembler

49

9:4

OR
30
90

Q4) a) Draw and explain flowchart of Pass-I of two pass assembler with
01
01

suitable example. [6]

1/2
GP

b) What is interpreter? Explain components of interpreter. [4]

8/1
CE
81

Q5) a) What is operating system? Explain services offered by operating

.23

system. [6]
16

b) What is deadlock? Write and explain deadlock avoidance algorithm. [5]

8.2
.24

P.T.O.
49
 c) What is pre-emptive scheduling? Consider following example and apply

8
23
round robin scheduling policy and calculate average turnaround(TT) time

ic-
(consider Time slice=1). [6]

tat
Process ID Arrival Time Service Time

3s
A 0 3

7:2
01 91
B 2 6

9:4
C 4 4

0
90
D 8/1 13 6 5
0
E 1/2 8 2
.23 GP

OR
Q6) a) Draw and explain five state model of process states. [6]
E
81

8
C

23
b) Explain deadlock avoidance algorithm with suitable example. [7]

ic-
c) Compare thread and process. [4]
16

tat
8.2

3s
Q7) a) What is swapping? Explain it with suitable diagram or example. [5]
.24

7:2
91
b) Consider given page sequence 2, 3, 2, 1, 5, 2, 4, 5, 3, 2, 5, 2 and the size
49

9:4
of the frame is 3. Show the output of FIFO and Optimal, also count page
30
90

faults. [6]
01
01

c) Explain variable size partitioning with its advantages and drawbacks. [6]
1/2
GP

OR
8/1

Q8) a) What is eternal fragmentation? Explain same with suitable diagram/

CE
81

8
example. [5]

23
.23

ic-
b) What is virtual memory? Explain Paging with example. [6]
16

tat
c) Explain first fit, best fit and worst fit algorithm with suitable example.[6]
8.2

3s
.24

7:2

Q9) a) What is file system? Explain file system implementation in brief. [8]
91
49

9:4

b) What is I/O Buffering? Explain its type in detail. [8]

30
90

OR
01
01

Q10)a) Explain following concepts : [8]

1/2
GP

i) Disk Access Methods

8/1

ii) Directory Structure

CE
81

b) Write a detail note on organization of I/O function. [8]

.23
16


8.2
.24

[5669]-587 2
49