THREADS

DIYA BASU asked Jan 5, 2019

107 views

See all

Please log in or register to answer this question.

Related questions

0 votes

2 answers

roopkathaaa asked Sep 2, 2023

1,588 views

deadlocks and threads operating system
A system has 5 process and 3 resources (A, B, C). The maximum count of resources are (10, 5, 7). Consider the following table of resource allocation. MAX (A B C) Allocated (A B C) P0 7 5 3 0 1 0 P1 3 2 2 2 0 0 P2 9 0 2 3 0 2 P3 2 ... these is a safe sequence in Question 13? P1, P3, P4 , P0, P2 only P2, P4, P3, P1, P0 only Both a and b None are safe sequences

A system has 5 process and 3 resources (A, B, C). The maximum count of resources are (10, 5, 7). Consider the following table of resource allocation. MAX(A B C)Alloc...

roopkathaaa

1.6k views

roopkathaaa asked Sep 2, 2023

0 votes

1 answer

roopkathaaa asked Sep 2, 2023

838 views

deadlocks and threads operating system
State true or false. Deadlock detection is possible using the allocation and request matrices alone. A way to recover from deadlock is to take away the resource from one of the processes or to kill the process itself. Banker's algorithm is ... deadlocks by analyzing the unsafe states. True, True, False False, True, True True, False, True False, True, False

State true or false.Deadlock detection is possible using the allocation and request matrices alone.A way to recover from deadlock is to take away the resource from one of...

roopkathaaa

838 views

roopkathaaa asked Sep 2, 2023

0 votes

1 answer

roopkathaaa asked Sep 2, 2023

301 views

daedlocks and threads operating system
Suppose we want to synchronize two concurrent process P and Q using binary semaphore S and T. Process P: Process Q: while(1){ while(1){ W: Y: print 0'; print 1'; print 0'; print 1'; X: Z: } Synchronization statements can be inserted only at points W,X,Y,Z. Which of the ... S = T= 1 d. W : P(S) X : V(S) Y : P(T) Z: V(T) and initially S = 1 and T= 0

Suppose we want to synchronize two concurrent process P and Q using binary semaphore S and T.Process P: Process Q: while(1){ ...

roopkathaaa

301 views

roopkathaaa asked Sep 2, 2023

0 votes

1 answer

roopkathaaa asked Sep 2, 2023

267 views

deadlocks and threads operating system
Which of the following is false about User threads? User threads can switch fast since it does not involve kernel. User threads are lightweight since they do not require system calls. Kernel is not aware of the behavior of every user threads i.e. if it is blocking or runnable. None of these

Which of the following is false about User threads? User threads can switch fast since it does not involve kernel. User threads are lightweight since they do not require ...

roopkathaaa

267 views

roopkathaaa asked Sep 2, 2023

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

THREADS

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

0