Question 12 (1 point)

Suppose a CPU scheduler sets a fixed time quantum for all processes for a round-robin scheduling. The processes are ordered according to their priorities assigned by the OS and are allowed to run for the quantum, if needed. Which of the following would ensure lower average turnaround time?

Question 12 options:

	Assigning equal priorities to CPU-bound processes and I/O bound processes.
	Assigning higher priorities to CPU-bound processes than I/O bound processes.
	Setting time quantum sufficiently smaller than average burst of I/O-bound processes.
	Assigning higher priorities to I/O-bound processes than CPU-bound processes.
	Setting time quantum sufficiently larger than average burst of CPU-bound processes.

Question 13 (1 point)

In designing a time-sharing system, the key objective is to achieve

Question 13 options:

	very high throughput
	very high degree of resource sharing
	very low response time
	very low communication overhead

Question 14 (1 point)

A user program executes in a __________ , in which certain areas of memory are protected from the user's use, and in which certain instructions may not be executed.

Question 14 options:

	kernel mode
	task mode
	user mode
	batch mode

Question 15 (1 point)

A test-and-set machine instruction has a form of TS(R, x) where R is a register and x is a memory location. What operations are performed with R and x?

Question 15 options:

	Copy x to R, then set R to 0.
	Copy R to x, then set R to 0.
	Copy x to R, then set x to 0.
	Copy R to x, then set x to 0.