Tuesday, November 16, 2010

MCA Question Paper

Gujarat University

MCA Semester III

System Software

Date: Friday, 18th January, 2002 Marks:50

Instructions: 1. Answer both section In separate answer-books.

2. If necessary make assumptions and state clearly.

3. Symbols used have their usual meaning.

SECTION I

Q-l. Attempt any THREE of the following. [9]

a) Discuss the problems encountered during single pass assembly. Suggest the alternative method

clearly. .

b) What do you mean by system programming? Explain different type system software in brief.

c) Write the advantages of overlay techniques.

d) List the differences between character device drivers, and block device drivers.

Q-2 Draw the flowchart or state the algorithm of PASS-I of the assembler and explain it. [8]

OR

Q-2 Write a macro which takes A,B,C and D as a parameter and calculate D =A*(B+C). By using the macro

processor generate all the data structures for it.

Q-3. Attempt any TWO of the following. [8]

a) Give your comments on the validity of the following statements.

· Self relocating programs are more efficient than relocatable programs in all respects.

· If all programs are coded as self relocating programs, there would be no need of linkage editors.

b) Explain the function of the following command code routines.

Driver initialization , Media check , BPB, Generic IOCTL

c) Describe the architecture of 8088 series or microprocessor in detail.

SECTION-II

Q-4. (a)Discuss the problem of deletion of entries in the following symbol table organizations. [8]

• sequential search organization.

• Linked list organization.

(b) Explain the working principle of first pass of linker with example.

Q-5 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

{

g = w;

b = 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, (c) Constant propagation.

(b) Dead code elimination, (d) Frequency reduction.

OR

Q-5. What do you understand by operator precedence parsing. Parse the following string giving the [8]

Diagrammatic trace of the algorithm.

* + *

Q-6 Attempt any THREE of the following [9]

a) Write the classification of grammer.

b) A compiler typically generates a .OBJ file, which is later convened into .EXE or a .COM File.

Clearly describe the difference between the three files.

c) Explain the structure of Activation record for dynamic memory allocation.

d) Write the complete sequence of steps involved in dynamic debugging of a program.

System Software Old Question Paper

Gujarat University

MCA Semester III

System Software

Date: 17^th January, 2001 Marks:50

Instructions:

1. Answers to the two sections should be written in separate answer books.

2. Make necessary assumptions wherever necessary.

Section I

Q-1 Given the following program: [9]

START 300

ID1 DS 5

L1 MOVER AREG, D

ADD AREG, C

SUB AREG, ID2

MOVEM AREG, ID1

D EQU ID2

L2 PRINT D

ORIGIN ID1-1

C DC ‘9’

ORIGIN L2+1

STOP

ID2 DC ‘13’

END L1

Show the contents of symbol table and intermediate code at the end of pass-i.

Q-2 a) Give general algorithm of bottom-up parsing. Also give the trace of the algorithm giving suitable examples.

b) Compare and contrast recursive decent parsing with LL(1) parsing. What grammar forms are acceptable to each of these? [8]

OR

Q-2 a) Describe the architecture of the Intel 8088. [8]

b) Given the following macro definition :

MACRO

CLEARMEN &X, &N, &REG= AREG

LCL &M

&M SET 0

MOVER &REG, =’0’

.MORE MOVEM &REG, &X + &M

&M SET &M +1

AIF (&M NE N) . MORE

MEND

Show the contents of the data structures deployed by the macro-processor for the call.

CLEARMEN AREA, 10

Q-3 Write short notes on the following (any two): [8]

a) Language processor development tools

b) Hash table organization

c) Debugger

d) Grammar for language specification

Section II

Q-4 a) Describe the structure of an MS-DOS device driver. [9]

b) What is the difference between character-device driver and block-device driver.

Q-5 a) Describe the compilation of the expression giving suitable examples. [8]

b) Compare and contrast the following parameter passing mechanisms in terms of execution efficiency and power to produce side effects:

i) call by value result

ii) call by reference

iii) call by name

OR

Q-5 a) What do you understand by code optimization? How can control and data flow analysis can help in global optimization. [8]

b) Explain the structure of the stack structured symbol table.

Q-6 a) What are Translated origin, linked origin and Load origin? Explain. Explain the relocation and linking

requirements in segmented addressing. [8]

OR

