menu
search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

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
in Operating System
edited by 888 views

3 Answers

3 votes
 
Best answer

Answer : A

      

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 by
1

Answer : A

2 votes
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
Answer A
← Prev. Next →
← Prev. Qn. in Sub. Next Qn. in Sub. →
Answer:

Related questions

1 vote
2 answers
1
1.2k views
UGCNET-Sep2013-II: 50
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$ speed up ... $S=\frac{n t_n}{(k-n+1)t_p}$ $S=\frac{(k+n-1)t_p}{n t_n}$
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}$
asked Jul 21, 2016 in Operating System jothee 1.2k views
1 vote
1 answer
2
1.6k views
UGCNET-Sep2013-II: 47
Assume that an implementation of Unix operating system uses i-nodes to keep track of data blocks allocated to a file. It supports 12 direct block addresses, one in direct block address and one double indirect block address. The file system has 256 bytes block size and 2 bytes for disk block address. The maximum possible size of a file in this system is 16 MB 16 KB 70 KB 71 KB
Assume that an implementation of Unix operating system uses i-nodes to keep track of data blocks allocated to a file. It supports 12 direct block addresses, one in direct block address and one double indirect block address. The file system has 256 bytes block size and 2 bytes for disk block address. The maximum possible size of a file in this system is 16 MB 16 KB 70 KB 71 KB
asked Jul 21, 2016 in Operating System jothee 1.6k views
3 votes
1 answer
3
2.1k views
UGCNET-Sep2013-II: 46
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 : ... are : $144$ and $123$ milliseconds $143$ and $123$ milliseconds $149$ and $124$ milliseconds $256$ and $186$ milliseconds
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
asked Jul 21, 2016 in Operating System jothee 2.1k views
1 vote
1 answer
4
3.1k views
UGCNET-Sep2013-II: 45
The hit ratio of a Transaction Look Aside Buffer (TLAB) is 80%. It takes 20 nanoseconds (ns) to search TLAB and 100 ns to access main memory. The effective memory access time is _____ 36 ns 140 ns 122 ns 40 ns
The hit ratio of a Transaction Look Aside Buffer (TLAB) is 80%. It takes 20 nanoseconds (ns) to search TLAB and 100 ns to access main memory. The effective memory access time is _____ 36 ns 140 ns 122 ns 40 ns
asked Jul 21, 2016 in Operating System jothee 3.1k views
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...