DipIETE – CS (OLD SCHEME)

                                              

Code: DC14                            Subject: SYSTEM SOFTWARE & OPERATING SYSTEMS

Time: 3 Hours                                                                                                     Max. Marks: 100

Flowchart: Alternate Process: JUNE 2010
 

 

 


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 is not a language processor?

 

      (A) Compiler                              (B) Interpreter

              (C)                                        Operating System                               (D) Assembler

 

b.       A process waiting for an I/O event comes under _________.                                      

    

      (A) dormant                                 (B)  ready

      (C) suspended                             (D) terminated

 

c.    Parsing is a technique for _________. 

       

      (A) syntax analysis                      (B) lexical analysis

      (C) semantic analysis                   (D) None of the above 

 

d.   Which of the following is not a scheduling algorithm?

 

      (A) FCFS                                     (B) Bankers algorithm

      (C) SJF                                        (D) Round Robin

 

e.   Virtual memory is _____________.

 

      (A) physical memory                   (B) memory management scheme

      (C) cache memory                       (D) None of the above

 

f.    An address generated by CPU is known as ___________.

 

     (A) physical address                    (B) logical address

      (C) physical address space          (D) logical address space

 

g.   Deadlock avoidance uses following algorithm:

 

     (A) Banker’s algorithm                 (B) Safer algorithm

     (C) Locker algorithm                    (D) None of the above.

 

 

h.   SPOOLING stands for __________.

 

      (A) simple process operations on line           

                                                                  (B) simultaneous Peripherals operations on Line

                                                                             (C) sequential process operations on line                               

                                                                                                          (D) None of the above

 

i.   A binding performed during the execution of the program is _________.                  

     

     (A) static binding                          (B) dynamic binding

     (C) real time binding                    (D) None of the above

 

j.   Semaphores __________.                                                                                               

   

      (A) synchronize critical resources to prevent contention                                           

                                                        (B) synchronize critical resources to prevent deadlock

                                                                                                               (C) are used to I/O

                                                                                (D) are used for  memory management  

 

 

Answer any FIVE Questions out of EIGHT Questions.

Each question carries 16 marks.

 

       

  Q.2     a.   Define language processor. Explain different types of language processors.                  

                                                                                                                                             (8)

b.       Define the search data structures that are used in language processing and the fixed & variable length entries.                                                                                                              (4)

 

c.       What are the goals of parsing?                                                                         (4)

 

  Q.3     a.   List various services provided by an operating system. Explain how each service provides convenience to the users?                                       (8)

 

                   b.                                                        Explain various parameter passing techniques.     (8)

       

  Q.4     a.   Define and explain memory allocation. What are different approaches of memory allocation?                                            (8)

                  

b.   Differentiate between relocatable, non-relocatable and self relocatable programs.                         (8)

                  

  Q.5     a.   Explain various types of Text Editors.                                                             (8)

                  

             b.   What are the three different states in which all users of a timesharing system fall? Explain. List out main advantages of time-sharing system.                                                        (8)

 

 

 

 

 

 

 

  Q.6     a.   Define and explain Process Control Block.                                                    (6)

 

b.   Consider the following set of processes that arrives at time 0 with the              

       length of the CPU –burst time given in milliseconds:

       

                      SET 1:                                                           SET 2:

Process

Burst time

 

Process

Burst time

Priority

P1

6

 

P1

10

3

P2

8

 

P2

1

1

P3

7

 

P3

2

3

P4

3

 

P4

1

4

 

 

 

P5

5

2

                  

 

            

 

 

 

 

 

                   Find the average waiting time using Shortest-Job-First (SJF) and Priority Scheduling algorithms for SET 1 and SET 2 respectively.          (10)

 

  Q.7     a.   What is meant by File organization? What are the commonly used file organisations in business data processing? How do we decide to use a particular file organisation for an application?            (8)

       

b.       Define Deadlock. What are the conditions which are required for a deadlock occurrence? How it can be prevented?                                     (8)

 

  Q.8     a.   Explain the concept of Virtual Memory. Explain various approaches used for realization of Virtual Memory. List advantages and disadvantages of Virtual Memory.                                 (8)

 

b.       Explain Critical Section problem in relation to process synchronization. List various requirements that critical section problem solution must satisfy.                                                                                       (8)

 

  Q.9     a.   What is Encryption of data and what mechanisms are used for protecting files containing program and data?                                           (8)

 

                   b.                                                        Write short notes on:                                                               (42)

            

                   (i)   Code Optimization.

                   (ii)  Scheduling policies.