Total No. of Questions : 10] SEAT No.

8
-23
P3631 [5560]-587
[Total No. of Pages : 3

tic
T.E. (Computer Engineering)

sta
SYSTEM PROGRAMMING AND OPERATING SYSTEM

:56
(2015 Course) (Semester - II)

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

13
30
Instructions to the candidates:

19
01
1) Solve 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.
2) /20
Neat diagrams must be drawn wherever necessary.
.23 GP
1 /05
CE
82

Q1) a) What is system software? Explain any four System software’s in brief?[5]

8
23
ic-
b) Draw a neat flowchart of Pass-I of two pass macro processor and explain
16

tat
it. [5]
8.2

6s
.24

2:5
OR
91
49

3:4
Q2) a) What is absolute loader? Explain design of absolute Loader with suitable
30
91

example and flowchart, also show text card and transfer card for same.
01
01

[6]
5/2
GP

b) Write lex program to recognize identifiers, numbers, keywords and

1/0

relational operators used in “C” program? [4]

CE
82

8
-23
.23

tic
16

sta
Q3) a) Draw a general model of compiler and explain all phases in brief. [6]
8.2

:56
.24

b) Differentiate between Static and Dynamic link libraries? [4]

01 91
:42
49

13
0

OR
1/0 13

Q4) a) Explain formats of ESD, RLD, TXT and END cards with respect to
8 2 P0
5/2

direct linking loader with suitable example? [6]

G

b) Justify use of Macro name table(MNT) in macro processor? Explain

CE

different fields of MNT with suitable example? [4]

.23
16
8.2
.24

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

8
-23
for the following processes using Priority based (non-preemptive)
scheduling and SJF (preemptive) scheduling policies. [6]

tic
sta
(Consider Low no. as high priority)

:56
Processes Arrival time Burst Time Priority

91
:42
P1 0 8 1

13
30
P2 0 6 2

19
01
P3 2 1 3
/20
P4 3 2 0
.23 GP
/05

b) What is operating system? Draw and explain layered approach with

1
CE
82

advantages and disadvantages. [6]

8
23
c) What is deadlock? Explain deadlock recovery methods? [6]

ic-
16

tat
OR
8.2

6s
Q6) a) What are the types of schedulers? Explain them with suitable diagram?[8]
.24

2:5
91
49

b) Explain process control block in detail. [6]

3:4
30
91

c) What is real time OS? Explain its types with suitable examples? [4]
01
01
5/2
GP

Q7) a) What is TLB? Explain in brief. [5]

1/0
CE
82

b) Compare fixed and variable sized partitioning. [3]

8
-23
.23

c) What is the need of page replacement policies in virtual memory

tic
16

management? Consider given page sequence 2,3,2,1,5,2,4,5,3,2,5,2 and

sta
8.2

the size of the frame is 3. Show the output of FIFO, LRU and Optimal,
:56

also count page faults for each algorithm. [8]

.24

01 91
:42
49

OR
13
0

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

1/0 13

example. [4]
8 2 P0
5/2

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

G

c) Given a memory partitions of 100K, 500K, 200K, 300K and 600K (in
CE

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

processes of size 212K, 417K, 112K, 426K (in order)? Which also makes
16

the most efficient use of memory. [6]

8.2
.24

[5560]-587
49

2
Q9) a) Write a note on free space management. [4]

8
-23
b) Consider the disk access requests given as 53, 98, 183, 37, 122, 14, 124,

tic
65, 67 where starting head position is - 53. Calculate average seek time

sta
using FCFS, SSTF, SCAN and C-SCAN disk scheduling policies and
show which policy performs better? [12]

:56
91
:42
OR

13
30
Q10)a) Define following terms with respect to disk access : [3]

19
01
i) Seek time /20
.23 GP
/05
ii) Rotational Latency
1
CE

iii) Data transfer time

82

8
23
b) Explain directory structure with its types, also discuss directory,

ic-
implementation in detail. [7]
16

tat
8.2

6s
c) What are the file access methods? Explain them in detail. [6]
.24

2:5
91
49

3:4
30
91
01
01

t t t
5/2
GP
1/0
CE
82

8
-23
.23

tic
16

sta
8.2

:56
.24

01 91
:42
49

13
0
1/0 13

9
8 2 P0
5/2
G
CE
.23
16
8.2
.24

[5560]-587
49