Search This Blog

Wednesday, December 8, 2010

System Software(630005) Mid sem exam paper

Que. 1

(A) Select correct option for below question and justify your selection. (no justification – no marks)

10

(a) Which type of driver is used for accessing Hard Disk?

1) Block 2) Character

(b) An organization uses an employee code which is obtained by concatenation the section id of an employee, which is alphabetic in nature, with a numeric code. The structure of employee code can be specified as

1)

::= l | <> l

::= d| d

::= <>

2) ::=l | d | l| d

3) 1) and 2) both are correct.

(c) For storing Expansion variables and values which data structure is better?

1) EVT with (EV name, value) fields

2) EVNTAB with (name) field and EVTAB with (value) field.

(d) Which type of loader is used by .COM files of DOS?

1) Absolute loader

2) Relocatable loader

(e) For evaluation of expression (a+b) / (c+d) which operation should perform first so that fewer MOVEM/MOVER instructions required in generated code.

1) (a+b)

2) (c+d)

3) Any one of above

(B) Define following terms.

a. PFG

b. AIF statement.

c. Hypertext

d. YACC

04

Que 2(a)

1. Differentiate between character device driver and block device driver.

2. Write a note on debug monitor.

04

03

Que 2(b)

Explain architecture of 8088 microprocessor in detail.

07

OR

Que 2(b)

Explain data structure and algorithm of pass – 1 of an assembler.

07

Que 3.

(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

Show the content of the symbol table and intermediate code at end of pass – 1.

(b) 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.

07

07

OR

Que 3.

(a) Given the following program:

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-1.

(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

07

07

Que 4.

(A) What is Optimizing Transformations? Explain all with suitable example.

(B) Define operator precedence parsing? Parse the following string giving the Diagrammatic trace of the algorithm.

a * b + c * d

07

07

OR

Que 4.

(A) Explain allocation and access of local and non-local variable for a block structured language with example.

(B) Write a note on LL(1) Parser.

(C) Write a naïve top down parsing algorithm.

07

04

03

Que 5.

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

Prog Address

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

(B) Explain overlays for linker.

(C) Write a note on absolute loader.

07

04

03

OR

Que 5.

(A) Write an algorithm for program linking with data structure used by linker.

(B) A compiler typically generates a .OBJ file, which is later converted into .EXE or a .COM File.

Clearly describe the difference between the three files.

(C) Write a note on self relocating programs.

07

03

04

Wednesday, December 1, 2010

System Software(630005) Mid sem exam paper

B H Gardi College of Engineering and Technology

MID Semester Examination – Nov 2010

Subject: (630005) System Software Date: 19/11/2010

Total Marks: 30 Sem/Branch: M.C.A - 3rd

Student Id No.______________ Time: 08:30 to 09:30 am

Instructions: (if applicable)

(1) Digits to the right indicate full marks.

(2) Draw neat & clean diagrams.

(3) Assume suitable data whenever necessary.

(4) Start new question from new page.

---------------------------------------------------------------------------------------------------------------------

Q 1.

Given the following program:

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-1

06

Q 2.

(a) Write note on LL(1) parser

(b) Explain the entry format for the macro name table(MNT).

OR

(b) Explain following assembler directives:

i) ORIGIN ii) EQU iii) EXTERN

03

03

03

Q 3

Given the following macro definition :

MACRO

CLR &X, &N, &REG= AREG

LCL &M

&M SET 0

MOVER &REG, =’0’

.MOVE MOVEM &REG, &X + &M

&M SET &M +1

AIF (&M NE &N) .MOVE

MEND

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

CLR ABC, 10

06

OR

Q 3

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

a. A macro?

b. A sub-routine?

b) If you have given following grammar:

<> = <><>

<> = <> <>

<> = <><>

<> = a | an | the

<> = boy | apple

<> = ate

IF the input string is “the boy ate an apple” then performs reduction operation stepwise.

03

03

Q 4

Explain data structure and algorithm for pass 1 of an assembler.

06

OR

Q 4

Explain the architecture of 8088 microprocessor with registers and memory management.

06

Q 5

Explain allocation and access of local and non-local variable for a block structured language.

06

OR

Q 5

What do you understand by operator precedence parsing? Parse the following string giving the Diagrammatic trace of the algorithm.

<> + <> * <>

06

-: Best of Luck :-