CDS3001-3

CDS3001-3

University

10 Qs

quiz-placeholder

Similar activities

[Quiz] Intro to OS (Pre Test)

[Quiz] Intro to OS (Pre Test)

University

11 Qs

Ch08-Deadlock

Ch08-Deadlock

University

10 Qs

C-21 CS-405 OS Quiz-2

C-21 CS-405 OS Quiz-2

University

10 Qs

Operating System

Operating System

University

10 Qs

Operating System by Baba

Operating System by Baba

University

12 Qs

REMEDIAL KELAS A 16042020

REMEDIAL KELAS A 16042020

University

10 Qs

ReflectiveQuizDDT1A_07102020

ReflectiveQuizDDT1A_07102020

University

10 Qs

OS QUIZ(UNIT-III)

OS QUIZ(UNIT-III)

University

10 Qs

CDS3001-3

CDS3001-3

Assessment

Quiz

Computers

University

Hard

Created by

Ganesan 100377

FREE Resource

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

  1. 1. What is the characteristics of atomicity?

Use communication links.

One processor as coordinator which handles all requests.

All operations associated are executed to completion or none are performed.

When responses are received from all processes, then process can enter its CS.

2.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

  1. 2. Most of the web applications are usign ________ architecture.

Master-slave

Two-tier

Three-tier

Peer-to-Peer

3.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

  1. 3. The request and release of resources are ___________

command line statements

interrupts

system calls

special programs

4.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

  1. 4. Which of the following is not a valid deadlock prevention scheme?

Request and all required resources be allocated before execution.

Never request a resource after releasing any resource.

Number the resources uniquely and never request a lower numbered resource than the last one requested.

Release all resources before requesting a new resource.

5.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

  1. 5. Which of the following is true with respect to deadlock avoidance?

The Bakery algorithm is used to deal with deadlock avoidane.

When a process is created in a deadlock, it must declare its minimum claim.

The avoidance strategy depends on additional information about short-term resource needs.

With the deadlock avoidance approach, the system is always kept in a safe state.

6.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

  1. 6. Which one of the following is the deadlock avoidance algorithm?

Round-robin

Banker’s

Elevator

Karn’s

7.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

  1. 7. Which of the following condition is required for a deadlock to be possible?

Mutual Exclusion

A process may hold allocated resources while awaiting assignment of other resources.

No resources can be forciby removed from a process holding it.

All of the above

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?