Let us suppose an operating system is using semaphores to handle process synchronisation. Let there be three process that end up being blocked and placed in suspended list. Which of the following algorithms is used for waking the process?a)Round Robinb)FCFSc)Both of the aboved)None of the aboveCorrect answer is option 'B'. Can you explain this answer? - EduRev Computer Science Engineering (CSE) Question

Explore Courses UPSC Exam UPSC Test Series Free Notes EduRev Infinity

Open App

Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > Let us suppose an operating system is using s...

Join the Discussion on the App

a)
Round Robin
b)
FCFS
c)
Both of the above
d)
None of the above

Correct answer is option 'B'. Can you explain this answer?

FREE This question is part of

Test: CPU Scheduling

Attempt Test

Attempt this Test

Most Upvoted Answer

Let us suppose an operating system is using semaphores to handle proce...

Semaphores: It is an integer variable which is used by various processes in mutually exclusive manner to achieve synchronisation. There are two types of semaphores -

Binary Semaphore
Counting Semaphore

There are two operations which are atomic in nature -

Block: it suspends the process for which it is invoked
wakeup(P): it resumes the execution of a blocked process P.
- If there are two or more processes present in the suspended list, and there are no other processes present to wake these up, then these processes are said to be in deadlock.
- If there are two or more processes present in the suspended list, then the selection of the process will be done on the basis of FCFS (First Come First Serve) for the wakeup()

Answered by Gate Gurus · View profile

Attention Computer Science Engineering (CSE) Students!

To make sure you are not studying endlessly, EduRev has designed Computer Science Engineering (CSE) study material, with Structured Courses, Videos, & Test Series. Plus get personalized analysis, doubt solving and improvement plans to achieve a great score in Computer Science Engineering (CSE).

GATE Computer Science Engineering(CSE) 2025 Mock Test Series

Question Bank for GATE Computer Science Engineering

General Aptitude for GATE

Computer Networks

View all answers Start learning for free

< Previous Question Next Question >

Explore Courses for Computer Science Engineering (CSE) exam

Similar Computer Science Engineering (CSE) Doubts

Three concurrent processes X, Y, and Z execute three different code segments that access and update certain shared variables. Process X executes the P operation (i.e., wait) on semaphores a, b and c; process Y executes the P operation on semaphores b, c and d; process Z executes the P operation on semaphores c, d, and a before entering the respective code segments. After completing the execution of its code segment, each process invokes the V operation (i.e., signal) on its three semaphores. All semaphores are binary semaphores initialized to one. Which one of the following represents a deadlockfree order of invoking the P operations by the processes?

View answer

Three concurrent processes X, Y, and Z execute three different code segments that access and update certain shared variables. Process X executes the P operation (i.e., wait) on semaphores a, b and c; process Y executes the P operation on semaphores b, c and d; process Z executes the P operation on semaphores c, d, and a before entering the respective code segments. After completing the execution of its code segment, each process invokes the V operation (i.e., signal) on its three semaphores. All semaphores are binary semaphores initialized to one. Which one of the following represents a deadlockfree order of invoking the P operations by the processes?

View answer

Three concurrent processes X, Y, and Z execute three different code segments that access and update certain shared variables. Process X executes the P operation (i.e., wait) on semaphores a, b and c; process Y executes the P operation on semaphores b, c and d; process Z executes the P operation on semaphores c, d, and a before entering the respective code segments. After completing the execution of its code segment, each process invokes the V operation (i.e., signal) on its three semaphores. All semaphores are binary semaphores initialized to one. Which one of the following represents a deadlock-free order of invoking the P operations by the processes?

View answer

Three concurrent processes X, Y, and Z execute three different code segments that access and update certain shared variables. Process X executes the P operation (i.e., wait) on semaphores a, b and c; process Y executes the P operation on semaphores b, c and d; process Z executes the P operation on semaphores c, d, and a before entering the respective code segments. After completing the execution of its code segment, each process invokes the V operation (i.e., signal) on its three semaphores. All semaphores are binary semaphores initialized to one. Which one of the following represents a deadlockfree order of invoking the P operations by the processes?

