# UGCNET-Sep2013-II: 44

1 vote
888 views

Match the following :

$\begin{array}{|l|l|l|l|} \hline& \textbf{List-I} && \textbf{List-II} \\ & \textbf{Process state} && \textbf{Reason for transition}\\ & \textbf{transition} \\\hline \text{a.} & \text{Ready$\rightarrow$Running} & \text{i.} & \text{Request made by the process is satisfied or} \\ &&& \text{an event for which it was waiting to occurs} \\\hline \text{b.} & \text{Blocked$\rightarrow$Ready } & \text{ii.} & \text{Process wishes to wait for some action by} \\ &&& \text{another process} \\\hline \text{c.} & \text{Running$\rightarrow$Blocked} & \text{iii.} & \text{The process is dispatched} \\\hline \text{d.} & \text{Running$\rightarrow$Ready}& \text{iv.}& \text{The Process is preempted} \\\hline \end{array}$

1. a-iii, b-i, c-ii, d-iv
2. a-iv, b-i, c-iii, d-ii
3. a-iv, b-iii, c-i, d-ii
4. a-iii, b-iv, c-ii, d-i

edited

 a. Ready →→ Running iii. The process is dispatched b. Blocked →→Ready i. Request made by the process is satisfied or an event for which it was waiting occurs c. Running →→Blocked ii. Process wishes to wait for some action by another process d. Running →→Ready iv. The process is preempted

selected
1

 a. Ready →→ Running iii. The process is dispatched b. Blocked →→Ready i. Request made by the process is satisfied or an event for which it was waiting occurs c. Running →→Blocked ii. Process wishes to wait for some action by another process d. Running →→Ready iv. The process is preempted
1 vote

## Related questions

1 vote
1
1.2k views
The speed up of a pipeline processing over an equivalent non-pipeline processing is defined by the ration: where $n \rightarrow$ no. of tasks $t_n \rightarrow$ time of completion of each tasks $k \rightarrow$ no. of segments of pipeline $t_p \rightarrow$ clock cycle time $S \rightarrow$ ... $S=\frac{n t_n}{(k-n+1)t_p}$ $S=\frac{(k+n-1)t_p}{n t_n}$
1 vote
Consider the input/output (I/O) request made at different instants of time directed at a hypothetical disk having 200 tracks as given in the following table : ... algorithms respectively are : $144$ and $123$ milliseconds $143$ and $123$ milliseconds $149$ and $124$ milliseconds $256$ and $186$ milliseconds