Search results for deadlock / GATE Overflow for GATE CSE

7 votes

6 answers

21

deadlock
If a process is in unsafe state, then: (a) It is in deadlock (b) It might successfully complete (c) It will lead to deadlock (d) None of the above

If a process is in unsafe state, then:(a) It is in deadlock (b) It might successfully complete(c) It will lead to deadlock (d) None of the above

Sunil8860

10.7k views

Sunil8860 asked Jul 16, 2017

0 votes

1 answer

22

Safe State | Deadlock Avoidance | Bankers Algorithm | OS | MSQ
MSQ Which of the following statements is/are TRUE? If safe state exists, deadlock can be avoided if resources are allocated properly If safe state exists, deadlock is never possible in future Unsafe state always leads to ... safe state exists, deadlock is possible, if resources are poorly allocated Unsafe state may lead to a deadlock

MSQ Which of the following statements is/are TRUE?If safe state exists, deadlock can be avoided if resources are allocated properlyIf safe state exists, deadlock is never...

Souvik33

1.1k views

Souvik33 asked Nov 19, 2022

52 votes

6 answers

23

GATE IT 2004 | Question: 63
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 $P_h$ ... but starvation-free The scheme is neither deadlock-free nor starvation-free The scheme is both deadlock-free and starvation-free

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 ti...

Ishrat Jahan

13.5k views

Ishrat Jahan asked Nov 2, 2014

0 votes

0 answers

24

Consider a Diffie-Hellman scheme with a common prime q=11 and a primitive root a=2. a. If user A as public key YA=9 what is as private key XA? b. If user B has public key YB= 3 what is the shared secret key K?

Consider a Diffie-Hellman scheme with a common prime q=11 and a primitive root a=2. If user A as public key YA=9 what is as private key XA? If user B has public key YB= 3...

JustPakYt

1.4k views

JustPakYt asked Nov 13, 2022

1 votes

2 answers

25

#MadeEasy
consider a system having 22 resources of the same type. These resources are shared by 4 processes P, Q, R, and S having peak demands of 3,6, a, and b respectively. How many ordered pairs (a,b) are possible, such that the system is deadlock free?

consider a system having 22 resources of the same type. These resources are shared by 4 processes P, Q, R, and S having peak demands of 3,6, a, and b respectively. How ma...

Dknights

804 views

Dknights asked Dec 5, 2022

2 votes

2 answers

26

Self Doubt
Can Safe state in DeadLock Avoidance Mechanism always guarantee No DeadLock??

Can Safe state in DeadLock Avoidance Mechanism always guarantee No DeadLock??

Sunnidhya Roy

678 views

Sunnidhya Roy asked Dec 30, 2022

0 votes

1 answer

27

Operating System
How c came into picture.

How c came into picture.

Overflow04

324 views

Overflow04 asked Dec 31, 2022

1 votes

1 answer

28

Made Easy Mock -1

TusharKumar

409 views

TusharKumar asked Dec 29, 2022

0 votes

0 answers

29

Made Easy Test Series Question on DeadLock
Q: Consider a system having 22 resources of same type. These resources are shared by 4 processes P,Q,R and S having peak demands of 3, 6, a and b. How many ordered pairs (a,b) are possible such that the system is deadlock free? According to me ... for a process be 0? In that case a-1 or b-1 will become -1 which will impact the inequality. So is this valid?

Q: Consider a system having 22 resources of same type. These resources are shared by 4 processes P,Q,R and S having peak demands of 3, 6, a and b. How many ordered pairs ...

Sunnidhya Roy

515 views

Sunnidhya Roy asked Dec 27, 2022

0 votes

0 answers

30

Consider a system having 22 resources of the same type. These resources are shared by 4 processes P, Q, Rand Shaving peak demands of 3, 6, a and b respectively. How many ordered pairs (a, b) are possible, such that the system is deadlock free?

damz1499

1.2k views

damz1499 asked Nov 7, 2022

0 votes

0 answers

31

operating sysytem
a system has four processes and five allocable resources the current allocation and maximum needs are as follows Allocated Maximum Available process A 10211 11213 00x11 process B 20110 22210 process C 11010 21310 process D 11110 11221

a system has four processes and five allocable resources the current allocation and maximum needs are as follows Allocated Maximum ...

Skarma Angmo

445 views

Skarma Angmo asked Sep 16, 2022

1 votes

0 answers

32

