Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightOperating Systemchevron_rightIn priority scheduling algorithm, when a process arrives at the ready ...

In priority scheduling algorithm, when a process arrives at the ready ...

  • Q. In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of ____________
  • filter_dramaExplanation
    Answer is : B
    None.

Discussion

    No one started the discussion yet. Break the ice and start the conversation.
    Please Login to be part of the discussion.

Similar Questions

  • 1. What are the two steps of a process execution?
  • filter_dramaExplanation
    Answer is : B
    None.
  • 2. Which one of the following can not be scheduled by the kernel?
  • filter_dramaExplanation
    Answer is : B
    User level threads are managed by thread library and the kernel is unaware of them.
  • 3. What is Event latency?
  • filter_dramaExplanation
    Answer is : D
    None.
  • 4. Time required to synchronous switch from the context of one thread to the context of another thread is called?
  • filter_dramaExplanation
    Answer is : C
    None.
  • 5. A process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of 80 and a CPU burst of 35. Can the processes be scheduled without missing the deadlines?
  • filter_dramaExplanation
    Answer is : B
    None.

Operating SystemTopics

leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points