OS_06

OS_06

2nd Grade

44 Qs

quiz-placeholder

Similar activities

NEW combined 1.5.1 1.5.2

NEW combined 1.5.1 1.5.2

2nd Grade

49 Qs

General Computer Questions

General Computer Questions

1st - 5th Grade

40 Qs

Networks and Internet Quiz

Networks and Internet Quiz

1st - 4th Grade

48 Qs

Scratch Final Quiz

Scratch Final Quiz

1st - 5th Grade

40 Qs

Sidharth Day 3 Quiz

Sidharth Day 3 Quiz

KG - Professional Development

40 Qs

COMPUTER DIAGNOSTIC TEST

COMPUTER DIAGNOSTIC TEST

KG - 11th Grade

39 Qs

Linux2 - Lesson 6 (exam training)

Linux2 - Lesson 6 (exam training)

1st - 10th Grade

40 Qs

Active Directory,Net-NTLM, Kerberos Quiz

Active Directory,Net-NTLM, Kerberos Quiz

1st - 5th Grade

49 Qs

OS_06

OS_06

Assessment

Quiz

Computers

2nd Grade

Hard

Created by

Lê Thị Phương Dung (FE FPTU CT)

Used 1+ times

FREE Resource

44 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

If a system is deadlocked, no processes can *

release resources

be awakened

all of the other choices

run

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Dijkstra's Banker's Algorithm require the system to maintain the resource information for each process, including:

The maximum resources that can be requested by the process

The number of resources currently acquired by the process

A count of the system's total resources

The maximum resources that can be requested and The number of resources currently acquired by the process

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which deadlock condition does Request all resources initially attack? *

Hold and wait

Mutual exclusion

Circular-wait condition

No preemption

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the correct approach with requesting the dedicated devices to solve deadlock using Ostrich algorithm?

The device driver decides blocking and returning an error code

The device driver kills those requesting processes

The device driver stops the current jobs and releases the devices

All of the other choices

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

If in a resource-allocation graph, each resource type has exactly one instance, which of the following indicate a deadlock situation? *

The graph has no cycle.

The graph is connected.

The graph is not connected.

The graph has at least one cycle.

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

____ is when, in modern printing systems, a disk accepts output from several users and acts as a temporary storage area for all output until the printer is ready to accept it *

Spooling

Spoofing

Lagging

Buffering

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the correct approach with the hold and wait condition to prevent Deadlock?

Spool everything

Request all resources initially

Take resources away

Order resources numerically

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?