Compare user-centric view and system-centric view of system software.
[3 marks]Enlist levels of System Software. Explain any two in detail.
[4 marks]Define Language Processing. List various phases of Language Processor. Explain each phase in detail.
[7 marks]Explain the causes of Large Semantic Gap.
[3 marks]An assembly program contains the statement X EQU Y+25 Indicate how the EQU statement can be processed if
[4 marks]Yis a back reference
[ marks]Yis a forward reference.
[ marks]Given the source program: START 100 A DS L1 MOVER AREG, B ADD AREG, C MOVEM AREG, D D EQU A+1 L2 PRINT D ORIGIN A-1 C DC ‘5’ ORIGIN L2+1 STOP B DC ‘19’ END L1
[3 marks]Show the contents of the symbol table at the end of Pass I.
[ marks]Explain the significance of EQU and ORIGIN statement in the program and explain how they are processed by the assembler.
[ marks]Show the intermediate code generated for the program.
[ marks]Differentiate one pass and two pass assembler. Explain how forward references are handled in two pass assembler.1
[7 marks]Compare and contrast the properties of macros and subroutines with respect to following: 1. Code space requirements 2. Execution speed
[3 marks]Explain use of AIF and AGO with example.
[4 marks]Define a macro taking starting_location and Nas parameters to find summation of all Nnumbers stored at location starting from starting_location. The result is to be stored at starting_location.
[7 marks]Explain the use of expansion time loop.
[3 marks]Explain macro definition and call in detail.
[4 marks]Define a Macro taking Aand Bas parameters to compute A=A*B+B*B+A*B.
[7 marks]Explain linking of overlay structured program.
[3 marks]Explain Compile-and-Go loaders with example.
[4 marks]Write and explain an algorithm for first pass of a linker.
[7 marks]Explain absolute loader with suitable example.
[3 marks]Draw the flow chart for the dynamic linking.
[4 marks]With algorithm and example, explain how relocation is performed by linker?
[7 marks]Discuss dead code elimination method with suitable example.
[3 marks]Explain JVM in detail.
[4 marks]Define Simple Phrase and Handle. Using Handle and Simple Phrase trace the bottom up parsing algorithm. Grammar is : E →T+ E | T – E | T T → T *V | T / V | V V→a | b | c | d String is : a - b * c + d
[7 marks]Discuss the limitations of stack based memory allocation.
[3 marks]Explain classification of debuggers.
[4 marks]Construct optimized DFA for following Regular Expression. (1*)*0(0|1)*#
[7 marks]