22xxxxXX
Model Question Paper-1/2 with effect from 2022-23 (CBCS Scheme)
  USN
                           Fourth Semester B.E. Degree Examination
                                     Operating System
TIME: 03 Hours                                                                              Max. Marks: 100
       Note:   01. Answer any FIVE full questions, choosing at least ONE question from each MODULE.
                                                                                           *Bloom’s
                                         Module -1                                         Taxonomy      Marks
                                                                                             Level
Q.01      a    What is an Operating system and explain its Goals?                             L2           4M
          b    List and describe the various architectural supports required and              L2           8M
               techniques used for improving the performance in multiprogramming O.S.
          c    Apply the memory management technique used to manage the memory                L3           8M
               efficiently in time sharing O.S.
                                            OR
Q.02      a    List the operations of an O.S.                                                 L2           4M
          b    List and explain the various classes of Operating System w.r.t. key            L3           8M
               features and prime concerns.
          c    Classify Real time O.S on the basis of their performance and applications      L3           8M
               also explain with example.
                                         Module-2
Q. 03     a    What are the various components of process environment?                        L2           4M
          b    What are the fundamental process states? With state transition diagram         L3           8M
               explain state transition for a process.
          c    Analyze the performance of Operating system for the set of processes           L4           8M
               given in below table using FCFS non-preemptive scheduling policy.
                Process        P1   P2    P3     P4    P5
                Arrival time   0    2     3      5     9
                Service time   3    3     2      5     3
                                            OR
Q.04      a    What is thread? Mention its advantages.                                        L2           4M
          b    Explain the various fields of PCB and explain the importance of each           L3           8M
               field.
          c    Analyze the performance of Operating system for the set of processes           L4           8M
               given in below table by applying RR preemptive scheduling policy.
                Process        P1   P2    P3     P4    P5
                Arrival time   0    2     3      5     9
                Service time   3    3     2      5     3
                                         Module-3
Q. 05     a    Compare contiguous and noncontiguous memory allocation and explain in          L3          10M
               brief how to implement noncontiguous memory allocation.
          b    Explain with diagram i)Paging ii)Segmentation                                  L3          10M
                                            OR
Q. 06     a    With neat diagram explain the concepts of operation of demand paging.          L3          10M
          b    Find the number of page faults for the following page reference string         L3          10M
               using FIFO and LRU policies with four free frames. Which algorithm
                                                                                                   Page 01 of 02
                                                                                           22xxxxXX
            gives the minimum number of page faults?
            7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1
                                            Module-4
Q. 07   a   List and explain the actions performed by file system at open with its AFT.    L2           6M
        b   List and explain the facilities provided by the file system and the IOCS                    6M
            with layer diagram.                                                            L2
        c   With diagram explain the Linked disk space allocation method and list          L3           8M
            their advantages and disadvantages.
                                               OR
Q. 08   a   Identify various file operations performed by file system.                     L3           6M
        b   Explain file organization in sequential and direct access methods and          L3           6M
            compare their performance.
        c   Explain the indexed disk space allocation method and list their advantages     L3           8M
            and disadvantages.
                                            Module-5
Q. 09   a   List the approaches used for handling deadlock, and explain in detail.         L2          10M
        c   Illustrate how to implement message passing. And discuss the primary           L3          10M
            issues in implementing message passing
                                               OR
Q. 10   a   Describe the various events related to resource allocation and the condition   L3          10M
            for deadlock to exist.
        b   Explain i) Direct and indirect naming in message passing. ii) Blocking and     L3          10M
            non-blocking sends in message passing.
                                                                                                Page 02 of 02
                                                           22xxxxXX
  Model Question Paper-2/2 with effect from 2022-23 (CBCS Scheme)
  USN
                       Fourth Semester B.E. Degree Examination
                                 Operating System
TIME: 03 Hours                                                                       Max. Marks: 100
    Note:   01. Answer any FIVE full questions, choosing at least ONE question from each MODULE.
                                                                                    *Bloom’s
                                    Module -1                                       Taxonomy     Marks
                                                                                      Level
Q.01    a Mention and explain the operations of Operating system                      L1          4M
        b Explain the various resource allocation techniques used for resources       L2          8M
          allocation.
        c Explain Batch processing operating system with diagram and define           L3          8M
          turnaround time.
                                        OR
Q.02    a Explain the features of Real time operating system.                         L2          4M
        b Describe the working principle of time sharing O.S. and define response     L3          8M
          time.
        c Explain various techniques used in multiprogramming to improve              L3          8M
          throughput of system.
                                     Module-2
Q. 03   a What are the various components of process environment?                     L2          4M
        b Explain in detail the O.S view of processes.                                L3          6M
        c Analyze the performance of Operating system for the set of processes        L4          10M
          given in below table using FCFS & SRN non-preemptive scheduling
          policy.
           Process         P1 P2 P3        P4      P5
           Arrival time 0       2    3     5       9
           Service time 3       3    2     5       3
                                       OR
Q.04    a What is Thread and mention its advantages.                                  L2          4M
        b Describe with diagram i)kernel level threads                                L3          6M
          and user level threads.
        c Analyze the performance of Operating system for the set of processes        L4          10M
          given in below table by applying RR & LCN preemptive scheduling
          policy.
           Process         P1 P2 P3        P4      P5
           Arrival time 0       2    3     5       9
           Service time 3       3    2     5       3
                                    Module-3
Q. 05   a Explain virtual memory handler with the help of diagram.                    L3           8M
        b Explain with diagram i) Internal Fragmentation ii)External                  L3          12M
          Fragmentation iii)Paging iv)Segmentation
                                       OR
Q. 06   a With neat diagram explain the concepts involved in demand loading of a      L3          8M
          page.
                                                                                           Page 01 of 02
                                                                                          22xxxxXX
        b Determine the number of page faults for the following page reference            L4          12M
          string using FIFO and LRU policies.
          String:5,4,3,2,1,4,3,5,4,3,2,1,5 and time reference
          String:t1,t2,t3,t4,t5,t6,t7,t8,t9,t10,t11,t12,t13 number of page frames is 3.
                                       Module-4
Q. 07   a Explain the fundamental file organization and Input Output control              L2          10M
          system in detail.
        b Compare i) sequential and direct file organization.                             L3          10M
                               ii) linked and indexed disk space allocation.
                                           OR
Q. 08   a With diagram explain how file access is implemented.                            L2          10M
        b Explain the allocation of disk space with necessary diagram.                    L3          10M
                                       Module-5
Q. 09   b Apply the deadlock detection algorithm for detecting the deadlock and           L3          10M
          explain with example.
        c Define Mailbox. Explain message passing using a mailbox with necessary          L2          10M
          diagram. Also mention the advantages of using Mailboxes.
                                           OR
Q. 10   a Define deadlock and Identify the various approaches used to prevent             L3          10M
          deadlock.
        c Explain the different fields of Interprocess message control box.               L2          10M
                                                                                               Page 02 of 02