GUJARAT UNIVERSITY
M.C.A. SEMESTER III
SUB: SYSTEM SOFTWARE
Date: 5-1-2000 Marks:50
SECTION-I
Q.1 Attempt following:
A) Discuss the problem of deletion of entries in the following symbol [03]
table organization
1. Sequential search organization
2. Linked list organization.
B) List the extension of all the files generated during the processing of [04] assembly language program. Clearly describe the difference between them.
C) Attempt following: [03]
1.Show the importance of strategy routine in device driver.
2.State the main features of block device driver.
Q.2 Attempt following:
A) Fed any assembly language program of your choice to the two [11]
pass assembler and show the step by step procedure how pass-1
and pass-2 will process your assembly language program.
B) Differentiate following terms: [04]
1. Translation and Linking .
2. Low –level language and High –level language.
********OR********
Q.2 Attempt following:
A) Write 8086/8088 program to multiply two 16-bit numbers. Which [05]
type problem occur if ASSUME statement is not present in your program.
B) The execution time requirement of linkage editor rue is determined [05]
By the number of object modules and the number of external symbols to
be processed. In a particular situation it was found that programs A. B and C all reference each other. Thus, they are always required as a group. It is
therefore desired to make a single object module out of three objects
modules A,B and C. Device A scheme which will merge these object
modules. Clearly explain the kind of processing required to be performed
on the RELOCTABs and LINKTABs.
C) Explain working principle of first pass of linker with example. [05]
SECTION-2
Q.3 Attempt following:
A) Apply LL(L) program for following grammar [03]
E=T – E | T
T=V + T | V
V=<id>
Input string is : <id> - <id> + <id>
B) How the definition of Nested Macro Call is stored in MDT. [04]
Explain with example.
C) Write the differences between static and dynamic storage allocation. [03]
Q.4 Draw flow-chart or write algorithm for one pass macro [08]
Pre-processor. Which type of modifications would you apply to convert your flow-chart or algorithm so that it should provide the facilities of Macro Assembler.
********OR********
Q.4 Build a program flow graph for the following program.
Z=5;
W=Z;
For (i=1;i<=100;i++)
{
x=a*b;
y=c+d;
if(y>0)
{
a=25;
f=c+d;
}
else
{
c=W;
h=a*b+f;
d=Z+10;
}
g=c+d;
printf(“g=%d h=%d d=%d x=%d y=%d “,g,h,d,x,y);
Apply the following transformation to optimize the program
(a) Common sub expression elimination
(b) Dead code elimination
(c) Constant propagation
(d) Frequency reduction
Q.5 Attempt following: (ANY TWO)
A) Write the complete sequence on steps involved in dynamic debugging
Of a program.
B) Explain synthesis phase of compiler with example.
C) How expansion time variables are useful in Macro Definition?
Explain with example:
