Scribd Logo
Upload

Welcome to Scribd!

  • 12 views

    Sheet 4

    Uploaded by

    Ahmed Elkerdawy
    The document discusses the banker's algorithm for deadlock avoidance and presents several examples of its application to resource allocation problems. Multiple choice and short answer questions are provided related to determining if a system is in a safe state, identifying deadlock conditions, and applying the banker's algorithm to check for safe sequences of process completion.

    Copyright:

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

    Sheet 4

    Uploaded by

    Ahmed Elkerdawy
    12 views4 pages
    The document discusses the banker's algorithm for deadlock avoidance and presents several examples of its application to resource allocation problems. Multiple choice and short answer questions are provided related to determining if a system is in a safe state, identifying deadlock conditions, and applying the banker's algorithm to check for safe sequences of process completion.

    Original Title

    sheet 4

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses the banker's algorithm for deadlock avoidance and presents several examples of its application to resource allocation problems. Multiple choice and short answer questions are provided related to determining if a system is in a safe state, identifying deadlock conditions, and applying the banker's algorithm to check for safe sequences of process completion.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    12 views4 pages

    Sheet 4

    Uploaded by

    Ahmed Elkerdawy
    The document discusses the banker's algorithm for deadlock avoidance and presents several examples of its application to resource allocation problems. Multiple choice and short answer questions are provided related to determining if a system is in a safe state, identifying deadlock conditions, and applying the banker's algorithm to check for safe sequences of process completion.

    Copyright:

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

    Sheet 4

    1. An operating system uses the banker’s algorithm for deadlock avoidance when
    managing the allocation of three resource types X, Y and Z to three processes P0, P1
    and P2. The table given below presents the current system state. Here, the Allocation
    matrix shows the current number of resources of each type allocated to each process
    and the Max matrix shows the maximum number of resources of each type required by
    each process during its execution. There are 3 units of type X, 2 units of type Y and 2
    units of type Z still available. The system is currently in a safe state. Consider the
    following independent requests for additional resources in the current state-

    REQ1: P0 requests 0 units of X, 0 units of Y and 2 units of Z

    REQ2: P1 requests 2 units of X, 0 units of Y and 0 units of Z

    Which of the following is TRUE?

    a) Only REQ1 can be permitted.


    b) Only REQ2 can be permitted.
    c) Both REQ1 and REQ2 can be permitted
    d) Neither REQ1 nor REQ2 can be permitted
    2. Consider the resource allocation graph in the figure-

    Find if the system is in a deadlock state otherwise find a safe sequence.


    3. Consider the resource allocation graph in the figure-

    Find if the system is in a deadlock state otherwise find a safe sequence.

    4. Consider the resource allocation graph in the figure-


    Find if the system is in a deadlock state otherwise find a safe sequence.
    5. A single processor system has three resource types X, Y and Z, which are shared by three
    processes. There are 5 units of each resource type. Consider the following scenario, where
    the column alloc denotes the number of units of each resource type allocated to each
    process, and the column request denotes the number of units of each resource type
    requested by a process to complete execution. Which of these processes will finish LAST?

    A. P0
    B. P1
    C. P2
    D. None of the above since the system is in a deadlock.
    6. Consider the following snapshot of a system.

    Answer the following questions using the banker’s algorithm:


    a. What does the content of the matrix Need?
    b. Is the system in a safe state?
    c. If a request from thread (process) T1 arrives for (0,4,2,0), can the request be granted
    immediately?
    7. Consider the following snapshot of a system:

    Using the banker’s algorithm, determine whether each of the following states is unsafe. If the state
    is safe, illustrate the order in which the threads(processes) may complete. Otherwise, illustrate why
    the state is unsafe.
    a. Available = (0, 3, 0, 1)
    b. Available = (1, 0, 0, 2)
    8. Name the four conditions required for deadlock and give a brief (one sentence) description of
    each.
    9. Does a cyclic dependency always lead to deadlock? Why or why not?
    10. What is the difference between deadlock prevention and deadlock avoidance? What category
    does Banker’s algorithm falls in and why?

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy