Register

GATE CSE 2009 | Question: 32

• edited by
19,697 views
37 votes
37 votes

In the following process state transition diagram for a uniprocessor system, assume that there are always some processes in the ready state:

Now consider the following statements:

  1. If a process makes a transition $D$, it would result in another process making transition $A$ immediately.
  2. A process $P_2$ in blocked state can make transition E while another process $P_1$ is in running state.
  3. The OS uses preemptive scheduling.
  4. The OS uses non-preemptive scheduling.

Which of the above statements are TRUE?

  1. I and II
  2. I and III
  3. II and III
  4. II and IV
• edited by
User Avatar

3 Answers

Best answer
73 votes
73 votes
  1. If a process makes a transition $D$, it would result in another process making transition $A$ immediately. - This is false. It is not said anywhere that one process terminates, another process immediately come into Ready state. It depends on availability of process to run & Long term Scheduler.
  2. A process $P2$ in blocked state can make transition $E$ while another process $P2$ is in running state. - This is correct. There is no dependency between running process & Process getting out of blocked state.
  3. The OS uses preemptive scheduling. :- This is true because we got transition $C$ from Running to Ready.
  4. The OS uses non-preemptive scheduling.Well as previous statement is true, this becomes false.

So answer is (C) II and III .

• edited by
User Avatar
23 votes
23 votes

Answer is C :

The reason why option 1 may be false :If the process terminate ; then the Short time scheduler will bring immediately process from ready to run (not from new to ready ) . The process of bringing a process from new to ready is responsibility is job of Long Term Scheduler (which is called not so frequently as compared to Short Time Scheduler . Hence we named it Long Time Scheduler . the decision taken by it stays for a long time )

User Avatar
7 votes
7 votes
It is C.

The option I is not necessarily true.
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

10.9k
views
5 answers
34 votes
go_editor asked Apr 23, 2016
10,904 views
GATE CSE 2009 | Question: 52
A hard disk has $63$ sectors per track, $10$ platters each with $2$ recording surfaces and $1000$ ... $\langle 0, 17, 31 \rangle$
User Avatar
20.5k
views
5 answers
49 votes
Kathleen asked Sep 22, 2014
20,533 views
GATE CSE 2009 | Question: 51
A hard disk has $63$ sectors per track, $10$ platters each with $2$ recording surfaces and $1000$ cylinders. The address of a sector is given as a ... \langle 400, 16, 29 \rangle$ corresponds to sector number:$505035$505036$505037$505038$
User Avatar
25.7k
views
13 answers
62 votes
Kathleen asked Sep 22, 2014
25,732 views
GATE CSE 2009 | Question: 33
The enter_CS() and leave_CS() functions to implement critical section of a process are realized using test-and-set instruction as follows:void enter_CS(X) { while(test-and-set(X)); ... are TRUE?(I) only(I) and (II)(II) and (III)(IV) only
User Avatar
8.6k
views
3 answers
20 votes
Kathleen asked Sep 22, 2014
8,646 views
GATE CSE 2009 | Question: 31
Consider a disk system with $100$ cylinders. The requests to access the cylinders occur in following sequence:$4, 34, 10, 7, 19, 73, 2, 15, 6, 20$Assuming that the head is ... $119\;\text{ms}$233\;\text{ms}$276\;\text{ms}$
User Avatar
Link Copied!