CameraIcon

SearchIcon

MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Types of Threads

A multithread...

Question

A multithreaded program P executes with x number of threads and uses y number of locks for ensuring mutual exclusion while operating on shared memory locations. All locks in the program are non-reentrant, i.e., if a thread holds a lock $l$ , then it cannot re-acquire lock $l$ without relasing it. If a thread is unable to acquire a lock, it blocks unitl the lock becomes available. The minimum value of x and the minimum value of y together for which execution of P can result in a deadlock are:

A

x = 2, y = 1

No worries! We‘ve got your back. Try BYJU‘S free classes today!

B

x = 2, y = 2

No worries! We‘ve got your back. Try BYJU‘S free classes today!

C

x = 1, y = 1

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

D

x = 1, y = 2

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is C x = 1, y = 1
x = 1, y = 1

Suggest Corrections

thumbs-up

0

Similar questions

Q. A safe has 5 locks, v, w, x, y and z ; all of which must be unlocked for the safe to open. The keys to the locks are distributed among five executives in the following manner :

Mr. P has keys for locks v and x.
Mr. Q has keys for locks v and y.
Mr. R has keys for locks w and x.
Mr. S has keys for locks x and z.
Mr. T has keys for locks v and z.

The minimum number of executives required to open the safe is _____

Q. Fetch_And_Add(X,i) is an atomic Read-Modify-Write instruction that reads the value of memory location X, increments it by the value i, and returns the old value of X, it is used in the pseudocode shown below to implement a busy-wait lock. L is unsigned integer shared variable initialized to 0. The value of 0 corresponds to lock being available, while any non-zero value corresponds to the lock being not available.

AcquireLock (L) {
while (Fetch_And_Add(L,1))
L = 1;
}
Release Lock (L){
L=0;
}
This implementation

Q. Pick up the correct statements of the following:
P. All conflict serializable schedules are also view serializable schedules.
Q. R1(x), W2(y) are conflict operations
R. Shared and Exclusive locks are released only after commit in strict two phase locking protocol

Q. Consider the following statements :

S_{1}

: While program in execution, access to heap memory is slower as compared to accessing variables allocated on stack.

S_{2}

: While program in execution, in a multithread situation, each thread has its own stack and share a common heap memory.

S_{3}

: During a program execution, heap is stored in main memory and stack is present in secondary memory.
Which of the above is incorrect ?

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Types of Threads

OTHER

Watch in App

explore_more_icon

Explore more

Types of Threads

Join BYJU'S Learning Program

CrossIcon