Question 31 (1 point)

Which algorithm schedules processes according to the CPU time needed at the time of the scheduling decision?

Question 31 options:

	First-In-First-Out (FIFO)
	Round Robin (RR)
	Last-In-First-Out (LIFO)
	Shortest Remaining Time (SRT)
	Shortest Job First (SJF)

Question 32 (1 point)

Which of the following event/action causes a process to move from running state to ready state?

Question 32 options:

	Initiating an I/O event
	Timer interrupt
	Completion of an I/O event
	A scheduler activity

Question 33 (1 point)

Which of the following is not a benefit of multiprocessor system?

Question 33 options:

	Increased convenience of operation
	Increased sharing of hardware resources
	Higher throughput
	More fault-tolerance

Question 34 (1 point)

Which of the following is not a typical benefit of multithreading?

Question 34 options:

	Enhanced responsiveness of the program
	Ease of development
	Effective use of multiprocessor systems
	Increased sharing of resources

Question 35 (1 point)

Cooperating processes sharing resources in read-only mode do not encounter race condition.

Question 35 options:

	True
	False