Step 1: Definition of SJF.
SJF (Shortest Job First) is a non-preemptive CPU scheduling algorithm that selects the process with the shortest burst time for execution next. It minimizes the average waiting time.
Step 2: Analysis of other options.
- (1) FCFS: First Come First Serve executes processes in the order of their arrival, not based on burst time.
- (3) Round Robin: This algorithm assigns fixed time slices to processes, regardless of their burst time.
- (4) Priority Scheduling: Processes are scheduled based on their priority, not burst time.
Step 3: Conclusion.
The correct answer is **SJF**, which prefers the process with the shortest burst time.
Find the next two terms of the series:
The given series is: \( A, C, F, J, ? \).
(A) O
(B) U
(C) R
(D) V
Choose the correct answer from the options given below:
Find the number of triangles in the given figure.
