Question

Match the following :

	List - I		List - II
(1)	Threads	(a)	Operating system
(2)	Scheduling	(b)	First come first served
(3)	Process switch	(c)	Light weight process with reduced state
(4)	Non preemptive	(d)	Mode switch

• A. $1-\left(a\right),2-\left(b\right),3-\left(c\right),4-\left(d\right)$
• B. $3-\left(a\right),1-\left(b\right),4-\left(c\right),2-\left(d\right)$
• C. $4-\left(a\right),3-\left(b\right),2-\left(c\right),1-\left(d\right)$
• D. $3-\left(a\right),4-\left(b\right),2-\left(c\right),1-\left(d\right)$

Answer 1

The correct option is B $3-\left(a\right),1-\left(b\right),4-\left(c\right),2-\left(d\right)$

Process switch:-

A process switch is an operating system scheduler change from one running program to another. This requires saving all of the state of the currently executing program, including its register state, associated kernel state, and all of its virtual memory configuration.

FCFS:-

First come, first served (FCFS), is the simplest scheduling algorithm. FIFO simply queues processes in the order that they arrive in the ready queue.

Non preemptive:-

Non-preemptive scheduling is one which can be applied in the circumstances when a process terminates, or a process switches from running to waiting state.

Threads:-

A thread of execution is the smallest sequence of programmed instructions that can be managed independently by a scheduler, which is typically a part of the operating system.