Scribd Logo
Upload

Welcome to Scribd!

  • 0 views

    RT 31055032021

    Uploaded by

    bestdealspawsome

    Copyright:

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

    RT 31055032021

    Uploaded by

    bestdealspawsome
    0 views1 page

    Original Title

    Rt 31055032021

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    0 views1 page

    RT 31055032021

    Uploaded by

    bestdealspawsome

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 1

    Code No: RT31055 R13 SET - 1

    III B. Tech I Semester Supplementary Examinations, March – 2021


    OPERATING SYSTEMS
    (Common to Computer Science and Engineering, Information Technology)
    Time: 3 hours Max. Marks: 70
    Note: 1. Question Paper consists of two parts (Part-A and Part-B)
    2. Answering the question in Part-A is compulsory
    3. Answer any THREE Questions from Part-B
    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
    PART –A (22 Marks)
    1. a) What is the main advantage of the layered approach to system design? What are the [3M]
    disadvantages of using the layered approach?
    b) What resources are used when a thread is created? How do they differ from those used [4M]
    when a process is created?
    c) Define Busy Waiting. How to overcome busy waiting using Semaphore operations? [4M]
    d) Explain the events in Page Fault Handling. [4M]
    e) What are the necessary conditions for the occurrence of deadlock? [4M]
    f) What are the operations of directory? [3M]
    PART –B (48 Marks)
    2. a) What is meant by system call? Discuss about types of system calls. [8M]
    b) What is the responsibility of Operating System in connection with Operating System [8M]
    components?

    3. a) With a neat sketch, explain the process state diagram. [6M]


    b) What are the criteria for evaluating the CPU scheduling algorithms? Explain the [10M]
    Round Robin scheduling algorithm with a suitable example.

    4. a) What is Dining Philosophers problem? Discuss the solution to Dining philosopher’s [8M]
    problem using monitors.
    b) Define a semaphore. What is meant by counting semaphore and binary semaphore? [8M]
    Discuss mutual exclusion implementation using semaphore.

    5. a) Write short notes on: [8M]


    i) Overlays ii) Dynamic Linking iii) Swapping iv) Dynamic Loading.
    b) What is demand paging? Why it is called as lazy swappers? Explain in detail. [8M]

    6. a) Consider the following and find out the possible resource allocation sequence with the [8M]
    help of deadlock detection algorithm processes p0, p1, p2, p3, p4 Resources A, B, C
    allocation [0 1 0, 2 0 0 , 3 0 3, 2 1 1, 0 0 2] Max[0 0 0, 2 0 2, 0 0 0, 1 0 0, 0 0 2]
    Available[0 0 0].
    b) Explain methods used for ensuring at least one of the necessary conditions cannot [8M]
    hold.

    7. a) What is disk scheduling? Compare various scheduling algorithms and suggest best [10M]
    algorithm for your own snapshot.
    b) Discuss in detail about different file access methods. [6M]
    *****

    |''|'|''|''|''|||'|| www.manaresults.co.in

    You might also like