Step 1: Explanation of Algorithms.
- **FCFS** (First Come First Serve): A non-preemptive scheduling algorithm that schedules processes based on their arrival order. If preemption is added, it becomes **FCFS + preemption** (I).
- **Round Robin**: A scheduling algorithm where processes are assigned a fixed time quantum and allowed to move between queues (II).
- **Multi-level queue scheduling**: This algorithm assigns processes to specific queues based on priority or other criteria, leading to often long average waiting time (III).
- **Multi-level Feedback Queue**: Processes can move between queues based on their behavior, and this algorithm does not permanently assign processes to one queue (IV).
Step 2: Match the list.
- (A) FCFS matches (I) FCFS + preemption.
- (B) Round Robin matches (II) Allows the processes to move between queues.
- (C) Multi-level queue scheduling matches (III) Often long average waiting time.
- (D) Multi-level Feedback Queue matches (IV) Permanent assignment of processes to one specific queue.
Step 3: Conclusion.
Thus, the correct matching is **(A) - (I), (B) - (II), (C) - (III), (D) - (IV)**.
In C language, mat[i][j] is equivalent to: (where mat[i][j] is a two-dimensional array)
Suppose a minimum spanning tree is to be generated for a graph whose edge weights are given below. Identify the graph which represents a valid minimum spanning tree?
\[\begin{array}{|c|c|}\hline \text{Edges through Vertex points} & \text{Weight of the corresponding Edge} \\ \hline (1,2) & 11 \\ \hline (3,6) & 14 \\ \hline (4,6) & 21 \\ \hline (2,6) & 24 \\ \hline (1,4) & 31 \\ \hline (3,5) & 36 \\ \hline \end{array}\]
Choose the correct answer from the options given below:
Match LIST-I with LIST-II
Choose the correct answer from the options given below:
Consider the following set of processes, assumed to have arrived at time 0 in the order P1, P2, P3, P4, and P5, with the given length of the CPU burst (in milliseconds) and their priority:
\[\begin{array}{|c|c|c|}\hline \text{Process} & \text{Burst Time (ms)} & \text{Priority} \\ \hline \text{P1} & 10 & 3 \\ \hline \text{P2} & 1 & 1 \\ \hline \text{P3} & 4 & 4 \\ \hline \text{P4} & 1 & 2 \\ \hline \text{P5} & 5 & 5 \\ \hline \end{array}\]
Using priority scheduling (where priority 1 denotes the highest priority and priority 5 denotes the lowest priority), find the average waiting time.