Scribd Logo
Upload

Welcome to Scribd!

  • 37 views

    Answer Any TWO Full Questions From UNIT I, Any TWO Full Questions From Ii) Draw A Neat Diagram Wherever Necessary

    Uploaded by

    Sanjeev R
    The document is a past examination for an Operating Systems course. It contains 3 units covering various topics in operating systems like processes, scheduling, memory management, file systems, I/O, and deadlocks. The examination tests students on their understanding of these core OS concepts through questions that require explaining terms, drawing diagrams, analyzing examples, and discussing algorithms.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd

    Answer Any TWO Full Questions From UNIT I, Any TWO Full Questions From Ii) Draw A Neat Diagram Wherever Necessary

    Uploaded by

    Sanjeev R
    37 views2 pages
    The document is a past examination for an Operating Systems course. It contains 3 units covering various topics in operating systems like processes, scheduling, memory management, file systems, I/O, and deadlocks. The examination tests students on their understanding of these core OS concepts through questions that require explaining terms, drawing diagrams, analyzing examples, and discussing algorithms.

    Original Description:

    CPP

    Original Title

    724-09MCA22

    Copyright

    © © All Rights Reserved

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document is a past examination for an Operating Systems course. It contains 3 units covering various topics in operating systems like processes, scheduling, memory management, file systems, I/O, and deadlocks. The examination tests students on their understanding of these core OS concepts through questions that require explaining terms, drawing diagrams, analyzing examples, and discussing algorithms.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    37 views2 pages

    Answer Any TWO Full Questions From UNIT I, Any TWO Full Questions From Ii) Draw A Neat Diagram Wherever Necessary

    Uploaded by

    Sanjeev R
    The document is a past examination for an Operating Systems course. It contains 3 units covering various topics in operating systems like processes, scheduling, memory management, file systems, I/O, and deadlocks. The examination tests students on their understanding of these core OS concepts through questions that require explaining terms, drawing diagrams, analyzing examples, and discussing algorithms.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    of 2

    May_2010 09 MCA22

    USN 2 B V 0

    II Semester M.C.A. Examination


    Master of Computer Applications
    Operating Systems (09 MCA22)
    Duration: 3 hours Max. Marks: 100

    Note: i) Answer any TWO full questions from UNIT I, any TWO full questions from
    UNIT II and any ONE full question from UNIT III.
    ii) Draw a neat diagram wherever necessary.

    UNIT I

    1 a) Define Operating System , discuss the role of Operating System from users’
    view & system’s view (05 arks)

    b) What is a process? Briefly explain its states. (05 arks)

    c) Explain the followings.


    (i) Multiprocessor systems (ii) Clustered systems. (10marks)

    2 a) Briefly explain the layered approach of operating system. (04marks)

    b) Given the following information.

    Arrival Time Burst Time


    Process Priority
    (millisecond) (millisecond)

    A 0 3 3

    B 1 6 5

    C 2 1 2

    D 3 4 1

    E 4 2 4

    (i) Draw Gantt charts for FCFS, Preemptive SJF , Preemptive Priority (Low
    number indicates higher priority) , RR ( quantum = 1) scheduling algorithms.
    (ii) Find average Turn Around Time and average Waiting Time for all the
    scheduling algorithms mentioned in part (i). (12marks)

    c) Discuss about semaphore. (04marks)

    3 a) Define the followings. (i) Job queue (ii) Ready queue. (iii) Device queue (03marks)

    b) Write the monitor solution for Dining-philosopher problem. (08marks)

    c) Discuss about critical section problem. Briefly explain the three requirements
    that have to be satisfied by the solution of a critical section problem. (09marks)

    Page 1 of 2
    UNIT II

    4 a) Consider a system with the following current resource-allocation state.


    Process Allocation MAX Available
    R1 R2 R1 R2 R1 R2
    P1 1 2 4 2 1 1
    P2 0 1 1 2
    P3 1 0 1 3
    P4 2 0 3 2
    (i) What is Need matrix?
    (ii) Is system in safe state? (10marks)
    b) Write a note on fragmentation. (06marks)
    c) Explain any one of the access methods used to access the information in a file. (04marks)
    5 a) Explain the resource-allocation graph algorithm for deadlock avoidance (04 arks)
    b) What is meant by page fault? With a neat diagram explain the steps in handling
    page faults. (08marks)
    c) What is a file? Explain its attributes. (08marks)
    6 a) What is deadlock? List the necessary conditions for deadlock. (06marks)
    b) Write a note on swapping of processes. (06marks)
    c) Explain any two methods used for allocating disk space to files. (08marks)

    UNIT III

    7 a) Suppose that the head of a moving head disk with 200 tracks, numbered from 0
    to 199 is currently serving a request at track 143. The queue of requests is kept
    in the FIFO order 86, 147, 91, 177, 94, 150, 102, 175, 130.
    (i) What is the total number of head movements needed to satisfy these
    requests for the following disk-scheduling algorithms.
    (a) FCFS (b) SSTF (C) SCAN(direction of head movement is left to right)
    (ii) Which algorithm gives better disk throughput? (10marks)
    b) What is access matrix? Briefly explain the different methods used to implement
    the access matrix. (10marks)
    8 a) Explain Interprocess communication in Linux System. (10marks)
    b) Write a note on the followings with respect to Linux system.
    (i)Process Identity
    (ii)Process Environment (10marks)

    Page 2 of 2

    You might also like