Questions on System Programming

Please download to get full document.

View again

of 4
All materials on our website are shared by users. If you have any questions about copyright issues, please report us to resolve them. We are always happy to assist you.
Document Description
Questions on System Programming
Document Share
Documents Related
Document Tags
Document Transcript
  Following is the list of the repeatedly asked questions on System Programming. UNIT –I Q-1.1 Draw and explain the general machine structureQ-1.! hat do you mean #y system programming $xplain the components of system programming.Q-1.% $xplain the terms&i.' (ssem#lerii' )icroprocessoriii' *ompileri+' ,nterpreter+' *ross compiler+i' oaderQ-1. (nswer the following&-i' hy should we use #ase register/ index register and displacement format for the formation of addressii' hy the technique address modification using instruction as data is a #ad programming techniqueiii' 0i+e the difference #etween (2 and 3S,40/ D* and $Q3.i+' hy is it #etter to use 5620 pseudo 6P #efore the D* and DS pseudo 6P $xplain.Q-1.7 $xplain operating system user +iewpoint as #atch control language.Q-1.8 $xplain the different functions of operating system UNIT-II Q-!.1. 0i+e the data#ases used #y pass-1 and pass-! of assem#ler.Q-!.!. Draw and explain the detailed flowchart for pass-! of a two-pass assem#ler.Q-!.%. $xplain the pro#lems faced #y a one-pass assem#ler.Q-!.. $xplain in detail with a suita#le example/ the formats and contents of data#ases used in assem#ler design.Q-!.7. ist different instruction format for ,) %89:%;9 machine with example.Q-!.8 hat is the difference #etween&-i' Procedure and programii' 5raffic *ontroller and Scheduler6pen Su#routine and *losed Su#routine.Q-!.; $xplain the pro#lems faced #y a one-pass assem#ler. <ow can we o+ercome with the pro#lems faced #y the one pass assem#lerQ-!.= $xplain with example different data formats of ,) %89:%;9 system. Q-!.> Define the followingi' $xecution time.ii' *ompile time.Q-!.19 $xplain the meaning of following instruction of ,) %89.(2/ $Q3/ 5620/ D*/ DS. hat restrictions are enforced on assem#ler while processing 5620/ DS/ D* instructions. UNIT-III Q-%.1 0i+e the entries in sym#ol ta#le/ literal ta#le/ and #ase ta#le at the end of pass-1 and pass-! of the assem#ler. (lso gi+e the code at the end of each passP260 1 S5(25 9(2 17/93S,40 ?/172 7/17< 1/D(513S,40 ?/192 1D(5 ! D* F@11@ D(5 1 D* <@!!@ 52S D* <@!!@ *A DS F(( $Q3 1  DD $Q3 !(2 !/93S,40 ?B ((/52S( ;/C(*A'2 8D* <@8@ D26P D >/(D(5 1'( >/C(D(51'5620S5 >/CF@99@ $4DQ-!.! rite a machine language program to add the contents of !9 adEacent full words in memory to the num#er 79 under following set of assumptions1' 5he program is in core at a#solute location =!' 5he !9 adEacent full words are starting at a#solute location >99%' 5he num#er 79 to #e added is at a#solute location =>8%' 5he num#er !9 is at a#solute location =>!' 2egister 4o. 1 contains >99Q-%.% for the following assem#ly program show &-i' 5he )D5ii' 5he )45 and5he expanded assem#ly language program.)(*26S562$  (4SS5 1/ (4S)$4D )(*26P$2F62)  (DD/  D$S5S2 1/1)(*26 (DD (/  1/ (( 1/  )$4DD$S5 DS F)$4D(2,5< S5(25 93S,40 ?/ 17P$2F62) P3S/2$S35P3S 43)1/43)!S562$ 2$S3543)1 D* F G@ 43)! D* F G7@ $4DQ-%. $xplain )acro call within macro definition with suita#le example.Q-%.7 Draw flow charts for macro call within macro. (lso explain it.Q-%.8 Define macro and explain the features of macro facility pro+ide #y the macro language of ,) %89:%;9.Q-%.; 0i+e the data#ase required for the two pass microprocessor. UNIT IV Q-.1 $xplain a#solute loader scheme with its ad+antages and disad+antages.Q-.! hat are different loading schemes $xplain with example.Q-.% hat do you mean #y dynamic loading Q-. $xplain the use of )D* and )D, in the algorithm for single pass macro definition within macro.Q-.7 0i+e the entries in )45/ (( and D)5 for the following definition and call&-)(*26  6P254  macnm/ op)(*26 macnm (/  1/ (6P 1/ S5 1/)$4D)$4D& .D(5( 1 D* F G19@ D(5$ ! D* F G11@ D(5( % D* F G!9@ & 6P254 (DD (6P254 S34 S&(DD D(5(1/ D(5(!&S3 D(5(1/ D(5(%&$4DQ-.; $xplain the different functions of loader.Q-.= 0i+e the +arious data structures in the design of pass-1 and pass-! of a 5wo-pass direct linking loader.Q-.> Different loading scheme.Q-.19 rite short notes on i' Dynamic oading ii' Dynamic inking UNIT V Q-7.1 $xplain functional modularity of programming language.Q-7.! 0i+e general model of compiler.Q-7.% Descri#e in #rief features of high le+el language.Q-7. 0i+e details a#out $SD/5H5/2D and $4D cards.Q-7.7 $xplain in #rief i' 0$S5ii' $S(Q-7.8 rite short notes on (synchronous operation.Q-7.; $xplain the following address constantsi' (#solute ii' Simple re-locata#le*omplex re-locata#le.Q-7.= *onsider the following program segmentsP0 1 S5(25$452I SI) 11$H524 P0 !/ SI) !%D* (P0('/ (P0 B 'SI) 11 D* (SI) 11-P0 1'/ SI) !% JP0 !'$4DP0 ! S5(25$452I SI) !%$H524 P0 1/ SI) 11SI) !1 D* (SI) 11-!'/(SI) !1'SI) !! D* (P0 !B'/(SI) !1 JP0 !'SI) !% D* (SI) !1 JP0 1'$4D(ssume these two programs are to #e loaded starting at location !99 in order P0 1 and P0 !. Fill the 0$S5 for each sym#ol. (lso gi+e the $SD and 2D card entries for the a#o+e program segments.  Q-7.> $xplain in #rief the ad+antages of using high le+el languages o+er that of (ssem#ly languages.Q-7.19 $xplain what do you mean #y functional modularity of programming languages.Q-7.11 rite short note on (synchronous operation. UNIT VI Q-8.1 hat are the differences #etween&-i' Passes and Phases of compilerii' Syntax analysis and Semantic analysis5okens and 3niform sym#ol.Q-8.! $xplain in detail the phases of compiler.Q-8.% $xplain the following terms and differentiates #etween.i' Phase and pass.ii' )ultitasking and multiprogramming.Q-8. 0i+e the important features of higher le+el language.Q-8.7 $xplain what do you mean #y functional modularity of programming languages. Q-8.8 $xplain in #rief the ad+antages of using high le+el languages o+er that of assem#ly languages.Q-8.; rite short note on (synchronous operation.Q-8.= hat is the difference #etween&-i' Passes and phases of compilerii' Syntax analysis and semantic analysis5okens and 3niform sym#ol.Q-8.> $xplain in detail the phases of compiler.Q-8.19 $xplain in #rief the ad+antages of using high le+el languages o+er that of (ssem#ly languages.Q-8.11 $xplain what do you mean #y functional modularity of programming languages.Q-8.1! rite short note on (synchronous operation.Q-8.1% $xplain the parameter passing mechanisms in <igh le+el languages.Q-8.1 $xplain in detail phases of compiler.Q-8.17 Descri#e in #rief features of high le+el language.Q-8.18 $xplain in detail phases of compiler.
We Need Your Support
Thank you for visiting our website and your interest in our free products and services. We are nonprofit website to share and download documents. To the running of this website, we need your help to support us.

Thanks to everyone for your continued support.

No, Thanks