OS-Deadlock

OS-Deadlock

Professional Development

10 Qs

quiz-placeholder

Similar activities

OWASP Top 10

OWASP Top 10

Professional Development

10 Qs

Computer Hardware and Software Quiz

Computer Hardware and Software Quiz

Professional Development

10 Qs

UD Cybersecurity Pro

UD Cybersecurity Pro

Professional Development

10 Qs

KOE034: Sensors and Instruments

KOE034: Sensors and Instruments

Professional Development

11 Qs

Artificial Intelligence Trivia Quiz

Artificial Intelligence Trivia Quiz

Professional Development

12 Qs

Linux Command Line Quiz

Linux Command Line Quiz

Professional Development

14 Qs

COMPUTER & INTERNET ESSENTIAL

COMPUTER & INTERNET ESSENTIAL

Professional Development

10 Qs

Weekly Quiz 1

Weekly Quiz 1

4th Grade - Professional Development

10 Qs

OS-Deadlock

OS-Deadlock

Assessment

Quiz

Computers

Professional Development

Practice Problem

Hard

Created by

Kanagaraju P

Used 229+ times

FREE Resource

AI

Enhance your content in a minute

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which of the following condition is required for deadlock to be possible?

mutual exclusion

a process may hold allocated resources while awaiting assignment of other resources

no resource can be forcibly removed from a process holding it

all of the mentioned

2.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

A system is in the safe state if

the system can allocate resources to each process in some order and still avoid a deadlock

there exist a safe sequence

all of the mentioned

none of the mentioned

3.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

The circular wait condition can be prevented by

defining a linear ordering of resource types

using thread

using pipes

all of the mentioned

4.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which one of the following is the deadlock avoidance algorithm?

banker’s algorithm

round-robin algorithm

elevator algorithm

karn’s algorithm

5.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

A process said to be in ___________ state if it was waiting for an event that will never occur.

Safe

Unsafe

Starvation

Dead lock

6.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

A computer system has 6 tape drives, with 'n' processes competing for them. Each process may need 3 tape drives. The maximum value of 'n' for which the system is guaranteed to be deadlock free is

4

3

2

1

7.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence?

resource allocation graph

starvation graph

inversion graph

none of the mentioned

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?