OPERATING SYSTEM
PAPER NO. 3         
[email protected]
[email protected]
[email protected]
                                             CS-202
                                   OPERATING SYSTEM              
                                (B.Tech 4th Semester,2052)
Time : 3 Hours                                                                                  Maximum Marks : 60
NOTE:-
This paper consist of Three Sections. Section A is compulsory. Do any Four questions from
                 Section B and any two questions from Section C


                                   Section-A                                       Marks : 20

1(a) What is kernal ?
(b) What is thew purpose of system programs ?
(c) Define Thread.
(d) What is the purpose of system calls ?
(e) What is meant by address binding ?
(f)Explain the following allocation algorithims :
        (i) First-fit
       (ii) Best-fit
      (iii) Worst-fit
(g) What is inverted page table ?
(h) Explain the concept of stable storage.
(i) What is thew need-to-know principle ? Why is it important for a protection system to adhere to this principle ?
(j) Explain the term trap door as concerns program threats.

                                           
Section-B                                       Marks:5 Each

2. What are the five major activities of an operating system in regard to file management ?
3. Describe the difference among short-term, medium term and long term scheduling.
4. Define the difference between Preemptive and Non-preemptive scheduling. State why strict non-preemptive
    scheduling is unlikely to be used in a computer centre.
5. Consider the following snapshot of a system:
                    Allocation              Max               Available
                     A B C D              A B C D             A B C D
       P0           0 0 1 2                0 0 1 2               1 5 2 0
       P1           1 0 0 0                1 7 5 0
       P2           1 3 5 4                2 3 5 6
       P3           0 6 3 2                0 6 5 2
       P4           0 0 1 4                0 6 5 6
   Answer the following questions using the banker's algorithm"
   What is the content of the matrix Need ?
   Is the system in a safe state ?
   If a request from process P1 arrives for (0, 4, 2, 0) can the request be granted immediately ?
6. What is the multilevel paging ? Why is it required ?

                                            
Section-C                                      Marks : 10 Each

7.(a) State and explain four necessary conditions for a deadlock to occur.
  (b) Explain resourse allocation graph.
8.(a) Explain the concept of virtual memory with its advantages.
  (b) When do page fault occur ? Describe the actions taken by the operating system when a page fault occurs.
9.(a) Comment upon the socket mechanism in Unix OS.
  (b) Discuss the important security features provided by most OS.
<<PREVIOUS            1 2 3 4        NEXT>>
ECE            CSE       SECOND YEAR PAPERS          PTUPAPERS
                 SIMILAR PAPERS:-
               
OPERATING SYSTEM (CS- 262) OF ELECTRONICS AND COMMUNICATION ENGG.
Hosted by www.Geocities.ws

1