Code: AC08 / AT08                                                                     Subject: SYSTEM SOFTWARE

Time: 3 Hours                                                                                                     Max. Marks: 100

 

NOTE: There are 9 Questions in all.

Flowchart: Alternate Process: DECEMBER 2007

·      Question 1 is compulsory and carries 20 marks. Answer to Q. 1. must be written in the space provided for it in the answer book supplied and nowhere else.

·      Out of the remaining EIGHT Questions answer any FIVE Questions. Each question carries 16 marks.

·      Any required data not explicitly given, may be suitably assumed and stated.

 

 

Q.1       Choose the correct or best alternative in the following:                                         (2x10)

     

             a.   Table that is  used to look up mnemonic operation codes and translate them to their machine language equivalents is 

 

                   (A)   Parse Table.                                (B)  Symbol Table.

                   (C)   Program Table.                           (D)  Operation Code Table.

 

             b.   Processing the string of tokens to determine the statement class (control statement, assignment, etc.,) is

 

                   (A)  Syntax analysis.                            (B)  Lexical analysis.

                   (C)  Semantic analysis.                         (D)  Code analysis.

 

             c.   Combining of two or more separate object programs and supplies the information needed to allow references between them is

 

                   (A)  Loading.                                       (B)  Linking.

                   (C)  Compiling.                                    (D)  Binding.

 

             d.   The following is the management of CPU by switching context among various competing processes according to some scheduling policy

 

                   (A)  Memory management                   (B)  Process scheduling

                   (C)  I/O scheduling                              (D)  All of the above                                            

 

             e.   Recursive descent parsing is an example of  

 

                   (A)  Shift-reduce parsing.                     (B)  Bottom-up parsing.

                   (C)  Left-to-left parsing.                       (D) Top-down parsing.

 

             f.    The following executes a source program directly, instead of translating it into machine code

 

                   (A)  Interpreter                                    (B)  Compiler

                   (C)  Preprocessor                                (D)  P-code compiler

 

             g.   In immediate addressing mode target address becomes the

 

                   (A)  displacement                                (B)  operator

                   (C)  operand                                       (D)  offset

 


             h.   One problem common to all general purpose dynamic storage allocation techniques is

 

                   (A)  Thrashing                                     (B)  Relocation partition

                   (C)  Memory fragmentation                  (D)  Cohesion                                                                   

 

             i.    The following reference of a program entity is a reference to the entity which precedes its definition in the program

 

                   (A)  Backward                                    (B)  Forward                           

                   (C)  External                                        (D)  Formal

 

             j.    Payroll program is an example of

 

                   (A)  Text editor                                   (B)  DBMS                                                          

                   (C)  Memory management                   (D)  Systems software

 

 

 

Answer any FIVE Questions out of EIGHT Questions.

Each question carries 16 marks.

 

 

  Q.2     a.   Explain two-level and three-level scheduling systems used in job scheduling.                       (8)

 

             b.   Explain recursive invocation of procedure using  the following:                             (8)

                   (i)  Static storage allocation

                   (ii) Automatic storage allocation.                                                                                                                                                                                                                                                                                                                                                                                                                   

 

  Q.3     a.   Explain the following assembler directives and give an example :                        (10)

(i)   START

(ii)  END

(iii) BYTE

(iv) WORD

(v)  RESB

 

             b.   Explain machine dependent assembler features.                                                   (6)

                                                                                                                                                

  Q.4     a.   Explain how loading and calling of a subroutine using dynamic linking is done.                     (4)

 

             b.   Explain the functionality of Linkage Editor and Linking Loader.                           (4)

 

             c.   Explain machine independent loading features.                                                    (8)

 

  Q.5     a.   Explain the design of macro processors.                                                            (8)

            

             b.   Explain the following                                                                                         (8)

(i)  Macro prototype  and macro expansion

(ii) Nested macro calls                        

 

 

  Q.6     a.   Explain various types of addressing modes.                                                         (8)

 

             b.   Compare RISC and CISC systems.                                                                   (4)

 

             c.   Define grammar and give an example.   (4)

 

  Q.7     a.   Distinguish machine independent compiler features and machine dependent compiler features.                                                                    (8)

 

             b.   Explain interpreter  and  P-Code compilers                                                         (8)

 

  Q.8     a.   Explain how interrupt processing is handled by operating system                         (8)

 

             b.   Explain the following                                                                                          (8)

                   (i)  Virtual machine operating system

                   (ii) Distributed Operating systems

 

  Q.9     a.   Explain the functionality of Object Oriented System Design.                                (8)

 

             b.   Explain the following:                                                                                          (8)

(i)   Data Manipulation Language

(ii)  Query Language

(iii) Schema

(iv) Data Independence