Menu
Home / CSE MCQs / OS MCQs :: Deadlocks - Operating System

CSE MCQs :: OS MCQs

OS MCQs - RAID - Operating System
OS MCQs - Basics - Operating System
OS MCQs - Threads - Operating System
OS MCQs - Security - Operating System
OS MCQs - Deadlocks - Operating System
OS MCQs - Processes - Operating System
OS MCQs - Semaphores - Operating System
OS MCQs - CPU Scheduling - Operating System
OS MCQs - Virtual memory - Operating System
OS MCQs - Memory Management - Operating System
  1. What is the reusable resource?
    2. A.
    that can be used by one process at a time and is not depleted by that use
    B.
    that can be used by more than one process at a time
    C.
    that can be shared between various threads
    D.
    none of the mentioned

    View Answer

    Workspace

    Discuss Discuss in Forum

  2. Which of the following condition is required for deadlock to be possible?
    3. A.
    mutual exclusion
    B.
    a process may hold allocated resources while awaiting assignment of other resources
    C.
    no resource can be forcibly removed from a process holding it
    D.
    all of the mentioned

    View Answer

    Workspace

    Discuss Discuss in Forum

  3. A system is in the safe state if:
    4. A.
    the system can allocate resources to each process in some order and still avoid a deadlock
    B.
    there exist a safe sequence
    C.
    both (a) and (b)
    D.
    none of the mentioned

    View Answer

    Workspace

    Discuss Discuss in Forum

  4. The circular wait condition can be prevented by:
    5. A.
    defining a linear ordering of resource types
    B.
    using thread
    C.
    using pipes
    D.
    all of the mentioned

    View Answer

    Workspace

    Discuss Discuss in Forum

  5. Which one of the following is the deadlock avoidance algorithm?
    6. A.
    banker's algorithm
    B.
    round-robin algorithm
    C.
    elevator algorithm
    D.
    karn's algorithm

    View Answer

    Workspace

    Discuss Discuss in Forum

  6. For effective operating system, when to check for deadlock?
    7. A.
    every time a resource request is made
    B.
    at fixed time intervals
    C.
    both (a) and (b)
    D.
    none of the mentioned

    View Answer

    Workspace

    Discuss Discuss in Forum

  7. A problem encountered in multitasking when a process is perpetually denied necessary resources is called:
    8. A.
    deadlock
    B.
    starvation
    C.
    inversion
    D.
    aging

    View Answer

    Workspace

    Discuss Discuss in Forum

  8. Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence?
    9. A.
    resource allocation graph
    B.
    starvation graph
    C.
    inversion graph
    D.
    none of the mentioned

    View Answer

    Workspace

    Discuss Discuss in Forum

  9. To avoid deadlock:
    10. A.
    there must be a fixed number of resources to allocate
    B.
    resource allocation must be done only once
    C.
    all deadlocked processes must be aborted
    D.
    inversion technique can be used

    View Answer

    Workspace

    Discuss Discuss in Forum

  10. The number of resources requested by a process :
    11. A.
    must always be less than the total number of resources available in the system
    B.
    must always be equal to the total number of resources available in the system
    C.
    must not exceed the total number of resources available in the system
    D.
    must exceed the total number of resources available in the system

    View Answer

    Workspace

    Discuss Discuss in Forum

Java Programming Questions and Answers Interview Questions and Answers