Q-6 a) Give general algorithm for linking. [8]

b) Compare and contrast the following:

i) Absolute loaders

ii) Relocating loaders

iii) Direct linking loaders

MCA System Software 2000

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

Input string is : - +

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

(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:

Gujarat University MCA System Software

Gujarat University

MCA Semester III

System Software

Date:4-1-1999 Marks:50

Instructions:

1. Figures to the right indicate full marks.

2. Symbols used have their usual meaning.

3. If necessary, make assumptions & state clearly.

4. Answers to each section must be written in separate answer-book.

Section I

Q-1 Attempt the following: [3]

a) What do you mean by system programming? Explain different types of system software in brief.

b) As assembler designer is presented with the following two design alternatives: [3]

1. Constitute a single OPTAB to contain entries for mnemonics of imperative, declarative and assembler directive statements of the assembly language.

2. Constitute three different tables to contain mnemonics of:

i) imperatives ii) declaratives and iii) assembler

Which of the two alternatives would you recommend to the designer? Clearly justify your answer.

c) Explain the major parts of Device- driver (Any two parts) [4]

Q-2 Attempt the following:

a) Discuss the problems encountered during the single pass assembly. [6]

b) Suppose an object module contains three programs A,B and C. If they are located at following addresses

Prog Address [4]

A 200-250

B 302-370

C 480-533

Assume the load address is 300 for the executable A, B and C to be generated.

Find: i) Load origin of each program

ii) Relocation factor for each program

c) Suppose ten users are using the UNIX system simultaneously. Discuss what happens when compiler is

stored in a system library as either of following form: [5]

i) As a non-relocatable program

ii) As a relocatable program

iii) As a self relocating program

OR

Q-2 Attempt the following:

a) Draw flow-chart or state the algorithm of PASS-I of the assembler and explain it. [9]

b) Write the advantages of overlay technique. [3]

c) Explain following assembler directives: [3]

i) ORIGIN ii) EQU iii) EXTERN

Section II

Q-3 Attempt the following:

a) In an assembly language program, a certain action is required at 10 places in the program. Under what

conditions would you code this action as [3]

i) A macro?

ii) A sub-routine?

b) Write the major difference of nested between top-down parsing and bottom-up parsing. [3]

c) Explain the expansion of nested macro call with example. [4]

Q-4 Attempt the following:

a) Discuss the lexical analysis & syntax analysis phase of a compiler. [5]

b) Write the differences between formal parameters, keyboard parameters and actual parameters. [3]

OR

Q-4 Attempt the following:

Write a macro which takes A,B, C and D as a parameters and calculates D =A*(B+C). By using this macro

generate data structure for it. [8]

Q-5 Attempt the following:

a) Write the classification of a grammar [3]

b) Explain the static and dynamic allocation with example. [4]

OR

Q-5 Attempt the following: [7]

Write advantages of block structured language. Explain allocation and access of local and non-local variable

for a block structured language.

System Software Question Paper

Gujarat University

MCA Semester III

System Software

Date: January, 1998 Marks:50

Instructions:

1. Answers to the two sections should be written in separate answer books.

2. Figure to the right indicates full marks.

3. If necessary makes assumptions & state clearly.

4. Symbols used have their usual meaning.

Section I

Q-1 Attempt following:

a) Explain how execution of an HLL program will be carried out as the system software view.

b) In an assembly language program, a certain action is required at 10 places in the program. Under what conditions would you code this action as i) A macro? ii) a subroutine? Justify your answer with the help of appropriate example.

c) Discuss the characteristics of device drivers.

Q-2 Attempt following:

a) The following program is FED to the assembler

START 500

WX DS 5

K1 LOAD YY

ADD MM

STORE PP

PP EQU WX+1

K2 PRINT PP

ORIGIN WX+2

MM DC ‘8’

ORIGIN K2 +1

STOP

YY DC ‘35’

END

i) Show the content of the symbol table at the end of pass 1.

ii) Explain the significance of EQU and ORIGIN statements in the above program and explain how they are processed by the assembler.

b) Discuss the difference between assembly, machine and HLL.

OR

b) Explain the detail about chained overflow organization.

OR

Q-2 Attempt the following:

a) Draw the flow chart or state the algorithm of pass-II of the assembler and explain it.

b) Discuss the problem of deletion of entries in the sequential, search organisation.