benchmarks.wiki / Public workspace

MMLU / A starvation-free job-scheduling policy guarantees that no job waits…

Problem

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

question

A starvation-free job-scheduling policy guarantees that no job waits indefinitely for service. Which of the following job-scheduling policies is starvation-free?

choices

  1. Round-robin
  2. Priority queuing
  3. Shortest job first
  4. Youngest job first

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

Official source

initial import