Matching: FCFS Give CPU according to highest priority SJF Gives a CPU to process which come first Priority Scheduling Gives CPU to process with shortest burst time RR Time sharing

Explanation: Solution: FCFS (First-Come, First-Served) : As the name suggests, the process that arrives first in the ready queue is allocated the CPU first. So, it matches with . SJF (Shortest Job First) : This algorithm selects the process with the smallest execution (burst) time to execute next. So, it matches with . Priority Scheduling : In this algorithm, the CPU is allocated to the process based on its priority level. So, it matches with . RR (Round Robin) : This is a preemptive scheduling algorithm designed for Time-sharing systems, where each process gets a small unit of CPU time (time quantum). So, it matches with . Based on these matches: Correct Option: (a)

How do I solve CUET PG 2026 Computer questions?

Practice CUET PG 2026 Computer previous year questions with step-by-step solutions on Mathem Solvex. Each question includes a detailed explanation and video solution to help you master the concept quickly.

What is the difficulty level of CUET PG Computer questions?

CUET PG Computer questions range from moderate to advanced difficulty. Consistent practice with official previous year papers and topic-wise drills on Mathem Solvex is the most effective preparation strategy.

Are CUET PG previous year papers available for free?

Yes. Mathem Solvex provides free access to CUET PG previous year question papers and topic-wise PDFs. You can download them or attempt them as timed live mock tests directly on the platform.

+91 99359 65550 contact@maarula.in

Mathem Solvex

Get the solution of every question

Preparing for Excellence...

CUET PG 2026 Computer PYQ — Matching: FCFS Give CPU according to highest priority SJF Gives a… | Mathem Solvex | Mathem Solvex

Tip:A–D to answerE for explanationV for videoS to reveal answer

CUET PG 2026 — Computer PYQ

CUET PG | Computer | 2026

Matching:


$(A)$	FCFS	$I.$	Give CPU according to highest priority
$(B)$	SJF	$II.$	Gives a CPU to process which come first
$(C)$	Priority Scheduling	$III.$	Gives CPU to process with shortest burst time
$(D)$	RR	$IV.$	Time sharing

Choose the correct answer: