In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same timestamp if killed. Let Ph be the process holding a resource R, Pr be a process requesting for the same resource R, and T(Ph) and T(Pr) be their timestamps respectively. The decision to wait or preempt one of the processes is based on the following algorithm.if T(Pr) andlt; T(Ph)then kill Prelse waitWhich one of the following is TRUE?a)The scheme is deadlock-free, but not starvation-freeb)The scheme is not deadlock-free, but starvation-freec)The scheme is neither deadlock-free nor starvation-freed)The scheme is both deadlock-free and starvation-freeCorrect answer is option 'A'. 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 > In a certain operating system, deadlock preve...

Join the Discussion on the App

then kill Pr

else wait
Which one of the following is TRUE?

a)
The scheme is deadlock-free, but not starvation-free
b)
The scheme is not deadlock-free, but starvation-free
c)
The scheme is neither deadlock-free nor starvation-free
d)
The scheme is both deadlock-free and starvation-free

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

FREE This question is part of

Test: Process Synchronization- 2

Attempt Test

Attempt this Test

Verified Answer

In a certain operating system, deadlock prevention is attempted using ...

This scheme is making sure that the timestamp of requesting process is always lesser than holding process
The process is restarted with same timestamp if killed and that timestamp can NOT be greater than the existing time stamp

From 1 and 2,it is clear that any new process coming having LESSER timestamp will be KILLED.So,NO DEADLOCK possible However, a new process will lower timestamp may have to wait infinitely because of its LOWER timestamp(as killed process will also have same timestamp ,as it was killed earlier).STARVATION IS Definitely POSSIBLE So Answer is A

View all questions of this test

Most Upvoted Answer

In a certain operating system, deadlock prevention is attempted using ...

If T(Pr) < t(ph),="" then="" pr="" is="" allowed="" to="" />
If T(Pr) > T(Ph), then Ph is preempted and Pr is allowed to proceed.

This deadlock prevention scheme ensures that a process with a higher timestamp is given priority over a process with a lower timestamp. This helps to prevent deadlocks by ensuring that processes with higher timestamps are not indefinitely blocked by processes with lower timestamps.

By assigning each process a unique timestamp and restarting them with the same timestamp if killed, this scheme ensures that processes retain their priority even after being restarted. This helps to maintain the order of execution and prevent deadlocks.

However, it is important to note that this scheme does not guarantee complete deadlock prevention. It only helps in preventing deadlocks caused by resource allocation. Other types of deadlocks, such as circular wait, cannot be prevented solely by this scheme. Therefore, additional deadlock prevention mechanisms may still be required in the operating system.

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

In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same timestamp if killed. Let Ph be the process holding a resource R, Pr be a process requesting for the same resource R, and T(Ph) and T(Pr) be their timestamps respectively. The decision to wait or preempt one of the processes is based on the following algorithm.if T(Pr) T(Ph) then kill Prelse waitQ. Which one of the following is TRUE?

View answer

An operating system makes use of Banker’s algorithm to allocate 12 printers. Printers will be allocatedto a process requesting them only if - there are enough available printers to allow it to run to completion.User 1 using 7 printers and will need at most a total of 10 printers.User 2 is using 1 printer and will need at most 4 printers.User 3 is using 2 printers and will need at most 4 printers.Each user is currently requesting 1 more printer, Which of thefollowing is true?

View answer

An operating system implements a policy that requires a process to release all resources before making a request for another resource. Select the TRUE statement from the following

View answer

An operating system implements a policy that requires a process to release all resources before making a request for another resource.

View answer

A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT (n refers to the number of items in the queu e)?

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

In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same timestamp if killed. Let Ph be the process holding a resource R, Pr be a process requesting for the same resource R, and T(Ph) and T(Pr) be their timestamps respectively. The decision to wait or preempt one of the processes is based on the following algorithm.if T(Pr) < T(Ph)then kill Prelse waitWhich one of the following is TRUE?a)The scheme is deadlock-free, but not starvation-freeb)The scheme is not deadlock-free, but starvation-freec)The scheme is neither deadlock-free nor starvation-freed)The scheme is both deadlock-free and starvation-freeCorrect answer is option 'A'. Can you explain this answer?

Share with a Friend

Answer this doubt

Question Description
In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same timestamp if killed. Let Ph be the process holding a resource R, Pr be a process requesting for the same resource R, and T(Ph) and T(Pr) be their timestamps respectively. The decision to wait or preempt one of the processes is based on the following algorithm.if T(Pr) < T(Ph)then kill Prelse waitWhich one of the following is TRUE?a)The scheme is deadlock-free, but not starvation-freeb)The scheme is not deadlock-free, but starvation-freec)The scheme is neither deadlock-free nor starvation-freed)The scheme is both deadlock-free and starvation-freeCorrect answer is option 'A'. 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 In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same timestamp if killed. Let Ph be the process holding a resource R, Pr be a process requesting for the same resource R, and T(Ph) and T(Pr) be their timestamps respectively. The decision to wait or preempt one of the processes is based on the following algorithm.if T(Pr) < T(Ph)then kill Prelse waitWhich one of the following is TRUE?a)The scheme is deadlock-free, but not starvation-freeb)The scheme is not deadlock-free, but starvation-freec)The scheme is neither deadlock-free nor starvation-freed)The scheme is both deadlock-free and starvation-freeCorrect answer is option 'A'. 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 In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same timestamp if killed. Let Ph be the process holding a resource R, Pr be a process requesting for the same resource R, and T(Ph) and T(Pr) be their timestamps respectively. The decision to wait or preempt one of the processes is based on the following algorithm.if T(Pr) < T(Ph)then kill Prelse waitWhich one of the following is TRUE?a)The scheme is deadlock-free, but not starvation-freeb)The scheme is not deadlock-free, but starvation-freec)The scheme is neither deadlock-free nor starvation-freed)The scheme is both deadlock-free and starvation-freeCorrect answer is option 'A'. Can you explain this answer?.

Solutions for In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same timestamp if killed. Let Ph be the process holding a resource R, Pr be a process requesting for the same resource R, and T(Ph) and T(Pr) be their timestamps respectively. The decision to wait or preempt one of the processes is based on the following algorithm.if T(Pr) < T(Ph)then kill Prelse waitWhich one of the following is TRUE?a)The scheme is deadlock-free, but not starvation-freeb)The scheme is not deadlock-free, but starvation-freec)The scheme is neither deadlock-free nor starvation-freed)The scheme is both deadlock-free and starvation-freeCorrect answer is option 'A'. 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 In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same timestamp if killed. Let Ph be the process holding a resource R, Pr be a process requesting for the same resource R, and T(Ph) and T(Pr) be their timestamps respectively. The decision to wait or preempt one of the processes is based on the following algorithm.if T(Pr) < T(Ph)then kill Prelse waitWhich one of the following is TRUE?a)The scheme is deadlock-free, but not starvation-freeb)The scheme is not deadlock-free, but starvation-freec)The scheme is neither deadlock-free nor starvation-freed)The scheme is both deadlock-free and starvation-freeCorrect answer is option 'A'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same timestamp if killed. Let Ph be the process holding a resource R, Pr be a process requesting for the same resource R, and T(Ph) and T(Pr) be their timestamps respectively. The decision to wait or preempt one of the processes is based on the following algorithm.if T(Pr) < T(Ph)then kill Prelse waitWhich one of the following is TRUE?a)The scheme is deadlock-free, but not starvation-freeb)The scheme is not deadlock-free, but starvation-freec)The scheme is neither deadlock-free nor starvation-freed)The scheme is both deadlock-free and starvation-freeCorrect answer is option 'A'. Can you explain this answer?, a detailed solution for In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same timestamp if killed. Let Ph be the process holding a resource R, Pr be a process requesting for the same resource R, and T(Ph) and T(Pr) be their timestamps respectively. The decision to wait or preempt one of the processes is based on the following algorithm.if T(Pr) < T(Ph)then kill Prelse waitWhich one of the following is TRUE?a)The scheme is deadlock-free, but not starvation-freeb)The scheme is not deadlock-free, but starvation-freec)The scheme is neither deadlock-free nor starvation-freed)The scheme is both deadlock-free and starvation-freeCorrect answer is option 'A'. Can you explain this answer? has been provided alongside types of In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same timestamp if killed. Let Ph be the process holding a resource R, Pr be a process requesting for the same resource R, and T(Ph) and T(Pr) be their timestamps respectively. The decision to wait or preempt one of the processes is based on the following algorithm.if T(Pr) < T(Ph)then kill Prelse waitWhich one of the following is TRUE?a)The scheme is deadlock-free, but not starvation-freeb)The scheme is not deadlock-free, but starvation-freec)The scheme is neither deadlock-free nor starvation-freed)The scheme is both deadlock-free and starvation-freeCorrect answer is option 'A'. Can you explain this answer? theory, EduRev gives you an ample number of questions to practice In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same timestamp if killed. Let Ph be the process holding a resource R, Pr be a process requesting for the same resource R, and T(Ph) and T(Pr) be their timestamps respectively. The decision to wait or preempt one of the processes is based on the following algorithm.if T(Pr) < T(Ph)then kill Prelse waitWhich one of the following is TRUE?a)The scheme is deadlock-free, but not starvation-freeb)The scheme is not deadlock-free, but starvation-freec)The scheme is neither deadlock-free nor starvation-freed)The scheme is both deadlock-free and starvation-freeCorrect answer is option 'A'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.

Explore Courses for Computer Science Engineering (CSE) exam