• edited by
15,048 views
38 38 votes

The process state transition diagram in the below figure is representative of

  1. a batch operating system

  2. an operating system with a preemptive scheduler

  3. an operating system with a non-preemptive scheduler

  4. a uni-programmed operating system

4 Answers

Best answer
49 49 votes

Answer is (B). The transition from running to ready indicates that the process in the running state can be preempted and brought back to ready state.

• edited by
3 3 votes

The definitive clue lies in the two bidirectional arrows between the RUNNING and READY states:

  1. RUNNING -> READY: This arrow represents preemption (e.g., a timer interrupt or a higher priority process arriving). A process is forced off the CPU even though it hasn't finished its work or blocked for I/O.
  2. READY -> RUNNING: This arrow represents scheduling (when the short-term scheduler picks a process to run).
Hence, Option B is Correct

Other Options: 

  • C. non-preemptive scheduler: In a non-preemptive system, once a process is RUNNING, it cannot be kicked out. It stays on the CPU until it finishes (TERMINATED) or waits for an event (BLOCKED). Therefore, a non-preemptive diagram would completely lack the arrow pointing from RUNNING -> READY.
  • A & D. batch / uni-programmed system: These primitive systems run only one process at a time until completion without interactive switching or time-slicing.

Batch System (Option A)

  • No Multitasking: One job runs directly from start to finish.
  • No Queue: Memory holds the OS and exactly one single job. Other jobs wait outside on disk/cards. There is no READY queue in memory.
┌───────┐      ┌─────────┐      ┌────────────┐
│  NEW  │ ───► │ RUNNING │ ───► │ TERMINATED │
└───────┘      └─────────┘      └────────────┘
                    │
                    │ Wants I/O (CPU sits completely idle)
                    ▼
               ┌─────────┐
               │ BLOCKED │
               └─────────┘

Uni-Programmed System (Option D)

  • Has a Queue: : Memory holds the OS and multiple waiting jobs inside a structured READY queue. However, the CPU can still only pick and execute one program at a time non-preemptively.
  • No Preemption: A running process cannot be kicked back to READY.
┌───────┐      ┌───────┐      ┌─────────┐      ┌────────────┐
│  NEW  │ ───► │ READY │ ───► │ RUNNING │ ───► │ TERMINATED │
└───────┘      └───────┘      └─────────┘      └────────────┘
                   ▲               │
                   │               │ Wants I/O
                   │ I/O Done      ▼
                   └───────────┌─────────┐
                               │ BLOCKED │
                               └─────────┘


1 1 vote

Option B is TRUE

Option A: False Batch system is not the correct answer .Proof is taken from 

Galvin OS ninth edition page number :66

Batch os many processes are submitted and then can be executed immediately 

BATCH SYSTEM processed jobs in bulk,with predetermined input from files or other data sources.

From these we can conclude that Batch os executes jobs sequentially and no preemption.

So 

Answer:
Position:
Show:

Related questions

82 82 votes
5 answers 5 answers
33.6k
33.6k views
Kathleen asked Oct 9, 2014
33,556 views
A $1000$ $\text{Kbyte}$ memory is managed using variable partitions but no compaction. It currently has two partitions of sizes $200$ $\text{Kbyte}$ and $260$ $\text{Kbyt...
27 27 votes
2 answers 2 answers
6.8k
6.8k views
Kathleen asked Oct 9, 2014
6,752 views
Consider the following program that attempts to locate an element $x$ in an array $a[ ]$ using binary search. Assume $N 1$. The program is erroneous. Under what conditio...
38 38 votes
6 answers 6 answers
16.6k
16.6k views
Kathleen asked Oct 9, 2014
16,618 views
Which of the following is an example of spooled device?A line printer used to print the output of a number of jobsA terminal used to enter input data to a running program...
47 47 votes
3 answers 3 answers
15.5k
15.5k views
Kathleen asked Oct 9, 2014
15,526 views
A file system with a one-level directory structure is implemented on a disk with disk block size of $4K$ bytes. The disk is used as follows:$$\begin{array}{|l|}\hline \te...