DipIETE – CS (OLD SCHEME)

 

Code: DC14                                 Subject: SYSTEM SOFTWARE & OPERATING SYSTEMS

Flowchart: Alternate Process: JUNE 2009Time: 3 Hours                                                                                                     Max. Marks: 100

 

NOTE: There are 9 Questions in all.

·      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 the best alternative in the following:                                  (210)

     

a.       Which of the following translator program converts assembly language program to object program?

 

                   (A)  Assembler                                    (B) Compiler

                   (C)  Macroprocessor                           (D) Linker

       

b.      Spooling is most benefited in a multiprogramming environment where

 

(A)     most jobs are CPU bound          

(B)  most jobs are I/O bound

(C)  jobs are evenly divided as I/O bound and CPU bound

(D)  there is limited primary memory and need for secondary memory

            

             c.   A system program that combines the separately compiled modules of a program into a form suitable for execution

                                    

(A)    Assembler                                    (B) Linker loader

(C) Cross compiler                              (D) Load and go

 

             d.   The final output produced by the linker is frequently called

                                                                                                                                                                                                                                                                                         

(A)  load module                                 (B)  relocatable object code

(C)  Source code                                (D)  intermediate code

 

             e.   Which of the following can be accessed by transfer vector approach of linking

                  

(A)     External data segments                

(B)  External subroutines

(C)  Data located in other procedures

(D)  All of the above

 

             f.    A task in a blocked state

 

(A)     is executable                               

(B)  is running

(C)  must still be placed in the run queues

(D)  is waiting for same temporarily unavailable resources

 

 

             g.   The file structure that redefines its first record at a base of zero uses the term

 

(A)     relative organization                      (B) blocking

(C)  ISAM file                                     (D) Sequential file

 

             h.   The dynamic allocation at storage areas with VSAM file is accomplished by

 

(A)    hashing                                         (B) control splits

(C) overflow areas                               (D) relative recording

 

             i.    Semaphores

 

(A)   synchronize critical resources to prevent deadlock      

(B)  synchronize critical resources to prevent contention

(C) are used to I/O                             

(D)    are used for memory management

 

             j.    Access time is highest in the case of

 

(A)    floppy disk                                   (B)  cache

(C)  swapping devices                         (D)  magnetic disk

 

 

 

 

 

 

 

Answer any FIVE Questions out of EIGHT Questions.

Each question carries 16 marks.

 

 

  Q.2     a.   Define grammar? Explain different types of grammars?                                        (8)

 

             b.   Explain how Assembly language simplify the programming? Explain the different kind of statements which can be present in an assembly program       (8)

 

  Q.3     a.   What are self relocating programs explain?                                                         (8)

 

             b.   Explain how interpretation is beneficial with example. Explain ‘pure’ and ‘impure’ interpreters.                                                                   (6)

 

c.       Name any 2 allocation data structures. (2)

 

  Q.4     a.    Explain the term “memory allocation”. Explain static and dynamic memory allocation.                      (8)

       

             b.   What is a macro preprocessor? Explain and show diagrammatically the schematic of a macro preprocessor.                                                                                                                        (4)

       

             c.   What do the following regular expressions mean

                   (i)                                                 (ii)

                   (iii)                                               (iv)                                              (4)

                  

  Q.5     a.   Define multiprogramming and explain the architectural features required in a multiprogramming system?                                                                  (8)

 

             b.   What is a text editor? Explain diagrammatically the structure of an editor.            (6)

 

             c.   What is a process state? Name the fundamental states of a process.                    (2)          

 

  Q.6     a.   Discuss any two methods of allocating non-contiguous disk space, assuming directory entry of a file contains the space allocation implementation.                                                                   (6)

            

             b.   Find the average waiting time using FCFS, SJF, and Round Robin Scheduling algorithms for the following problem. All the jobs enter simultaneously in the given order.                                              (10)

                  

Jobs

CPU Burst

1

18

2

10

3

7

4

3

5

5

 

  Q.7     a.   What are network protocols? Explain the different layers in ISO reference model for network communication.                                                                                                  (8)

 

             b.   Write and explain Banker’s algorithm.  (8)                                                             

 

  Q.8     a.   What is critical section problem? Give two solutions for critical section problem.                 (8)

 

             b.   Distinguish between physical IOCS and logical IOCS?                                       (8)

       

  Q.9     a.   What is mailbox? Write advantages of mailbox?                                                  (8)

 

             b.   Explain optimal page replacement algorithm?                                                      (8)