benchmarks.wiki / Public workspace

MMMU-Pro / test_Computer_Science_158 / Suppose four processes, P1, P2, P3 and P4, with CPU burst times of 6, 8, 7 and…

Problem

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

question

Suppose four processes, P1, P2, P3 and P4, with CPU burst times of 6, 8, 7 and 3, respectively, arrive in the order P1, P2, P3, P4 at times 0, 1, 2, and 3, respectively. If the CPU is using a preemptive shortest-job-first schedule, which Gantt chart represents the execution schedule?

img type

  • Diagrams

options

  1. None of the other answers
  2. <image 5>
  3. <image 1>
  4. <image 2>
  5. <image 3>
  6. <image 4>

subject

Computer_Science
image_1.png
image_2.png
image_3.png
image_4.png
image_5.png

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