Step 1: Definition of CPU Scheduler.
The CPU scheduler, also known as the short-term scheduler, is responsible for selecting a process from the ready queue and allocating CPU time to it. This decision is made at a fast pace, typically every few milliseconds.
Step 2: Analysis of Options.
- (A) **Short Term Scheduler**: Correct, as it is the one responsible for the allocation of CPU time.
- (B) **Long Term Scheduler**: Incorrect, this scheduler determines which processes are admitted into the system, but does not directly schedule processes to the CPU.
- (C) **Medium Term Scheduler**: Incorrect, this scheduler manages the degree of multi-programming by swapping processes in and out of the memory.
- (D) **Asymmetric Scheduler**: Incorrect, this is not a standard term used for CPU scheduling.
Step 3: Conclusion.
The **Short Term Scheduler** is the CPU scheduler, so the correct answer is **(A) only**.
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.