CS-262
                                      Operating Syseems
                                (B.Tech 4rd Semester, 2122)
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 : 2 Each

1 (a) Name any five operating systems.
   (b) What is the function of long term scheduler ?
   (c) What is context switching?
   (d) Why do we need a file system?
   (e) Why page sizes are power of 2 ?
   (f) Differentiate betwwen Internal and External Fragmentation?
   (g) Define the term pre-emption and its use.
   (h) What is system call?
   (i) Name the file systems of UNIX, DOS Windows-98 and Netware operating systems.
   (j) Nmae various scheduling criterias.

                                           
Section-B                                       Marks:5 Each

2. Differentiate betwwen the following:
   (a) Real time and Time sharing operating systems.
   (b) Multitasking and multiprogramming.
3. Define the term Process and PCB. Discuss the concept of process. State with the help of diagram.
4. Explain in brief the MFT and MVT Configuous Memory allocation techniques with example.
5. What is Deadlock ? Discuss the four necessary conditions for its occurance.
6. How is the file system of distributed O.S. differ from non-distributed O.S. ?

                                            
Section-C                                      Marks : 10 Each

7. Consider a pre-segment system with a virtual address length of 32 bits. Out of that 10 bits are displacement
    and 12 are for segment numbers and 10 are for page number.
    (a) Calculate page size and segment size.
    (b) Maximum numbe rof pages.
    (c) Maximum no. of segments.
8. Consider the following set of processes with the CPU brust time in milliseconds :
         Process                 Brust Time               Priority
         
P1                             9                             3
            P2                             1                             1
            P3                             2                             3
            P4                             1                             4
            P5                             4                             2
     The process arrive in order P1, P2, P3, P4, P5 at same time say 0.
     (a) Draw four Gantt Charts illustrating the execuation of these processes using FCFS, SJF, non-preemptive
          priority (1 = Highest Priority) and RR scheduling.
     (b) Calculate the turn around time and waiting time for each processfor each of scheduling algo's given in part (a).
9.  (a) Discuss the main features of windows NT operating system.
     (b) Differentiate between Program Structure and Network Structure.         
OPERATING SYSTEMS  
PAPER NO.1          
1     2    3          NEXT>>          
                      Similar papers:
                      
Operating system (CS-202) OF COMPUTER ENGINEERING
[email protected]
[email protected]
[email protected]
       PUT ON  DEC., 2K2
Hosted by www.Geocities.ws

1