Deadlocks
Definition of a set of deadlocked Processes: “A set of processes is deadlocked if each process in the set is waiting for an event that only another process in the set can cause.” P1, P2, and P3 have caused deadlock but every process including P4 is in the deadlocked set of processes, isn’t it?

Definition of a set of deadlocked Processes:“A set of processes is deadlocked if each process in the set is waiting for an event that only another process in the set ca...

lolalo

609 views

lolalo asked Aug 19, 2022

0 votes

1 answer

33

NIELIT 2017 July Scientist B (CS) - Section B: 37
A system has $n$ resources $R_0, \dots,R_{n-1}$, and $k$ processes $P_0, \dots, P_{k-1}$. The implementation of the resource request logic of each process $P_i$ is as follows: if(i%2==0){ if(i<n) request Ri; if(i+2<n) request Ri+2; } else ... following situations is a deadlock possible? $n=40,\: k=26$ $n=21,\:k=12$ $n=20,\:k=10$ $n=41,\:k=19$

A system has $n$ resources $R_0, \dots,R_{n-1}$, and $k$ processes $P_0, \dots, P_{k-1}$. The implementation of the resource request logic of each process $P_i$ is as fol...

admin

973 views

admin asked Mar 30, 2020

0 votes

2 answers

34

Made easy || Operating system
While of the following is incorrect? (a) if a system uses preemptive CPU scheduler then deadlock is not possible in system (b) Deadlock state is an unsafe state. (c) If a system has total ordering of all resource types ... disabled) therefore deadlock should not possible in preemptive scheduling then how can this statement could be incorrect. please clarify the doubt

While of the following is incorrect?(a) if a system uses preemptive CPU scheduler then deadlock is not possible in system(b) Deadlock state is an unsafe state.(c) If a sy...

Shreya2002

1.3k views

Shreya2002 asked Aug 5, 2022

0 votes

0 answers

35

Best Open Video Playlist for Deadlock Topic | Operating Systems
Please list out the best free available video playlist for Deadlock from Operating Systems as an answer here (only one playlist per answer). We'll then select the best playlist and add to GO classroom video lists. You can ... standard ones are more likely to be selected as best. For the full list of selected videos please see here

Please list out the best free available video playlist for Deadlock from Operating Systems as an answer here (only one playlist per answer). We'll then select the best pl...

makhdoom ghaya

261 views

makhdoom ghaya asked Aug 20, 2022

0 votes

0 answers

36

In the "Intersted variable method" for synchronization is there a possiblity of deadlock or spinlock?

JAINchiNMay

231 views

JAINchiNMay asked Jun 23, 2022

0 votes

1 answer

37

Gate Applied Test Series
Question→ Given a system with 3 processes where each process requires at least 2 resources to complete their execution, then the largest number of resources which will guarantee a deadlock is ___ Answer Given is: 1

Question→ Given a system with 3 processes where each process requires at least 2 resources to complete their execution, then the largest number of resources which will ...

lalitver10

685 views

lalitver10 asked Jan 22, 2022

0 votes

1 answer

38

OS Applied Test Series
Suppose there is a (non-virtual memory) system that has only 200 Mb of main memory and there are two processes that make the following sequence of requests: P1 P2 ... ... Request 80Mb; Request 70Mb; ... ... Request 60Mb; Request 80Mb; Consider ... requests 70 Mb. This is a deadlock. Statement 2: There is no possibility of a deadlock. Which of the above statements are correct?

Suppose there is a (non-virtual memory) system that has only 200 Mb of main memory and there are two processes that make the following sequence of requests: P1 ...

Sagar475

431 views

Sagar475 asked Jan 26, 2022

1 votes

2 answers

39

made easy test series - deadlock - operating systems
Consider a system having ‘m’ resources of the same type. The resources are shared by 3 processes A, B and C which have peak time demands of 5, 7 and 4 respectively. The minimum value of ‘m’ that will ensure that deadlock will never occur is _____.

Consider a system having ‘m’ resources of the same type. The resources are shared by 3 processes A, B and C which have peak time demands of 5, 7 and 4 respectively. T...

atulcse

1.0k views

atulcse asked Jan 12, 2022

1 votes

1 answer

40

Test Series- Applied:
Given a system with 3 processes where each process requires at least 2 resources to complete their execution, then the largest number of resources which will guarantee a deadlock is ___ I answered it as 3. Because it asked for maximum which is not correct. Can someone help me in this.

Given a system with 3 processes where each process requires at least 2 resources to complete their execution, then the largest number of resources which will guarantee a ...

ramakrushna

396 views

ramakrushna asked Dec 20, 2021

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true