uestion 36 (1 point)

Which scheduling algorithm guarantees best average turnaround time for any set of processes?

Question 36 options:

	Shortest-job-first
	Round robin
	First-In-First-Out
	Multilevel feedback

Question 37 (1 point)

In a pure user thread facility, all of the work of thread management is done by the application, and the kernel is not aware of the existence of threads.

Question 37 options:

	True
	False

Question 38 (1 point)

Using threads rather than multiple processes avoids the need for ______?

Question 38 options:

	shared programs
	multiple CPUs
	instruction sequence
	code replication

Question 39 (2 points)

Explain whether the following series of process state transitions is valid or invalid:

new ready suspended blocked suspended

Question 40 (1 point)

A process control block replicates its information to each thread control block. What data was replicated?

Question 40 options:

	Open files
	Code
	Memory
	CPU and process state