View answer

Three concurrent processes X, Y, and Z execute three different code segments that access and update certain shared variables. Process X executes the P operation (i.e., wait) on semaphores a, b and c; process Y executes the P operation on semaphores b, c and d; process Z executes the P operation on semaphores c, d, and a before entering the respective code segments. After completing the execution of its code segment, each process invokes the V operation (i.e., signal) on its three semaphores. All semaphores are binary semaphores initialized to one. Which one of the following represents a deadlock-free order of invoking the P operations by the processes?

View answer

Top Courses for Computer Science Engineering (CSE)View all

GATE Computer Science Engineering(CSE) 2025 Mock Test Series

Question Bank for GATE Computer Science Engineering

General Aptitude for GATE

Computer Networks

Programming and Data Structures

Top Courses for Computer Science Engineering (CSE)

View all

Let us suppose an operating system is using semaphores to handle process synchronisation. Let there be three process that end up being blocked and placed in suspended list. Which of the following algorithms is used for waking the process?a)Round Robinb)FCFSc)Both of the aboved)None of the aboveCorrect answer is option 'B'. Can you explain this answer?

Share with a Friend

Answer this doubt

Question Description
Let us suppose an operating system is using semaphores to handle process synchronisation. Let there be three process that end up being blocked and placed in suspended list. Which of the following algorithms is used for waking the process?a)Round Robinb)FCFSc)Both of the aboved)None of the aboveCorrect answer is option 'B'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Let us suppose an operating system is using semaphores to handle process synchronisation. Let there be three process that end up being blocked and placed in suspended list. Which of the following algorithms is used for waking the process?a)Round Robinb)FCFSc)Both of the aboved)None of the aboveCorrect answer is option 'B'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Let us suppose an operating system is using semaphores to handle process synchronisation. Let there be three process that end up being blocked and placed in suspended list. Which of the following algorithms is used for waking the process?a)Round Robinb)FCFSc)Both of the aboved)None of the aboveCorrect answer is option 'B'. Can you explain this answer?.

Solutions for Let us suppose an operating system is using semaphores to handle process synchronisation. Let there be three process that end up being blocked and placed in suspended list. Which of the following algorithms is used for waking the process?a)Round Robinb)FCFSc)Both of the aboved)None of the aboveCorrect answer is option 'B'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE). Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.

Here you can find the meaning of Let us suppose an operating system is using semaphores to handle process synchronisation. Let there be three process that end up being blocked and placed in suspended list. Which of the following algorithms is used for waking the process?a)Round Robinb)FCFSc)Both of the aboved)None of the aboveCorrect answer is option 'B'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of Let us suppose an operating system is using semaphores to handle process synchronisation. Let there be three process that end up being blocked and placed in suspended list. Which of the following algorithms is used for waking the process?a)Round Robinb)FCFSc)Both of the aboved)None of the aboveCorrect answer is option 'B'. Can you explain this answer?, a detailed solution for Let us suppose an operating system is using semaphores to handle process synchronisation. Let there be three process that end up being blocked and placed in suspended list. Which of the following algorithms is used for waking the process?a)Round Robinb)FCFSc)Both of the aboved)None of the aboveCorrect answer is option 'B'. Can you explain this answer? has been provided alongside types of Let us suppose an operating system is using semaphores to handle process synchronisation. Let there be three process that end up being blocked and placed in suspended list. Which of the following algorithms is used for waking the process?a)Round Robinb)FCFSc)Both of the aboved)None of the aboveCorrect answer is option 'B'. Can you explain this answer? theory, EduRev gives you an ample number of questions to practice Let us suppose an operating system is using semaphores to handle process synchronisation. Let there be three process that end up being blocked and placed in suspended list. Which of the following algorithms is used for waking the process?a)Round Robinb)FCFSc)Both of the aboved)None of the aboveCorrect answer is option 'B'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.

Explore Courses for Computer Science Engineering (CSE) exam