Question 27

CSMCQ2 marksNeeds review
A multithreaded program P executes with

number of threads and uses

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

, then it cannot re-acquire lock

without releasing it. If a thread is unable to acquire a lock, it blocks until the lock becomes available. The minimum value of

and the minimum value of

together for which execution of P can result in a deadlock are:
Your answerChoose one option.

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

EXPLORE & PRACTISE

Paper and topic context

See where this question comes from and choose what to practise next.

2017CS

GATE CSE 2017 · Paper 1

Computer Science and Information Technology · Original paper archive

Section
Computer Science and Information Technology
Question type
Multiple choice (MCQ)
Marks
2 marks

Practise related topics

Explore more previous year questions using this question’s imported topic tags.

computer science

GATE CSE previous year questions

information technology

GATE CSE previous year questions

computing

GATE CSE previous year questions

operating system

GATE CSE previous year questions

threads

GATE CSE previous year questions

deadlock

GATE CSE previous year questions

Comments

Ask a question, share your approach, or help someone understand.

Log in to view the discussion

You’re not logged in. Log in or create an account to see discussions and add comments.