benchmarks.wiki

benchmarks.wiki / Public workspace

MMLU / Consider a computer system in which processes can request and release one or…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

question

Consider a computer system in which processes can request and release one or more resources. Once a process has been granted a resource, the process has exclusive use of that resource until it is released. If a process requests a resource that is already in use, the process enters a queue for that resource, waiting until the resource is available. Which of the following will NOT deal effectively with the problem of deadlock?

choices

  1. Giving priorities to processes and ordering the wait queues by priority
  2. Having a process request all its required resources when it first begins, and restarting if it cannot obtain them all
  3. Numbering the resources and requiring that processes request resources in order of increasing number
  4. Having processes time out and restart after a random interval of waiting

subject

college_computer_science

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

task_id
4688bc53-d429-50f4-9a96-0bc6705deab3
task_key
all--test--4688bc53-d429-50f4-9a96-0bc6705deab3
task_revision_id
1
config / split
all / test

Official source

initial import